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
Optimal communication algorithms for regular decompositions on the hypercube
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
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
Neural networks and dynamic complex systems
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
| Hi-index | 0.00 |
We introduce a string or world line formalism that provides a general description of time dependent complex systems. We show that it can be applied to mapping general problems onto both sequential and parallel computers. In principle it unifies the concepts of an optimizing compiler with that of parallel decomposition. We show that it reproduces and smoothly interpolates both our original load balancing methods for loosely synchronous problems and optimal communication and combining algorithms such as index and fold. We evaluate two explicit implementations, the neural_router and neural_accumulator, which use an optimizing neural network.