Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Load balancing loosely synchronous problems with a neural network
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Hypercube algorithms for neural network simulation: the Crystal_Accumulator and the Crystal Router
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
What have we learnt from using real parallel machines to solve real problems?
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Optimal matrix algorithms on homogeneous hypercubes
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
The performance of the caltech hypercube in scientific calculations: a preliminary analysis
Supercomputers: algorithms, architectures, and scientific computation
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A string theory for time dependent complex systems and its application to automatic decomposition
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Hypercube algorithms for neural network simulation: the Crystal_Accumulator and the Crystal Router
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Piriform (Olfactory) cortex model on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Optimal matrix algorithms on homogeneous hypercubes
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Neural networks and dynamic complex systems
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Personalized broadcasting in banyan-hypercube networks
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
| Hi-index | 0.00 |
We discuss optimal communication and decomposition algorithms for a class of regular problems on concurrent computers with a hypercube topology, using a general technique we call the method of cube geodesics.We address the calculation of various transformations ( convolutions, functionals etc. ) of data distributed over the hypercube; examples are the Fast Fourier Transform, matrix algorithms, global scalar products and vector sums, sorting. These all involve long distance inter-node interactions and require more intricate communication that the simple local problems with static spatial decomposition such as partial differential equations.We believe that our library of optimal communication routines is applicable to these and many other problems. The simple example of a database application is sketched. We implement the algorithms on the Caltech/JPL Mark II hypercube and present a detailed performance analysis.