The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Executing functional programs on a virtual tree of processors
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Performance based design and analysis of multimicrocomputer networks
Performance based design and analysis of multimicrocomputer networks
Cost-Performance Bounds for Multimicrocomputer Networks
IEEE Transactions on Computers
Communication Structures for Large Networks of Microcomputers
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
IEEE Transactions on Software Engineering
| Hi-index | 14.98 |
Because a group of interconnected microcomputers may not share any globally addressable memory, it is crucial that a multimicrocomputer interconnection network capable of efficiently supporting message passing be found. Using task precedence graphs to represent the time varying behavior of parallel computations, both the behavior of interconnection networks under varying workloads and the feasibility of distributed scheduling are investigated.