Flit-serial packet routing on meshes and tori

Theory of Computing Systems

Volumn 29, Issue 4, 1996, Pages 311-330

  Makedon, F ^a   Symvonis, A ^b  

^a Dartmouth College   (United States)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES;

FORMAL DEFINITION; PACKET ROUTING; PARTIAL CUTS; PERMUTATION ROUTING PROBLEM; RESTRICTED CUT; ROUTING PROBLEMS; SQUARE MESHES; STORE AND FORWARD;

COMPUTER SCIENCE;

EID: 0040942822     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01192690     Document Type: Article

References (24)

1. B. Aiello, F. T. Leighton, B. Maggs, M. Newman, Fast Algorithms for Bit-Serial Routing on a Hypercube, Mathematical Systems Theory, Vol. 24, pp. 253-271, 1991.
2. B. Chlebus, M. Kaufmann, J. Sibeyn, Deterministic Permutation Routing on Meshes, Proceedings of the Fifth Symposium on Parallel and Distributed Processing, December 1993, pp. 814-821.
3. W. J. Dally, C. L. Seitz, The Torus Routing Chip, Distributed Computing, Vol. 1, pp. 187-196, 1986.
4. W. J. Dally, C. L. Seitz, Deadlock-Free Message Routing in Multiprocessors Interconnection Networks, IEEE Transactions on Computers, Vol. 36, No. 5, pp. 547-553, 1987.
5. T. Hagerup, C. Rub, A Guided Tour of Chernoff Bounds, Information Processing Letters, Vol. 33, pp. 305-308, 1990.
6. C. Kaklamanis, D, Krizanc, S. Rao, Simple Path Selection for Optimal Routing on Processor Arrays, Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '92, June 1992, San Diego, CA, pp. 23-30.
7. M. Kaufmann, S. Rajasekaran, J. Sibeyn, Matching the Bisection Bound for Routing and Sorting on the Mesh, Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '92, June 1992, San Diego, CA, pp. 31-40.
8. M. Kaufmann, J. Sibeyn, T. Suel, Derandomizing Algorithms for Routing and Sorting on Meshes, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, 1994, pp. 669-679.
9. P. Kermani, L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique, Computer Networks, Vol. 3, No. 4, pp. 267-286, 1979.
10. D. Krizanc, S. Rajasekaran, Th. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, in VLSI Algorithms and Architectures (AWOC '88), J. Reif, editor. Lecture Notes in Computer Science, Vol. 319, pp. 411-422, Springer-Verlag, Berlin, 1988.
11. M. Kunde, Routing and Sorting on Mesh-Connected Arrays, in VLSI Algorithms and Architectures (AWOC '88), J. Reif, editor, Lecture Notes in Computer Science, Vol. 319, pp. 423-433, Springer-Verlag, Berlin, 1988.
12. M. Kunde, Balanced Routing: Towards the Distance Bound on Grid, Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '91, July 21 -24, 1991, pp. 260-271.
13. M. Kunde, T. Tensi, (k-k) Routing on Multidimensional Mesh-Connected Arrays, Journal of Parallel and Distributed Computing, Vol. 11, No. 2, 1991, pp. 146-155.
14. F. T. Leighton, Average Case Analysis of Greedy Routing Algorithms on Arrays, Proceedings of the Second Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '90, Crete, July 2-6, 1990, pp. 2-10.
15. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, Los Altos, CA, 1991.
16. F. T. Leighton, F. Makedon, I. G. Tollis, A 2n -2 Algorithm for Routing in an n × n Array with Constant Size Queues, Proceedings of ACM Symposium on Parallel Algorithms and Architectures, SPAA '89, Santa Fe, NM, June 18-21, 1989, pp. 328-335.
17. F. Makedon, A. Symvonis, An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements, IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 3, 1993, pp. 270-276.
18. J. Y. Ngai, A Framework for Adaptive Routing in Multicomputer Networks, Ph.D Thesis, Technical Report CS:TR:89-09, Caltech Computer Science Department.
19. J. Y. Ngai, C. L. Seitz, A Framework for Adaptive Routing in Multicomputer Networks, Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, SPAA '89, June 1989, pp. 1-9.
20. S. Rajasekaran, R. Overholt, Constant Queue Routing on a Mesh, Journal of Parallel and Distributed Computing, Vol. 15, No. 2, 1992, pp. 160-166.
21. S. Rajasekaran, T. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Algorithmica, Vol. 8, 1992, pp. 21-38.
22. C. P. Schnorr, A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers, Proceedings of the 18th ACM Symposium on Theory of Computing, 1986, pp. 255-263.
23. C. D. Thompson, H. T. Rung, Sorting on a Mesh-Connected Parallel Computer, Communications of the Association for Computing Machinery, Vol. 20, 1977, pp. 263-270.
24. L. G. Valiant, G. J. Brebner, Universal Schemes for Parallel Communication, Proceedings of the 13th Annual ACM Symposium on the Theory of Computing, May 1981, pp. 263-277.