Abstract: A computer implemented method, computer program product, and system for creating a checkpoint of a stream. A stream checkpoint request to create the checkpoint of the stream is received, wherein the stream is used by a process as a communications path, and wherein the communications path is modified by a set of modules. In response to identifying the identity of each module in the set of modules, the identity of each module in the set of modules is stored in the checkpoint. In response to identifying an order of the set of modules, the order of the set of modules is stored in the checkpoint. In response to sending a stream checkpoint message to each module in the set of modules, module data is received from each module in the set of modules to form received module data. The received module data is stored in the checkpoint.

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: 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: A speaker assembly mounted on a bracket extending from a ceiling comprises an enclosure that includes a bottom wall, side walls including opposing first and second side walls, a sleeve that receives a tubular member of the bracket, and an interior wall having a first segment that extends from the sleeve to the first side wall and a second segment that extends from the sleeve to the second side wall. The interior wall cooperates with the sleeve to divide the enclosure into two approximately equal sized compartments. Each of the speakers within the assembly either forms, or is mounted in or on, one of the side walls. A top plate is mounted on, and forms a top of, the enclosure and seals the two compartments, the top plate having an opening that is aligned with the sleeve when the top plate is mounted on the enclosure. A power unit and circuitry for the speakers are mounted on the top plate.

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.

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: 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: 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: Migrating a workload partition (WPAR) is provided. Responsive to receiving a request to checkpoint the WPAR, a list of virtual identifiers used by the WPAR to refer to IPC objects is generated and stored. Each virtual identifier corresponds to an IPC object and to a real identifier used by a kernel that corresponds to the IPC object. IPC object data and control information is collected and stored. Each process in the WPAR stores per process data. Responsive to receiving a request to restart the WPAR, the virtual identifier that the WPAR wants to be used is registered. A new IPC object is created by a kernel. The kernel maps a real identifier used by the kernel for the new IPC object to the registered virtual identifier. The restart process retrieves IPC data and control information and overlays it on the new IPC object. The per process data is restored.

Abstract: The present invention provides a mobile station implemented method for managing a requested name and phone record. The method comprises steps of the requester associated device receiving a user's identification from a mobile station phonebook owner and a search term. The requester associated device transmits the user identification of the mobile station phonebook owner and the search term. Receiving at least one matching name and phone record, the requester associated device presents the at least one matching name and phone record to a user. The requester associated device receives a user management command to perform an action on the name and phone record. The method may complete when the requester associated device performs the action on the name and phone record.

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: Disclosed is a computer implemented method and computer program product 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. The arrival machine creates the process. The arrival machine 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. The arrival machine resumes the process. The arrival machine generates a page fault for the page, responsive to resuming the process. The arrival machine looks up the page in the page table, responsive to the page fault. The arrival machine determines whether the page is absent in the arrival machine. The arrival machine transmits a page-in request to the departure machine, responsive to a determination that the page is absent.

Abstract: Disclosed is a computer implemented method and computer program product to prioritize paging-in pages in a remote paging device. An arrival machine receives checkpoint data from a departure machine. The arrival machine restarts at least one process corresponding to the checkpoint data. The arrival machine determines whether a page associated with the process is pinned. The arrival machine associates the page to the remote paging device, responsive to a determination that the page is pinned. The arrival machine touches the page.

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 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: An event notification method for distributed processing systems provides reduction of queue space and event processing bandwidth associated with duplicate events such as a particular event that is duplicated and results in multiple event notifications propagated for multiple consumers. When a duplicate event notification is received at an input to an event notification queue, rather than queuing the duplicate event notification, a sequence number of the event notification already in the queue is updated to indicate to the event consumer, exactly how many duplicate events have been received. The timestamp of the updated event notification may also be set to the timestamp of the most recently received duplicate event notification.

Abstract: An event notification method for distributed processing systems provides remote and local node event notification in systems that require local registration of an event consumer in order produce an event notifications. To provide notification of an event occurring on a remote node, either event consumers on all nodes in the cluster register locally to receive event notifications and specify that the event is a cluster event, in which case the nodes send notification of their locally-occurring events to all nodes, or remote registrations are accepted at nodes and if a local consumer for the event is not present, a listener thread registers as an event consumer. The listener thread sends the event notifications to the remote nodes registered as consumers for the event by observing communication between the event producer and the local consumer, or receiving the event notifications directly if there is no local consumer.

Abstract: A method is provided for implementing multiple watchpoints or a watchpoint that is greater than one word in length. The method comprises a debugger receiving a watchpoint from a user, wherein the watchpoint identifies a portion of memory to be watched. The debugger then sends a read trap or write trap flag, for example READ_TRAP or WRITE_TRAP, to a memory protection module of an operating system identifying the portion of memory to be watched. A read or write operation is allowed on the watched portion of memory, but, after completion of the read or write operation, an exception signal is sent that indicates that the read or write operation occurred on the watched portion of memory. The debugger then provides output to a user regarding the exception.

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.