Abstract: A system can include at least one computing module comprising a physical interface for connection to a memory bus, a processing section configured to decode at least a predetermined range of physical address signals received over the memory bus into computing instructions for the computing module, and at least one computing element configured to execute the computing instructions.

Abstract: A lightweight messaging method and apparatus that includes creating a temporary receive data area, and if a receive operation is seen first, then creating an operational receive data area, and waiting for a corresponding send operation to fill the operational receive data area with sent data; and if the send operation is seen first, then filling the temporary receive data area with sent data, when the corresponding receive operation is seen, creating the operational receive data area, and moving the sent data from the temporary receive data area to the operational receive data area.

Abstract: A system and method for sharing data within a distributed computing system having a plurality of nodes, wherein each node includes a processor and memory. An application is distributed across two or more nodes, including a first node, wherein distributing the application includes creating application processes, associating the application processes with a group and distributing the application processes to the first and second nodes. A data object is established in memory on the first node, wherein defining a data object includes allocating memory for the data object. A name is assigned to the data object and the name is mapped to a data object handle. Data within the data object is accessed through references to the data object handle.

Abstract: Disclosed are various ways of performing reliable multicast communication which may include, for example, designating which node or nodes to acknowledge a message and/or whether to immediately acknowledge or delay acknowledgement of a message, which may be of particular use with routers, packet switching systems, computer systems, and other devices. Multiple nodes are typically sent a multicast message, which includes an indication of one or more designated nodes to acknowledge the message, a sequence number or other message identification value, and possibly an indication whether an immediate or delayed acknowledgment is requested. A node receiving the message responds accordingly if it is designated to acknowledge the message, which may include requesting any missing messages, and/or sending an acknowledgment message for the messages it has received since it sent its last acknowledgment message.

Abstract: Disclosed are various ways of performing reliable multicast communication which may include, for example, designating which node or nodes to acknowledge a message and/or whether to immediately acknowledge or delay acknowledgement of a message, which may be of particular use with routers, packet switching systems, computer systems, and other devices. Multiple nodes are typically sent a multicast message, which includes an indication of one or more designated nodes to acknowledge the message, a sequence number or other message identification value, and possibly an indication whether an immediate or delayed acknowledgment is requested. A node receiving the message responds accordingly if it is designated to acknowledge the message, which may include requesting any missing messages, and/or sending an acknowledgment message for the messages it has received since it sent its last acknowledgment message.

Abstract: Portions of code containing critical code routines are identified and labeled, then compiled into Dynamic Link Libraries (“DLLs”) and linked such that the critical code routines are optimally loaded into a reserved address space in the DLL memory space. If supported, cache locking may be enabled for the reserved address space. The portions of source code containing portions of critical code for which execution performance is to be improved are labeled, and the source code is scanned prior to compilation to locate the labeled portions of critical code. A linker is configured to store all the labeled portions of critical code into an Executable and Linking Format (“ELF”) section header, which is relocated at run-time into a memory space reserved for the portions of critical code.