Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
A dynamic load balancer on the Intel 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
Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
Embedding data mappers with distributed memory machine compilers
ACM SIGPLAN Notices - Workshop on languages, compilers and run-time environments for distributed memory multiprocessors
ICS '93 Proceedings of the 7th international conference on Supercomputing
ICS '95 Proceedings of the 9th international conference on Supercomputing
Parallel Incremental Graph Partitioning
IEEE Transactions on Parallel and Distributed Systems
Neural networks and dynamic complex systems
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Hopfield and Tank have introduced the use of neural networks for the solution of optimization problems such as the traveling salesman problem. Here we show how to generalize this method to decompose loosely synchronous problems onto parallel machines and in particular the hypercube. In this case, decomposition or load balancing can be formulated graph theoretically in terms of optimal partitioning of the computational graph into N = 2d subgraphs. The algorithm has a suggestive spin system interpretation, with the ferromagnetic interaction minimizing the communication and the long range paramagnetic force balancing the load. The optimal fixed point of the network is in the Higgs phase of the magnet, with the domains of constant spontaneous magnetization representing the optimal decomposition map.The method is fast, reliable and admits various simple implementations: sequential, concurrent on the hypercube, analog on the neural network with adaptive weights (“learning”).We analyze the sequential performance of various mean field based network algorithms and we compare the network approach with the statistical Monte Carlo technique of simulated annealing.