Patents by Inventor Rajeev Sivaram
Rajeev Sivaram has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8605578Abstract: Systems and methods are provided for managing congestion at a destination host in a network. A transport layer system manages receive buffer for application processes running on the destination host. Upon receiving the first packet of a new message from a source host, the system determines if there is enough free space in the receive buffer at the destination host to be reserved for the entire message. The system allocates receive buffer for the entire message if there is enough free receive buffer space. If there is not enough free buffer space, the system drops the message and sends a negative acknowledgment to the source host. The source host pauses transmission to the destination host upon receiving the negative acknowledgment. The system sends a resume message to the source host when there is enough free buffer. The source host retransmits the dropped message upon receiving the resume message.Type: GrantFiled: May 25, 2011Date of Patent: December 10, 2013Assignee: Google Inc.Inventors: Rama K. Govindaraju, Peter Hochschild, Rajeev Sivaram, Sridhar Raman
-
Patent number: 8116210Abstract: Epoch numbers are maintained in a pair wise fashion at a plurality of communication endpoints to provide communication consistency and recovery from a range of failure conditions including total or partial node failure and subsequent recovery. Once an epoch state inconsistency is recognized, negotiation procedures provide an effective mechanism to reestablish valid communication links without the need to employ global variables which inherently possess greater transmission and overhead requirements needed to maintain communications. Renegotiation of recognizably valid epoch numbers occurs on a pair wise basis.Type: GrantFiled: May 23, 2008Date of Patent: February 14, 2012Assignee: International Business Machines CorporationInventors: Robert S. Blackmore, Amy X. Chen, Scott D. Epter, Chulho Kim, Rajeev Sivaram
-
Patent number: 8091092Abstract: Globally consistent information is locally provided to communications layers. Globally consistent information is stored in a Network Availability Matrix, which is locally accessible by a communications layer. If an event is detected, the communications layer is automatically notified by the Network Availability Matrix, and is able to use the information in the Network Availability Matrix to quickly take action.Type: GrantFiled: August 30, 2007Date of Patent: January 3, 2012Assignee: International Business Machines CorporationInventors: Myung M. Bae, Paul D. DiNicola, Chulho Kim, Rajeev Sivaram
-
Patent number: 8056087Abstract: A barrier synchronization register, accessible to the nodes in a distributed data processing system, has portions thereof allotted to threads which are present in multiple groups. The barrier synchronization register portion allotted to a given thread has stored therein, over time, group identifier numbers. In this way the state space of a barrier synchronization register is shared over more than one group of process threads.Type: GrantFiled: September 25, 2006Date of Patent: November 8, 2011Assignee: International Business Machines CorporationInventors: Piyush Chaudhary, Rama K. Govindaraju, Chulho Kim, Rajeev Sivaram, Hanhong Xue
-
Patent number: 7996851Abstract: Globally consistent information is locally provided to communications layers. Globally consistent information is stored in a Network Availability Matrix, which is locally accessible by a communications layer. If an event is detected, the communications layer is automatically notified by the Network Availability Matrix, and is able to use the information in the Network Availability Matrix to quickly take action.Type: GrantFiled: November 20, 2007Date of Patent: August 9, 2011Assignee: International Business Machines CorporationInventors: Myung M. Bae, Paul D. DiNicola, Chulho Kim, Rajeev Sivaram
-
Publication number: 20110078410Abstract: Disclosed are a method of and system for multiple party communications in a processing system including multiple processing subsystems. Each of the processing subsystems includes a central processing unit and one or more network adapters for connecting said each processing subsystem to the other processing subsystems. A multitude of nodes are established or created, and each of these nodes is associated with one of the processing subsystems. A first aspect of the invention involves pipelined communication using RDMA among three nodes, where the first node breaks up a large communication into multiple parts and sends these parts one after the other to the second node using RDMA, and the second node in turn absorbs and forwards each of these parts to a third node before all parts of the communication arrive from the first node.Type: ApplicationFiled: July 17, 2006Publication date: March 31, 2011Applicant: International Business Machines CorporationInventors: Robert S. Blackmore, Rama K. Govindaraju, Peter H. Hochschild, Chulho Kim, Rajeev Sivaram, Richard R. Treumann, Hanhong Xue
-
Patent number: 7835359Abstract: A method, an apparatus and a recording medium are provided for communicating message payload data, especially noncontiguous message data, from a first node of a network to a second node of the network in response to a request to transmit a message. Such method includes dividing the length of a data payload to be transmitted into a plurality of submessage payload lengths, i.e., into at least a first submessage payload length and a second submessage payload length. Then, a first ordered submessage is transmitted from the first node for delivery to the second node, the first ordered submessage having the first submessage payload length. A first state of an environment is then determined in the first node as if the step of transmitting the first ordered submessage were already completed.Type: GrantFiled: December 8, 2005Date of Patent: November 16, 2010Assignee: International Business Machines CorporationInventors: Chulho Kim, Rajeev Sivaram, Richard R. Treumann
-
Patent number: 7774554Abstract: A system and method to provide injection of important data directly into a processor's cache location when that processor has previously indicated interest in the data. The memory subsystem at a target processor will determine if the memory address of data to be written to a memory location associated with the target processor is found in a processor cache of the target processor. If it is determined that the memory address is found in a target processor's cache, the data will be directly written to that cache at the same time that the data is being provided to a location in main memory.Type: GrantFiled: February 20, 2007Date of Patent: August 10, 2010Assignee: International Business Machines CorporationInventors: Piyush Chaudhary, Rama K. Govindaraju, Jay Robert Herring, Peter Hochschild, Chulho Kim, Rajeev Sivaram, Hanhong Xue
-
Patent number: 7536468Abstract: A protocol interface is provided for an active message protocol of a computing environment and a client process employing the active message protocol. The protocol interface includes an interface to a header handler function associated with the client process. The interface to the header handler function has parameters to be passed by and a parameter to be returned to the active message protocol when processing a message received through the active message protocol. The parameters to be passed include current message state information and current message type information for the received message. These parameters facilitate message-specific decisions by the header handler function about processing data of the message by the active message protocol. The parameter to be returned to the active message protocol instructs the active message protocol how to process the received message other than just where to store the message.Type: GrantFiled: June 24, 2004Date of Patent: May 19, 2009Assignee: International Business Machines CorporationInventors: Robert S. Blackmore, Xin Chen, Scott D. Epter, Chulho Kim, Rajeev Sivaram, Hanhong Xue
-
Patent number: 7454491Abstract: A method and system for transferring noncontiguous messages group including assembling a set of data into a series of transmission packets, packaging a description of the layout of the transmission packets into description packets and then places each description packet into a local buffer while maintaining a count of the number of description packets, transfers each description packet into a transmit buffer for transmission to at least one receiving node, identifies the data packets, and forwards each data packet to the transmit buffer for transmission to the at least one receiving node. The receiving node receives the transmission packets, identifies each packet as a description packet or data packet, places the description packets in a local buffer for storage until the description is complete, places each description packet into a user data buffer, stores data packets in a local queue until the description is complete, then transfers the data packets to the user buffer.Type: GrantFiled: October 14, 2004Date of Patent: November 18, 2008Assignee: International Business Machines CorporationInventors: Robert S. Blackmore, Xin Amy Chen, Chulho Kim, Rajeev Sivaram, Richard R. Treumann, Hanhong Xue
-
Publication number: 20080225702Abstract: Epoch numbers are maintained in a pair wise fashion at a plurality of communication endpoints to provide communication consistency and recovery from a range of failure conditions including total or partial node failure and subsequent recovery. Once an epoch state inconsistency is recognized, negotiation procedures provide an effective mechanism to reestablish valid communication links without the need to employ global variables which inherently possess greater transmission and overhead requirements needed to maintain communications. Renegotiation of recognizably valid epoch numbers occurs on a pair wise basis.Type: ApplicationFiled: May 23, 2008Publication date: September 18, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert S. Blackmore, Amy X. Chen, Scott D. Epter, Chulho Kim, Rajeev Sivaram
-
Publication number: 20080201532Abstract: A system and method to provide injection of important data directly into a processor's cache location when that processor has previously indicated interest in the data. The memory subsystem at a target processor will determine if the memory address of data to be written to a memory location associated with the target processor is found in a processor cache of the target processor. If it is determined that the memory address is found in a target processor's cache, the data will be directly written to that cache at the same time that the data is being provided to a location in main memory.Type: ApplicationFiled: February 20, 2007Publication date: August 21, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Piyush Chaudhary, Rama K. Govindaraju, Jay Robert Herring, Peter Hochschild, Chulho Kim, Rajeev Sivaram, Hanhong Xue
-
Patent number: 7379444Abstract: Epoch numbers are maintained in a pair wise fashion at a plurality of communication endpoints to provide communication consistency and recovery from a range of failure conditions including total or partial node failure and subsequent recovery. Once an epoch state inconsistency is recognized, negotiation procedures provide an effective mechanism to reestablish valid communication links without the need to employ global variables which inherently possess greater transmission and overhead requirements needed to maintain communications. Renegotiation of recognizably valid epoch numbers occurs on a pair wise basis.Type: GrantFiled: January 27, 2003Date of Patent: May 27, 2008Assignee: International Business Machines CorporationInventors: Robert S. Blackmore, Amy X. Chen, Scott D. Epter, Chulho Kim, Rajeev Sivaram
-
Publication number: 20080086737Abstract: Globally consistent information is locally provided to communications layers. Globally consistent information is stored in a Network Availability Matrix, which is locally accessible by a communications layer. If an event is detected, the communications layer is automatically notified by the Network Availability Matrix, and is able to use the information in the Network Availability Matrix to quickly take action.Type: ApplicationFiled: November 20, 2007Publication date: April 10, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Myung Bae, Paul DiNicola, Chulho Kim, Rajeev Sivaram
-
Publication number: 20080077921Abstract: A barrier synchronization register, accessible to the nodes in a distributed data processing system, has portions thereof allotted to threads which are present in multiple groups. The barrier synchronization register portion allotted to a given thread has stored therein, over time, group identifier numbers. In this way the state space of a barrier synchronization register is shared over more than one group of process threads.Type: ApplicationFiled: September 25, 2006Publication date: March 27, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Piyush Chaudhary, Rama K. Govindaraju, Chulho Kim, Rajeev Sivaram, Hanhong Xue
-
Publication number: 20070294709Abstract: Globally consistent information is locally provided to communications layers. Globally consistent information is stored in a Network Availability Matrix, which is locally accessible by a communications layer. If an event is detected, the communications layer is automatically notified by the Network Availability Matrix, and is able to use the information in the Network Availability Matrix to quickly take action.Type: ApplicationFiled: August 30, 2007Publication date: December 20, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Myung Bae, Paul DiNicola, Chulho Kim, Rajeev Sivaram
-
Patent number: 7302692Abstract: Globally consistent information is locally provided to communications layers. Globally consistent information is stored in a Network Availability Matrix, which is locally accessible by a communications layer. If an event is detected, the communications layer is automatically notified by the Network Availability Matrix, and is able to use the information in the Network Availability Matrix to quickly take action.Type: GrantFiled: May 31, 2002Date of Patent: November 27, 2007Assignee: International Business Machines CorporationInventors: Myung Bae, Paul D. DiNicola, Chulho Kim, Rajeev Sivaram
-
Publication number: 20070150904Abstract: Processing within a multi-threaded processing environment is facilitated. A plurality of threads are employed to perform polling on a plurality of entities. The polling enables the concurrent driving of progress on the plurality of entities, as well as the detection of occurrence of a specified event across the plurality of entities and the termination of continued polling at the occurrence of this event.Type: ApplicationFiled: November 15, 2005Publication date: June 28, 2007Applicant: International Business Machines CorporationInventors: Chulho Kim, Rajeev Sivaram
-
Publication number: 20070133536Abstract: A method, an apparatus and a recording medium are provided for communicating message payload data, especially noncontiguous message data, from a first node of a network to a second node of the network in response to a request to transmit a message. Such method includes dividing the length of a data payload to be transmitted into a plurality of submessage payload lengths, i.e., into at least a first submessage payload length and a second submessage payload length. Then, a first ordered submessage is transmitted from the first node for delivery to the second node, the first ordered submessage having the first submessage payload length. A first state of an environment is then determined in the first node as if the step of transmitting the first ordered submessage were already completed.Type: ApplicationFiled: December 8, 2005Publication date: June 14, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Chulho Kim, Rajeev Sivaram, Richard Treumann
-
Patent number: 7219198Abstract: Lock-free queues of a shared memory environment are used to facilitate communication within that environment. The lock-free queues can be used for interprocess communication, as well as intraprocess communication. The lock-free queues are structured to minimize the use of atomic operations when performing operations on the queues, and to minimize the number of enqueue/dequeue operations to be performed on the queues.Type: GrantFiled: June 22, 2004Date of Patent: May 15, 2007Assignee: International Business Machines CorporationInventors: Rajeev Sivaram, Hanhong Xue