The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient data structure for dynamic memory management
Journal of Systems and Software
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Fast probabilistic algorithms for hamiltonian circuits and matchings
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
In this paper we investigate the question of what is a good way to interconnect a large number of processors. Our main result is the construction of a universal parallel machine that can simulate every reasonable parallel machine with only a small loss of time and with essentially the same number of processors.