Patent application number | Description | Published |
20090248809 | Instant Message Session Transfers - A method facilitates instant message (IM) session transfer of messages intended for an IM user to a new IM session being established by the user. Existing IM sessions may be queried for active IM sessions when the user is connecting to an instant message service. If there is an active session for the user, the IM server will request the content and sender of active messages waiting for the user, and transfer this information to the new IM session being established for the user. In this way, the user does not “miss” IM message(s) intended for him or her while going between existing, active IM sessions and new IM sessions. As used herein, session or sessions refer to IM session or IM sessions. | 10-01-2009 |
20100183009 | DISCRIMINATORY MTU FRAGMENTATION IN A LOGICAL PARTITION - Communication between nodes on distinct physical computer systems typically involves fragmentation of packets, such that packet size complies with a communication protocol's specified maximum transmission unit (MTU). However, communications between logical partitions on the same computer system (“virtual nodes”) do not have to comply with a MTU. A computer system can handle packet sizes for intra-system communications between virtual nodes larger than the MTU. Functionality can be implemented to determine that a packet's source and destination are virtual nodes on the same physical machine. This can enable the system to virtually transfer packets for intra-system communication without fragmentation. | 07-22-2010 |
20110066851 | Secure Route Discovery Node and Policing Mechanism - A computer implemented method and computer program product for obtaining a secure route. A trusted host sets a node security association for a trusted host. The trusted host receives, at the trusted host, a client communication request directed to a destination host. The trusted host builds a secure route query comprising a trusted host address, a destination host address, and at least one security level, to form at least one secure route. The trusted host sends packets from the trusted host to the destination host based on the at least one secure route. The packets are responsive to the client communication request, and the packets each have a security label that matches the security level. | 03-17-2011 |
20110099253 | CONSOLIDATED NOTIFICATIONS TO NFS CLIENTS - A computer implemented method and apparatus for rebooting a host having a plurality of network interfaces. A server reboots the host by stopping an NFS server process on the host. The server sends at least one consolidated notification to a plurality of clients identified in a consolidated notification table, wherein the consolidated notification comprises at least two addresses of network interfaces of the host. The server determines that an acknowledgement is received from each of the plurality of clients. The server halts resending of consolidated notifications, responsive to determining that an acknowledgement is received from the each of the plurality of clients. | 04-28-2011 |
20110113134 | Server Access Processing System - A method, programmed medium and system are provided for preventing the denial of file system access to a plurality of clients accessing a NFS server. In one example, an NFS server is configured to listen on a server port. The server runs a separate daemon which “watches” client requests as they are received at the NFS server. The server processing system tracks the number of times a client sends consecutive TCP zero-window packets in response to a data packet from the server. If the number of zero-window packets crosses a user-defined threshold, then a routine is called to stop responding to that client using a backoff algorithm. When the server reaches a point where the number of available threads or any other relevant resource dips below a user-defined threshold, the server process starts terminating connections to the clients starting from the ones with the oldest entry in the table. | 05-12-2011 |
20110138404 | REMOTE PROCEDURE CALL (RPC) BIND SERVICE WITH PHYSICAL INTERFACE QUERY AND SELECTION - A service module that provides for discovery of one or more network interfaces connecting a prospective remote procedure call (RPC) client, facilitates the provision of RPC programs in a network including multi-horned systems. When a request for a network address to an RPC application providing an RPC program is received from the RPC client, the RPC bind daemon discovers from the module, using the client response address, over which interface(s) the client is accessible. The daemon then selects an address of a network path to the RPC application that the prospective client can access and returns the corresponding network address. The service module monitors the network stack for RPC get address requests and builds tables of client address entries with corresponding network interface identifiers. The entries are retired according to an aging policy. When multiple network paths to the RPC application are available, the service can be selected using a heuristic such as preferred interface, non-firewalled interface, least number of return path links or other criteria. | 06-09-2011 |
20110153825 | SERVER RESOURCE ALLOCATION - A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients. | 06-23-2011 |
20110154095 | Management of Space in Shared Libraries - Any computer process has the opportunity of attempting to load a data object into a global shared library area and, in the event that there is insufficient space in this global area resulting in a failure to load, there is then an automatic location or creation of a named shared library area for the data object that is transparent and does not need and user action. | 06-23-2011 |
20120124582 | Calculating Processor Load - A method, computer system, and computer program product for identifying a transient thread. A thread of a process is placed in a run queue associated with a processor. Data is added to the thread indicating a time that the thread was placed into the run queue. | 05-17-2012 |
20120137218 | Method to Automatically Display Filenames Encoded in Multiple Code Sets - A computer implemented method, computer program product, and computer system for viewing content encoded in at least one code set and stored in a file system. A computer identifies a unified code set covering all characters used in the file system. The computer, responsive to a user input to view the content, determines whether the content is wholly encoded in the unified code set. The computer, responsive to determining that the code set is not wholly encoded in the unified code set, converts encoding of the content to the unified code set to form converted content. The computer displays the converted content. | 05-31-2012 |
20120215916 | Server Access Processing System - A method, programmed medium and system are provided for preventing the denial of file system access to a plurality of clients accessing a NFS server. In one example, an NFS server is configured to listen on a server port. The server runs a separate daemon which “watches” client requests as they are received at the NFS server. The server processing system tracks the number of times a client sends consecutive TCP zero-window packets in response to a data packet from the server. If the number of zero-window packets crosses a user-defined threshold, then a routine is called to stop responding to that client using a backoff algorithm. When the server reaches a point where the number of available threads or any other relevant resource dips below a user-defined threshold, the server process starts terminating connections to the clients starting from the ones with the oldest entry in the table. | 08-23-2012 |
20120215922 | Server Resource Allocation - A method, programmed medium and system are disclosed which provide for end-to-end QoS for a set of processes that comprise a workload over nfs. A set of processes that comprise a workload such as the processes of a WPAR, or an entire LPAR are given a class designation and assigned priority/limits. The data are then passed to the server which allocates resources based on the sum total of all the current classes and their priorities and/or limits. This requires re-engineering the nfs client code to be workload-aware and the nfs server code to accommodate the resource allocation and prioritization needs of the nfs clients. | 08-23-2012 |
20120226514 | Calendaring Tool Having Visual Clues to Address Conflicting Meeting Invitations - Methods and systems of distinguishing conflicting appointments from one another may involve determining, for each of a plurality of conflicting appointments, a corresponding visual differentiator based on appointment detail information. The plurality of conflicting appointments and corresponding visual differentiators may be displayed in a calendar view, wherein the appointment detail information is excluded from the calendar view. | 09-06-2012 |
20120272016 | MEMORY AFFINITIZATION IN MULTITHREADED ENVIRONMENTS - A method, system, and computer program product for memory affinitization in a multithreaded environment are provided in the illustrative embodiments. A first affinity domain formed in a computer receives from a second thread executing in a second affinity domain a request to access a unit of memory in the first affinity domain. The computer determines whether to migrate the unit of memory to the second affinity domain. The computer migrates, responsive the determining being affirmative, the unit of memory to the second affinity domain, thereby affinitizing the unit of memory with the second thread. | 10-25-2012 |
20120324483 | REMOTE PROCEDURE CALL (RPC) BIND SERVICE WITH PHYSICAL INTERFACE QUERY AND SELECTION - A service module that provides for discovery of one or more network interfaces connecting a prospective remote procedure call (RPC) client, facilitates the provision of RPC programs in a network including multi-horned systems. When a request for a network address to an RPC application providing an RPC program is received from the RPC client, the RPC bind daemon discovers from the module, using the client response address, over which interface(s) the client is accessible. The daemon then selects an address of a network path to the RPC application that the prospective client can access and returns the corresponding network address. The service module monitors the network stack for RPC get address requests and builds tables of client address entries with corresponding network interface identifiers. The entries are retired according to an aging policy. | 12-20-2012 |
20120331223 | PARALLEL BLOCK ALLOCATION FOR DECLUSTERED LOGICAL DISKS - In a method for allocating space on a logical disk, a computer receives an allocation request to allocate a number of requested logical disk extents. The computer selects one of a first group having an array of logical disk extents and a second group having an array of logical disk extents. The computer selects a group having a number of free logical disk extents that is greater than or equal to the number of requested logical disk extents. The logical disk extents in the array of the first group and in the array of the second group correspond to disk blocks on a logical disk. The logical disk spans one or more physical random access disks. The computer locks the selected group to prevent allocating a logical disk extent other than in response to the allocation request. | 12-27-2012 |
20130151828 | CONSOLIDATED NOTIFICATIONS TO NFS CLIENTS - A computer implemented method, system and apparatus for rebooting a host having a plurality of network interfaces. A server reboots the host by stopping an NFS server process on the host. The server sends at least one consolidated notification to a plurality of clients identified in a consolidated notification table, wherein the consolidated notification comprises at least two addresses of network interfaces of the host. The server determines that an acknowledgement is received from each of the plurality of clients. The server halts resending of consolidated notifications, responsive to determining that an acknowledgement is received from the each of the plurality of clients. | 06-13-2013 |
20130232548 | Secure Route Discovery Node and Policing Mechanism - A computer implemented method and computer program product for obtaining a secure route. A trusted host sets a node security association for a trusted host. The trusted host receives, at the trusted host, a client communication request directed to a destination host. The trusted host builds a secure route query comprising a trusted host address, a destination host address, and at least one security level, to form at least one secure route. The trusted host sends packets from the trusted host to the destination host based on the at least one secure route. The packets are responsive to the client communication request, and the packets each have a security label that matches the security level. | 09-05-2013 |
20130232559 | Secure Route Discovery Node and Policing Mechanism - A computer implemented method for obtaining a secure route. A trusted host sets a node security association for a trusted host. The trusted host receives, at the trusted host, a client communication request directed to a destination host. The trusted host builds a secure route query comprising a trusted host address, a destination host address, and at least one security level, to form at least one secure route. The trusted host sends packets from the trusted host to the destination host based on the at least one secure route. The packets are responsive to the client communication request, and the packets each have a security label that matches the security level. | 09-05-2013 |
20140006854 | Resolution of System Hang due to Filesystem Corruption | 01-02-2014 |
20140052759 | DETERMINING THE VALUE OF AN ASSOCIATION BETWEEN ONTOLOGIES - An approach is presented for determining a value of an association between first and second ontologies, S | 02-20-2014 |
20140165129 | UNIFORMLY TRANSFORMING THE CHARACTERISTICS OF A PRODUCTION ENVIRONMENT - Embodiments of the present invention disclose a method, computer program product, and system for generating a secure sandbox environment. A computer identifies components of a production environment that utilizes sensitive information during operation. The components of the production environment can include one or more server computers, one or more storage devices, and one or more applications. The computer receives a security policy that defines what constitutes sensitive information, and in response identifies the sensitive information of the production environment. The computer modifies the sensitive information such that the production environment can utilize the sensitive information without error, and such that the sensitive information cannot be identified from the modified sensitive information. The computer generates the sandbox environment, based at least in part, on the identified components of the production environment and the modified sensitive information. | 06-12-2014 |
20140165135 | UNIFORMLY TRANSFORMING THE CHARACTERISTICS OF A PRODUCTION ENVIRONMENT - Embodiments of the present invention disclose a method, computer program product, and system for generating a secure sandbox environment. A computer identifies components of a production environment that utilizes sensitive information during operation. The components of the production environment can include one or more server computers, one or more storage devices, and one or more applications. The computer receives a security policy that defines what constitutes sensitive information, and in response identifies the sensitive information of the production environment. The computer modifies the sensitive information such that the production environment can utilize the sensitive information without error, and such that the sensitive information cannot be identified from the modified sensitive information. The computer generates the sandbox environment, based at least in part, on the identified components of the production environment and the modified sensitive information. | 06-12-2014 |
20140222889 | COLLABORATIVE NEGOTIATION OF SYSTEM RESOURCES AMONG VIRTUAL SERVERS RUNNING IN A NETWORK COMPUTING ENVIRONMENT - Virtual machines within a network computing environment negotiate among themselves with regard to the sharing of resources via respective resource managers. The resource agent monitors resource allocation patterns of its virtual machine and responsively updates usage data in a resource availability map and compares the updated usage data to a minimum operational requirements threshold and a surplus amount threshold. If the updated usage fails to meet the minimum operational requirements threshold, the resource agent determines a needed shortfall amount of resources, searches the resource availability map for offers of the shortfall from resource agents, and sends out a request to a resource agent offering the shortfall amount. If the updated usage data meets the minimum operational requirements threshold, the resource agent determines a surplus amount of a resource that exceeds the surplus amount threshold and creates and broadcasts an offer of the surplus amount to the other resource agents. | 08-07-2014 |
20140365728 | PARALLEL BLOCK ALLOCATION FOR DECLUSTERED LOGICAL DISKS - In a method for allocating space on a logical disk, a computer receives an allocation request to allocate a number of requested logical disk extents. The computer selects one of a first group having an array of logical disk extents and a second group having an array of logical disk extents. The computer selects a group having a number of free logical disk extents that is greater than or equal to the number of requested logical disk extents. The logical disk extents in the array of the first group and in the array of the second group correspond to disk blocks on a logical disk. The logical disk spans one or more physical random access disks. The computer locks the selected group to prevent allocating a logical disk extent other than in response to the allocation request. | 12-11-2014 |
20140380303 | STORAGE MANAGEMENT FOR A CLUSTER OF INTEGRATED COMPUTING SYSTEMS - Integrated computing systems with independently managed infrastructures including compute nodes and storage nodes form a cluster. Storage resource agents manage storage resources in the cluster. The resource agents identify storage requirements associated with allocation sets for resource consumers dispatched in the cluster, communicate with each other to locate inter-system storage resources that primarily satisfy locality criteria associated with resource consumer workloads, secondarily satisfy allocation set activity criteria associated with the allocation sets, and allocate the storage resources to the resource consumers to satisfy the storage requirements. The storage resource agents may base storage assignments on data placement information from a priority map. Data may be later relocated to alternate storage resources in satisfaction of cluster-wide storage policies, priority determinations, and data access rate determinations. | 12-25-2014 |