Patent application number | Description | Published |
20080294537 | METHOD TO SUPPORT ADVANCE ACCOUNTING WITHIN SOFTWARE PARTITIONS - A data processing system includes: a plurality of resources including a processor, a memory, and an operating system; a mechanism for generating one or more software partitions in addition to an administrative partition; and a global accounting engine which enables monitoring and recording of resource usage at both a global-level and a partition-level. Partition-level accounting data is returned for selected resources being utilized within a software partition. The data processing system also includes a first software partition, which utilizes one or more of the first plurality of resources and which includes a first partition-level accounting engine. The partition-level accounting engine provides monitoring and recording of resource usage within the first software partition and stores first partition usage data within a first partition accounting buffer. | 11-27-2008 |
20080294787 | CREATING A CHECKPOINT FOR MODULES ON A COMMUNICATIONS STREAM - 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. | 11-27-2008 |
20090037550 | METHOD AND APPARATUS FOR CHECKPOINT AND RESTART OF PSEUDO TERMINALS - A computer implemented method, apparatus, and computer program product for restarting pseudo terminal streams. In one embodiment, a device associated with a file descriptor in a set of file descriptors is opened. The set of file descriptors are identified in checkpoint data for restarting the pseudo terminal streams. In response to identifying the device as a pseudo terminal slave device, an entry for the identified pseudo terminal slave device is added to a list of open pseudo terminal slave devices. The entry for the identified pseudo terminal slave device is marked as an open pseudo terminal slave device. The list of open pseudo terminal slave devices permit pseudo terminal master devices and pseudo terminal slave devices to be restored and restarted in random order during a restart of the pseudo terminal streams. | 02-05-2009 |
20090119341 | METHOD AND APPARATUS FOR REMOVING ENCRYPTED FILES UNASSOCIATED WITH A USER KEY FROM AN ARCHIVE - 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. | 05-07-2009 |
20090119783 | METHOD AND APPARATUS FOR MASKING CHILD USER AUTHORIZATIONS FROM ADVERSE USE AGAINST A PARENT USER - The present invention provides a computer implemented method, data processing system, and computer program product to protect a first user from authorization limitation by a second user. The computer may receive an authorization command from the second user, wherein the authorization command targets the first user, and the second user is at least partially authorized to operate the authorization command. The computer determines that the first user is an ancestor user of the second user. In addition, the computer, responsive to a determination that the first user is an ancestor user of the second user, prevents operation of code of the authorization command to change an authorization of the first user. | 05-07-2009 |
20090248474 | MEETING PLANNING ASSISTANCE VIA NETWORK MESSAGES - The present invention provides a computer implemented method and apparatus to invite people by an email system to meetings or events through a scheduling server of a data processing machine. The scheduling server receives a plurality of invitees, where each invitee's vote has weight in the probability of scheduling a meeting at the desired time. The plurality of vote weights is heterogeneous. The scheduling server receives a meeting duration, a meeting option begin-time, and a meeting option end-time. The scheduling server excludes committed time of each invitee between the at least one meeting option begin-time and the at least one meeting option end-time to form a set of meeting times that are divided into a manageable set of meeting options. The scheduling server presents the manageable set of options to each invitee. The scheduling server receives votes from a voting invitee to form collected votes. Each vote is weighted based on the vote weight of the voting invitee. The scheduling server determines a leading option based on the collected votes and commits the leading option as the scheduled time for the meeting. | 10-01-2009 |
20090248812 | COMPOSING, FORWARDING, AND RENDERING EMAIL SYSTEM - The present invention provides a computer implemented method for communicating a signature in a received email. Initially, a server receives a source email from a source client, the source email comprising a signature index entry, and a body. The server determines for a first recipient that a first associated destination client is capable of rendering a signature of the signature index entry in response to a selection of an indexed signature. The server, responsive to a determination that the destination client is capable of rendering the signature index entry, forwards the source email to the first recipient as a delivered email using the body of the source email such that an indexed signature is present in the body of the delivered email. In addition, a method for generating a signature header is shown that provides a many to one correspondence between indexed signatures and a signature index entry. | 10-01-2009 |
20090311997 | DYNAMIC USER-TO-USER ADDRESS BOOK SHARING IN A MOBILE STATION - 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. | 12-17-2009 |
20100082816 | VIRTUALIZE, CHECKPOINT, AND RESTART POSIX IPC OBJECTS DURING CHECKPOINTING AND RESTARTING OF A SOFTWARE PARTITION - A WPAR is migrated. Responsive to starting a checkpoint process, data and control information is collected and stored for IPC objects in the WPAR. Responsive to receiving a request to restart the WPAR, a type of IPC object is determined. Responsive to a determination that the IPC object is not an IPC shared memory object, a kernel handle that a process wants to be used for a new IPC object is registered. A request to create a new IPC object comprising a name uniquely associated with the IPC object and a WPAR identifier is issued. An entry that matches the name and WPAR identifier is identified and a virtual kernel handle is retrieved. The new IPC object is created. The virtual kernel handle is mapped to a real kernel handle and returned to the process. Data and control information is retrieved and overlaid onto the new IPC object. | 04-01-2010 |
20100083283 | VIRTUALIZE, CHECKPOINT, AND RESTART SYSTEM V IPC OBJECTS DURING CHECKPOINTING AND RESTARTING OF A SOFTWARE PARTITION - 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. | 04-01-2010 |
20100095074 | MAPPED OFFSETS PRESET AHEAD OF PROCESS MIGRATION - 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. | 04-15-2010 |
20100095075 | ON-DEMAND PAGING-IN OF PAGES WITH READ-ONLY FILE SYSTEM - 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. The arrival machine receives the page from the departure machine. | 04-15-2010 |
20100161559 | MAINTAINING A NETWORK CONNECTION OF A WORKLOAD DURING TRANSFER - According to one embodiment of the present disclosure, a method and technique is disclosed for maintaining a network connection during transfer of the workload from a global environment of a logical partition to a workload partition of the logical partition and during any subsequent transfer(s). | 06-24-2010 |
20120066372 | SELECTIVE REGISTRATION FOR REMOTE EVENT NOTIFICATIONS IN PROCESSING NODE CLUSTERS - An event notification system 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. | 03-15-2012 |
20120066694 | EVENT OVERFLOW HANDLING BY COALESCING AND UPDATING PREVIOUSLY-QUEUED EVENT NOTIFICATION - An event notification system 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. | 03-15-2012 |
20120117223 | CHANGING AN EVENT IDENTIFIER OF A TRANSIENT EVENT IN AN EVENT NOTIFICATION SYSTEM - An event notification system for distributed processing systems provides for replacement of event identifiers associated with transient objects, such as processes within the processing system. An event management interface receives a notification from an event producer that an identifier of an event produced by the event producer is no longer valid. The event management interface blocks event notification for the event and dissociates an event registration entry associated with the event from the event identifier. A new event identifier is received from the event producer by the event management interface, which associates the registration entry with the new event identifier. Event notification for the event is then resumed. | 05-10-2012 |
20120140675 | Endpoint-to-Endpoint Communications Status Monitoring - 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. | 06-07-2012 |
20120143829 | NOTIFICATION OF CONFIGURATION UPDATES IN A CLUSTER SYSTEM - A second node receives a message from a first node in a cluster environment. The message includes a unique identifier of a shared data storage device including a cluster configuration database that defines membership of nodes in a cluster. In response to receiving the message, the second node attempts to find the shared data storage device. In response to finding the shared data storage device, the second node locates and reads the cluster configuration database on the shared data storage device. The second node then assimilates a cluster configuration update indicated by the cluster configuration database. | 06-07-2012 |
20120143836 | VALIDATION OF ACCESS TO A SHARED DATA RECORD SUBJECT TO READ AND WRITE ACCESS BY MULTIPLE REQUESTERS - 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. | 06-07-2012 |
20120143887 | SELF-ASSIGNMENT OF NODE IDENTIFIER IN A CLUSTER SYSTEM - In response to a stimulus indicating configuration of a node into a cluster of a plurality of nodes including the node, the node determines whether or not the node has a universally unique identifier (UUID), and if not, the node provides its own persistent self-assigned UUID. The node searches a cluster configuration database for a temporary identifier associated with the node. In response to the node locating the temporary identifier of the node in the cluster configuration database, the node writes its self-assigned UUID into the cluster configuration database and joins the cluster. | 06-07-2012 |
20120143892 | PROPAGATION OF UNIQUE DEVICE NAMES IN A CLUSTER SYSTEM - A unique device name is assigned to each of a plurality of shared storage devices in a cluster configuration database defining membership of nodes in a cluster. A particular node among the nodes defined by the cluster configuration database as a member of the cluster searches the cluster configuration database for a device identifier matching a device identifier of a shared storage device hosted by the particular node. In response to finding a matching device identifier in the cluster configuration database, the particular node renames, in a local configuration maintained at the particular node, a storage device associated with the matching device identifier with the unique name assigned to that storage device in the cluster configuration database. | 06-07-2012 |
20120143957 | Inter-Node Communication Scheme for Node Status Sharing - 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. | 06-07-2012 |
20120151267 | SYSTEM FOR EXTENDING USE OF A DATA ADDRESS BREAK POINT REGISTER TO IMPLEMENT MULTIPLE WATCH POINTS - 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. | 06-14-2012 |
20120198477 | EVENT OVERFLOW HANDLING BY COALESCING AND UPDATING PREVIOUSLY-QUEUED EVENT NOTIFICATION - 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. | 08-02-2012 |
20120198478 | SELECTIVE REGISTRATION FOR REMOTE EVENT NOTIFICATIONS IN PROCESSING NODE CLUSTERS - 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. | 08-02-2012 |
20120203897 | ENDPOINT-TO-ENDPOINT COMMUNICATIONS STATUS MONITORING - 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. | 08-09-2012 |
20120203899 | INTER-NODE COMMUNICATION SCHEME FOR NODE STATUS SHARING - 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. | 08-09-2012 |
20120209821 | VALIDATION OF ACCESS TO A SHARED DATA RECORD SUBJECT TO READ AND WRITE ACCESS BY MULTIPLE REQUESTERS - 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. | 08-16-2012 |
20120250697 | INTER-CLUSTER COMMUNICATIONS TECHNIQUE FOR EVENT AND HEALTH STATUS COMMUNICATIONS - 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. | 10-04-2012 |
20120254391 | INTER-CLUSTER COMMUNICATIONS TECHNIQUE FOR EVENT AND HEALTH STATUS COMMUNICATIONS - 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. | 10-04-2012 |
20130007409 | ON-DEMAND PAGING-IN OF PAGES WITH READ-ONLY FILE SYSTEM - 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. | 01-03-2013 |
20140310410 | INTER-NODE COMMUNICATION SCHEME FOR NODE STATUS SHARING - 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. | 10-16-2014 |