Efficient routing schemes for multiple broadcasts in hypercubes
Authors:
- G.D. StamoulisGSG.D. Stamoulis
- J.N. TsitsiklisJTJ.N. Tsitsiklis
- 1 July 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (7) , 725-739
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The efficiency of greedy routing in hypercubes and butterfliesIEEE Transactions on Communications, 1994
- Optimal communication algorithms for hypercubesJournal of Parallel and Distributed Computing, 1991
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Performance of the direct binary n-cube network for multiprocessorsIEEE Transactions on Computers, 1989
- Continuous routing and batch routing on the hypercube1986
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982
- Universal schemes for parallel communication1981
- Queueing Models for Computer Communications System AnalysisIEEE Transactions on Communications, 1977
- Some Inequalities for Parallel-Server QueuesOperations Research, 1971