Search NASA⌕ Search

Engineering topics

Schonbein, William Whitney

Publications and source records attributed to Schonbein, William Whitney.

At least 19 records

“Smarter” NICs for faster algorithms [Slides]

The basic building block of a distributed-memory cluster or supercomputer is a node. Each node includes a host, which is a processor (xPU) + memory hierarchy. The host can communicate with other hosts via its NIC (network interface controller). A network connects the nodes. The nodes may be arranged in some topology, which determines the network’s carrying capacity and cost.

97 MATHEMATICS AND COMPUTING↗

In-network compute assistance

A method and apparatus for performing operations by network interface cards in a network of computers. A network interface card is configured to receive a message and to interpret the message to identify a primitive operation to be performed. The primitive operation is one of a plurality of primitive operations that are performed to perform an operation. The primitive operation is performed by the network interface card and a trigger signal is generated in response to performing the primitive operation. The trigger signal is interpreted to identify a triggered message. The triggered message identifies a next one of the plurality of primitive operations to be performed. The triggered message is transmitted back to the network interface card or to another network interface card in the network for processing.

Grant, Ryan↗

Tail queues: A multi-threaded matching architecture

As we approach exascale, computational parallelism will have to drastically increase in order to meet throughput targets. Many–core architectures have exacerbated this problem by trading reduced clock speeds, core complexity, and computation throughput for increasing parallelism. This presents two major challenges for communication libraries such as MPI: the library must leverage the performance advantages of thread level parallelism and avoid the scalability problems associated with increasing the number of processes to that scale. Hybrid programming models, such as MPI+X, have been proposed to address these challenges. MPI THREAD MULTIPLE is MPI's thread safe mode. While there has been work to optimize it, it largely remains non–performant in most implementations. While current applications avoid MPI multithreading due to performance concerns, it is expected to be utilized in future applications. One of the major synchronous data structures required by MPI is the matching engine. In this paper, we present a parallel matching algorithm that can improve MPI matching for multithreaded applications. We then perform a feasibility study to demonstrate the performance benefit of the technique.

97 MATHEMATICS AND COMPUTING↗