Abstract:
Communication between clusters of processing nodes is initiated by designating a link layer address and a target node name in a remote cluster. The link layer address is transmitted to the target node via a regular network transmission. The link layer address is stored locally in each cluster and the nodes in each cluster are signaled that a configuration change has been made, so that gateway nodes in the clusters can obtain the link layer address to use for subsequent communications with the other cluster, such as event notifications of node status changes.
Abstract:
A gossiping scheme for sharing node status in a cluster of nodes provides a robust mechanism for determining node status within the cluster. Nodes transmit gossip messages to each other nodes, the gossip messages listing other nodes in the cluster that are operational. When a node does not receive a gossip message from a particular node within a predetermined time period, then the node transmits messages to the other nodes indicating that the particular node is down. However, if another node has received a packet from the particular node within the predetermined time period and receives the node down message, then the other node responds with a node alive message.
Abstract:
Provided are techniques related generally to computer communication and, more specifically, to techniques that provide legacy applications with access to a cluster infrastructure. A pseudo interface layer provides applications with internet protocol (IP) family sockets access to cluster awareness protocols in a manner that may be transparent to both the application and the cluster awareness layer of a kernel.
Abstract:
Communication ability between nodes in a cluster-based computer system is tracked to inform applications executing on the nodes of the existence and quality of the endpoint-to-endpoint communications available between the nodes. Communications between a node and other nodes are tracked, and a database records the communication ability between the node and the other nodes for each link between the nodes. The tracking and recording are repeated at the other nodes. A registration by an application executing at a particular one of the nodes to receive notifications of changes in the communication ability with another node over a particular link (or in general) will cause notification of the application when the link status changes.
Abstract:
A coupon creation, publication, and redemption system and method includes a business account module at a server configured to assign a deal creation power to a product or service provider accessing a website with a client, and a coupon generation module configured to generate a listing of a deal and a predetermined number of coupons associated with a deal. The coupon is published via the website. The provider's history of coupon generation is tracked. Coupon grabbing and redemption powers are assigned to a consumer. The consumer grabs the coupons via the website, and its history of coupon grabbing is tracked. When a sale consummated, the grabbed coupon is marked as redeemed, while both the consumer's and the provider's history of coupon redemption is updated. The consumer's grabbing power is transformed in accordance with at least one of the consumer's coupon grabbing and coupon redemption history. The deal provider's deal creation power is transformed in accordance with at least one of the provider's coupon generation and coupon redemption history.
Abstract:
Disclosed is a computer implemented method to resume a process at an arrival machine that is in an identical state to a frozen process on a departure machine. The arrival machine receives checkpoint data for the process from the departure machine. It creates the process. It updates a page table, wherein the page table comprises a segment, page number, and offset corresponding to a page of the process available from a remote paging device, wherein the remote paging device is remote from the arrival machine. It resumes the process and responsively generates a page fault for the page. It looks up the page in the page table, responsive to the page fault. It determines whether the page is absent in the arrival machine. It transmits a page-in request to the departure machine, responsive to a determination that the page is absent. It receives the page from the departure machine.
Abstract:
A gossiping scheme for sharing node status in a cluster of nodes provides a robust mechanism for determining node status within the cluster. Nodes transmit gossip messages to each other nodes, the gossip messages listing other nodes in the cluster that are operational. When a node does not receive a gossip message from a particular node within a predetermined time period, then the node transmits messages to the other nodes indicating that the particular node is down. However, if another node has received a packet from the particular node within the predetermined time period and receives the node down message, then the other node responds with a node alive message.
Abstract:
In one embodiment a method for migrating a workload from one processing resource to a second processing resource of a computing platform is disclosed. The method can include a command to migrate a workload that is processing and the process can be interrupted and some memory processes can be frozen in response to the migration command. An index table can be created that identifies memory locations that determined where the process was when it is interrupted. Table data, pinned page data, and non-private process data can be sent to the second processing resource. Contained in this data can be restart type data. The second resource or target resource can utilize this data to restart the process without the requirement of bulk data transfers providing an efficient migration process. Other embodiments are also disclosed.
Abstract:
According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt.
Abstract:
The present invention provides a computer implemented method, data processing system, and computer program product to selectively extracts compressed-encrypted files from an archive. The data processing system receives a command to preprocess the archive from an authenticated user, wherein the authenticated user is associated with at least one fingerprint. The data processing system determines that the at least one fingerprint fails to match all fingerprints in metadata of a first compressed-encrypted file in the archive. The data processing system, responsive to a determination that the fingerprint fails to match all fingerprints, deletes the compressed-encrypted file. The data processing system determines that the fingerprint matches a second fingerprint in metadata of a second compressed-encrypted file in the archive. The data processing system, responsive to a determination that the fingerprint matches the second fingerprint, avoids deleting the second compressed-encrypted file.