Virtual Heterogeneous Channel For Message Passing

• US 20110185100A1
• Filed: 04/08/2011
• Published: 07/28/2011
• Est. Priority Date: 09/27/2006
• Status: Active Grant

• Current Assignee: Alexander V. Supalov, Alexey V. Ryzhykh, Vladimir D. Truschin
• Original Assignee: Alexander V. Supalov, Alexey V. Ryzhykh, Vladimir D. Truschin
• Inventors: Supalov, Alexander V., Truschin, Vladimir D., Ryzhykh, Alexey V.
• Granted Patent: US 8,281,060 B2
• Time in Patent Office: Days
• US Class Current: 710/305
• CPC Class Codes: G06F 9/544 Buffers; Shared memory; Pipes

Abstract

A technique includes using a virtual channel between a first process and a second process to communicate messages between the processes. Each message contains protocol data and user data. All of the protocol data is communicated over a first channel associated with the virtual channel, and the user data is selectively communicated over at least one other channel associated with the virtual channel.

Claims

1. An article comprising a machine-accessible storage medium including instructions that when executed cause a system to:

prepare a message to be sent from a first process to a second process via a remote direct memory access (RDMA) write operation, the message including user data and immediate data to indicate a type of the user data; and

send the message from the first process to the second process using the RDMA write operation.

2. The article of claim 1, further comprising instructions that enable the system to determine the type of user data and to copy eager data into an internal buffer if the type of user data is eager data.

3. The article of claim 1, wherein the second process is in a wait mode when the message is sent.

4. The article of claim 3, further comprising instructions that enable the system to, during initialization, create an event dispatcher of the second process to handle completion of a received RDMA write operation when the second process is in the wait mode.

5. The article of claim 4, wherein the immediate data of the message is sent within an event structure for the event dispatcher of the second process.

6. The article of claim 5, further comprising instructions that enable the system to determine that transfer of the message has been completed using the event dispatcher of the second process.

7. The article of claim 1, further comprising instructions that enable the system to determine the type of user data and handle the user data based on the type of data.

8. The article of claim 7, further comprising instructions that enable the system to copy the user data from an internal buffer to a user buffer if the type of data is eager data.

9. A system comprising:

a first processor to send a message from a first process executing on the first processor to a second process executing on a second processor, wherein the first process is to send the message while the second process is in a wait state;

the second processor to receive the message from the first process while the second process is in the wait state, wherein the first process is to send a wake up message to the second process based on a state of a synchronization block for the second process if the second process is in the wait state when the message is sent; and

a dynamic random access memory (DRAM) coupled to the first and second processors.

10. The system of claim 9, wherein the DRAM includes instructions to create a shared memory segment to store a synchronization block for the first process and store the synchronization block for the second process, wherein each synchronization block includes a wait flag to indicate that the associated process is in the wait state and a wake up counter to indicate a number of messages sent by the associated process to another process that have not been received.

11. The system of claim 10, wherein the first process is to check the wait flag of the corresponding synchronization block for the second process and send the wake up message if the wait flag indicates that the second process is in the wait state and the wake up counter is equal to zero.

12. The system of claim 11, wherein the first process is to send the message via a shared memory buffer and to send the wake up message via a secondary connection.

13. The system of claim 11, wherein the first process is to lock the synchronization block for the second process before accessing the synchronization block and to unlock the synchronization block after accessing the synchronization block.

14. The system of claim 9, wherein the first process is to first send the message and to thereafter determine if the second process is in the wait state.

15. The system of claim 9, wherein the second process is to unlock the synchronization block for the second process before entering the wait state.

16. A method comprising:

creating a shared memory segment to store a synchronization block for each of a plurality of processes that execute in a message passing interface (MPI) library, wherein each synchronization block includes a wait flag to indicate that the associated process is in a wait state, a first counter to indicate a number of messages sent by the associated process to another process that have not been received, and a pointer to a mutex for synchronization of processes during access to the synchronization block;

transferring a message from a first process to a shared memory buffer of a second process via a shared memory connection; and

sending a wake up message from the first process to the second process via a secondary connection if the second process is in the wait state.

17. The method of claim 16, further comprising moving the message from the shared memory buffer to a user buffer of the second process.

18. The method of claim 17, further comprising sending a wake up message from the second process to the first process if the first process is in the wait state when the second process moves the message.

19. The method of claim 18, further comprising de-allocating the shared memory buffer via the first process after the first process is activated from the wait state.