公开(公告)号：US20100082788A1

公开(公告)日：2010-04-01

申请号：US12239966

申请日：2008-09-29

Applicant: Michael Basil Mundy

Inventor： Michael Basil Mundy

IPC: G06F15/173

CPC classification number: G06F9/544 ,  G06F9/52

Abstract: In a massively parallel computer system embodiment, when receiving a message at a compute node from an input/output node, the compute node performs the steps of: obtaining a lock on a collective network device; checking a shared storage location for a message pending for a thread; if such a message is pending, receiving the message's remaining packets directly to a user's buffer, unlocking, and returning; if no such message is pending, receiving one packet from the network device; if the packet indicates that the message is for the thread, receiving the message's remaining packets directly to the user's buffer, unlocking, and returning; and if the packet indicates that the message is for another thread, updating the shared storage location with a thread id of the other thread, unlocking, waiting for a time out, locking, and repeating from the checking step. Accordingly, data copying is eliminated with an attendant performance benefit.

Abstract translation: 在大规模并行的计算机系统实施例中，当从输入/输出节点在计算节点处接收到消息时，计算节点执行以下步骤：获得集体网络设备上的锁定; 检查共享存储位置以查找线程等待的消息; 如果这样的消息正在等待，则将消息的剩余分组直接接收到用户的缓冲器，解锁和返回; 如果没有等待这样的消息，则从网络设备接收一个分组; 如果分组指示消息是针对线程，则将消息的剩余分组直接接收到用户的缓冲器，解锁和返回; 并且如果分组指示该消息是针对另一线程，则用另一线程的线程ID更新共享存储位置，解锁，等待超时，锁定和从检查步骤重复。 因此，消除了数据复制并伴随着性能优势。

公开(公告)号：US20080059676A1

公开(公告)日：2008-03-06

申请号：US11469077

申请日：2006-08-31

Applicant: Charles Jens Archer ,  Michael Alan Blocksome ,  Todd Alan Inglett ,  Derek Lieber ,  Patrick Joseph McCarthy ,  Michael Basil Mundy ,  Jeffrey John Parker ,  Joseph D. Ratterman ,  Brian Edward Smith

Inventor： Charles Jens Archer ,  Michael Alan Blocksome ,  Todd Alan Inglett ,  Derek Lieber ,  Patrick Joseph McCarthy ,  Michael Basil Mundy ,  Jeffrey John Parker ,  Joseph D. Ratterman ,  Brian Edward Smith

IPC: G06F13/24

CPC classification number: G06F13/24

Abstract: Embodiments of the present invention provide techniques for protecting critical sections of code being executed in a lightweight kernel environment suited for use on a compute node of a parallel computing system. These techniques avoid the overhead associated with a full kernel mode implementation of a network layer, while also allowing network interrupts to be processed without corrupting shared memory state. In one embodiment, a fast user-space function sets a flag in memory indicating that interrupts should not progress and also provides a mechanism to defer processing of the interrupt.

Abstract translation: 本发明的实施例提供了用于保护在适于在并行计算系统的计算节点上使用的轻量级内核环境中执行的代码的关键部分的技术。 这些技术避免了与网络层的完整内核模式实现相关的开销，同时还允许处理网络中断而不破坏共享内存状态。 在一个实施例中，快速用户空间功能在存储器中设置指示中断不应进行的标志，并且还提供延迟中断处理的机制。

公开(公告)号：US08166146B2

公开(公告)日：2012-04-24

申请号：US12239966

申请日：2008-09-29

Applicant: Michael Basil Mundy

Inventor： Michael Basil Mundy

IPC: G06F15/173

CPC classification number: G06F9/544 ,  G06F9/52

Abstract: In a massively parallel computer system embodiment, when receiving a message at a compute node from an input/output node, the compute node performs the steps of: obtaining a lock on a collective network device; checking a shared storage location for a message pending for a thread; if such a message is pending, receiving the message's remaining packets directly to a user's buffer, unlocking, and returning; if no such message is pending, receiving one packet from the network device; if the packet indicates that the message is for the thread, receiving the message's remaining packets directly to the user's buffer, unlocking, and returning; and if the packet indicates that the message is for another thread, updating the shared storage location with a thread id of the other thread, unlocking, waiting for a time out, locking, and repeating from the checking step. Accordingly, data copying is eliminated with an attendant performance benefit.

Abstract translation: 在大规模并行的计算机系统实施例中，当从输入/输出节点在计算节点处接收到消息时，计算节点执行以下步骤：获得集体网络设备上的锁定; 检查共享存储位置以查找线程等待的消息; 如果这样的消息正在等待，则将消息的剩余分组直接接收到用户的缓冲器，解锁和返回; 如果没有等待这样的消息，则从网络设备接收一个分组; 如果分组指示消息是针对线程，则将消息的剩余分组直接接收到用户的缓冲器，解锁和返回; 并且如果分组指示该消息是针对另一线程，则用另一线程的线程ID更新共享存储位置，解锁，等待超时，锁定和从检查步骤重复。 因此，消除了数据复制并伴随着性能优势。

公开(公告)号：US20080059677A1

公开(公告)日：2008-03-06

申请号：US11469034

申请日：2006-08-31

Applicant: Charles Jens Archer ,  Michael Alan Blocksome ,  Todd Alan Inglett ,  Derek Lieber ,  Patrick Joseph McCarthy ,  Michael Basil Mundy ,  Jeffrey John Parker ,  Joseph D. Ratterman ,  Brian Edward Smith

Inventor： Charles Jens Archer ,  Michael Alan Blocksome ,  Todd Alan Inglett ,  Derek Lieber ,  Patrick Joseph McCarthy ,  Michael Basil Mundy ,  Jeffrey John Parker ,  Joseph D. Ratterman ,  Brian Edward Smith

IPC: G06F13/24

CPC classification number: G06F9/4812 ,  G06F9/542 ,  G06F2209/543

Abstract: Embodiments of the present invention provide techniques for protecting critical sections of code being executed in a lightweight kernel environment suited for use on a compute node of a parallel computing system. These techniques avoid the overhead associated with a full kernel mode implementation of a network layer, while also allowing network interrupts to be processed without corrupting shared memory state. In one embodiment, a system call may be used to disable interrupts upon entry to a routine configured to process an event associated with the interrupt.

Abstract translation: 本发明的实施例提供了用于保护在适于在并行计算系统的计算节点上使用的轻量级内核环境中执行的代码的关键部分的技术。 这些技术避免了与网络层的完整内核模式实现相关的开销，同时还允许处理网络中断而不破坏共享内存状态。 在一个实施例中，系统调用可以用于在进入被配置为处理与中断相关联的事件的例程时禁止中断。