D.E. Shaw Research, LLC Patent applications |
Patent application number | Title | Published |
20130091341 | PARALLEL COMPUTER ARCHITECTURE FOR COMPUTATION OF PARTICLE INTERACTIONS - A computation system for computing interactions in a multiple-body simulation includes an array of processing modules arranged into one or more serially interconnected processing groups of the processing modules. Each of the processing modules includes storage for data elements and includes circuitry for performing pairwise computations between data elements each associated with a spatial location. Each of the pairwise computations makes use of a data element from the storage of the processing module and a data element passing through the serially interconnected processing modules. Each of the processing modules includes circuitry for selecting the pairs of data elements according to separations between spatial locations associated with the data elements. | 04-11-2013 |
20120116737 | ZONAL METHODS FOR COMPUTATION OF PARTICLE INTERACTIONS - A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume. | 05-10-2012 |
20100280806 | COMPUTATION OF MULTIPLE BODY INTERACTIONS - Distributed computation of multiple body interactions in a region uses multiple processing modules, where each of the processing modules is associated with a respective corresponding portion of the region. In some examples, the approach includes establishing multiple coordinate frames of reference, each processing module corresponding to one the coordinate frames of reference. In some examples, efficient techniques are used for selecting elements for computation of interactions according at least in part to a separation-based criterion. | 11-04-2010 |
20100195835 | LINK AND PHYSICAL CODING SUB-LAYER PROTOCOLS - An approach to data communication makes use of a protocol for encoding data on a serial link that provides both a run length limiting function and a frame marking function, while minimizing communication overhead over the data bearing portions of the signal, and while limiting latency introduced into the communication. In some examples, a single bit is added as a frame marker in such a way that a single bit frame marker also limits run length. | 08-05-2010 |
20100125718 | PARALLEL ANALYSIS OF TIME SERIES DATA - In one aspect, a method of processing time-ordered multi-element data uses a set of computational nodes. In some examples, hundreds or thousands of nodes are used. A set of portions of the data are accepted, for example, from a MD simulation system. Each portion of the data is associated with a corresponding computational node in the plurality of computational nodes, and each portion representing a distinct range of time. Instructions for processing the data are accepted. These instructions include one or more instruction specifying a set of times, a set of elements, an analysis function, and an aggregation function. The accepted data is redistributed from within the portions at each computational node to multiple computational nodes in the plurality of computational nodes, such that data for any element of the specified set of elements is localized to a particular computational node. At each computational node, the trajectory analysis function is applied to the data for each node localized at that computational node. The results of the applying the analysis function are aggregated at each of the computational nodes, including applying the aggregation function to the results. | 05-20-2010 |