Hot-potato worm routing is almost as easy as store-and-forward packet routing
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Concentrated regular data streams on grids: sorting and routing near to the bisection boundPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On bit-serial packet routing for the mesh and the torusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast deflection routing for packets and wormsPublished by Association for Computing Machinery (ACM) ,1993
- Matching the bisection bound for routing and sorting on the meshPublished by Association for Computing Machinery (ACM) ,1992
- A theory of wormhole routing in parallel computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimal embeddings of butterfly-like graphs in the hypercubeTheory of Computing Systems, 1990
- On-line Clean-up System of Plasma Sample for Simultaneous Determination of Morphine and Its Metabolites in Cancer Patients by High-Performance Liquid ChromatographyJournal of Pharmaceutical Sciences, 1990
- Average case analysis of greedy routing algorithms on arraysPublished by Association for Computing Machinery (ACM) ,1990
- The architecture and programming of the Ametek series 2010 multicomputerPublished by Association for Computing Machinery (ACM) ,1988
- An optimal sorting algorithm for mesh connected computersPublished by Association for Computing Machinery (ACM) ,1986