Skip to main content
SpringerLink
Log in

Flit-serial packet routing on meshes and tori

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

In this paper we consider theflit-serial packet-routing problem, where each packet consists of a sequence ofk flits and is, thus, called asnake. Based on the properties of the snake during the routing, we give a formal definition of three different packet-routing models, namely, thestore-and-forward model, thecut-through model, and thecut-through with partial cuts model. Surprisingly, all previous work has focused on the store-and-forward model. We also introduce therestricted cut-through model, which is unrealistic, but is proved to be a very powerful tool in the effort to bound the time required by a routing problem. We study the cut-through with partial cuts model which is most commonly used in practice. We present the first algorithms, deterministic and probabilistic, based on this model for the permutation routing problem on a chain, on a square mesh, and on a square torus.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  5. T. Hagerup, C. Rüb, A Guided Tour of Chernoff Bounds,Information Processing Letters, Vol. 33, pp. 305–308, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    MATH  MathSciNet  Google Scholar 

  10. D. Krizanc, S. Rajasekaran, Th. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, inVLSI Algorithms and Architectures (AWOC '88), J. Reif, editor, Lecture Notes in Computer Science, Vol. 319, pp. 411–422, Springer-Verlag, Berlin, 1988.

    Google Scholar 

  11. M. Kunde, Routing and Sorting on Mesh-Connected Arrays, inVLSI Algorithms and Architectures (AWOC '88), J. Reif, editor, Lecture Notes in Computer Science, Vol. 319, pp. 423–433, Springer-Verlag, Berlin, 1988.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Google Scholar 

  16. F. T. Leighton, F. Makedon, I. G. Tollis, A 2n-2 Algorithm for Routing in ann xn 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.

    Article  Google Scholar 

  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.

    Article  MATH  Google Scholar 

  21. S. Rajasekaran, T. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays,Algorithmica, Vol. 8, 1992, pp. 21–38.

    Article  MATH  MathSciNet  Google Scholar 

  22. C. P. Schnorr, A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers,Proceedings of the 18thACM Symposium on Theory of Computing, 1986, pp. 255–263.

  23. C. D. Thompson, H. T. Kung, Sorting on a Mesh-Connected Parallel Computer,Communications of the Association for Computing Machinery, Vol. 20, 1977, pp. 263–270.

    MATH  MathSciNet  Google Scholar 

  24. L. G. Valiant, G. J. Brebner, Universal Schemes for Parallel Communication,Proceedings of the 13thAnnual ACM Symposium on the Theory of Computing, May 1981, pp. 263–277.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Dartmouth College, 03755, Hanover, NH, USA

    F. Makedon

  2. Basser Department of Computer Science, University of Sydney, 2006, Sydney, N.S.W., Australia

    A. Symvonis

Authors
  1. F. Makedon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Symvonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Makedon, F., Symvonis, A. Flit-serial packet routing on meshes and tori. Math. Systems Theory 29, 311–330 (1996). https://doi.org/10.1007/BF01192690

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01192690

Keywords

Search

Navigation