Abstract: Techniques are disclosed for creating a load balanced spatial partitioning of a structured, diffusing system of particles. An exemplary method includes steps of determining a subset of a set of nodes within a given portion of the coordinate system intersected by a surface defined by points having a given distance from the surface of the given node; and mirroring the determined subset to at least another portion of the coordinate system.

Abstract: A computer readable storage medium for performing a transform of a multidimensional matrix in a distributed memory network by: storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The medium further receives results of the calculation of the transform of the matrix by the nodes.

Abstract: A computer readable storage medium for performing a transform of a multidimensional matrix in a distributed memory network by: storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The medium further receives results of the calculation of the transform of the matrix by the nodes.

Abstract: An information processing system for performing a transform of a multidimensional matrix in a distributed memory network. The method includes storing a multidimensional matrix of side N in a distributed memory network with a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N2 of the plurality of nodes. The system further includes a receiver for receiving results of the calculation of the transform of the matrix by the nodes.

Abstract: A method, information processing system and computer readable medium for performing a transform of a multidimensional matrix in a distributed memory network. The method includes storing a multidimensional matrix of side N in a distributed memory network comprising a plurality of nodes and distributing work associated with a calculation of a transform of the matrix among N.sup.2 of the plurality of nodes. The method further includes receiving results of the calculation of the transform of the matrix by the nodes.

Abstract: Techniques are disclosed for creating a load balanced spatial partitioning of a structured, diffusing system of particles. An exemplary method includes steps of determining a subset of a set of nodes within a given portion of the coordinate system intersected by a surface defined by points having a given distance from the surface of the given node; and mirroring the determined subset to at least another portion of the coordinate system.

Abstract: A method for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions includes steps of: assigning a weight corresponding to a computational cost for a pair interaction of particles to a simulation space distance between the particles; performing a spatial partitioning of the simulation space; and assigning computation of pair interaction to any node that has the positions of both particles.

Abstract: An information processing system includes a processor configured for: defining a simulation space comprising a plurality of fragments and a plurality of processing nodes; determining a weight corresponding to the computational cost for a given pairwise fragment interaction; assigning the weight to the simulation space at a point between the two interacting fragments; performing a spatial partitioning of a volume of the simulation space such that all partitions have substantially the same weight; and assigning a computation of the pairwise fragment interaction to any node that has the positions of both groups of fragments.

Abstract: Disclosed are a method of and system for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions that is scalable to a very large number of nodes and has favorable communications characteristics including well defined bounds on the number of hops and the number of nodes to which a particle's position must be sent. To deal with structural imbalance, we can assign a weight corresponding to the computational cost for a particular pair interaction of particles or locally clustered groups of particles to simulation space at the midpoint of the distance between the particles or centers of the clusters. We then carry out a spatial partitioning of the simulation volume using a k-d tree or optimal recursive bisection (ORB) to divide the volume into sections that have approximately equal total weights.

Abstract: A computer-implemented method for collecting trace streams in application code, instruments the application code to detect an application context. The application context includes static and dynamic attributes.

Abstract: A method for creating a load balanced spatial partitioning of a structured, diffusing system of particles with pairwise interactions, comprises steps of: assigning a weight corresponding to a computational cost for a pair interaction of particles to a simulation space distance between the particles; performing a spatial partitioning of the simulation space; and assigning computation of pair interaction to any node that has the positions of both particles. The method can also be implemented as machine executable instructions executed by a programmable information processing system or as hard coded logic in a specialized computing apparatus such as an application-specific integrated circuit (ASIC).

Abstract: A method, information processing system and computer readable medium for performing a transpose of a multidimensional matrix in a distributed memory network. The method includes storing a multidimensional matrix of side N in a distributed memory network comprising a plurality of nodes and distributing work associated with a calculation of a transpose of the matrix among N2 of the plurality of nodes. The method further includes receiving results of the calculation of the transpose of the matrix by the nodes.