Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A 2n−2 step algorithm for routing in ann ×n array with constant-size queues

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper we describe a deterministic algorithm for solving any 1–1 packet-routing problem on ann ×n mesh in 2n−2 steps using constant-size queues. The time bound is optimal in the worst case. The best previous deterministic algorithm for this problem required time 2n+Θ(n/q) using queues of size Θ(q) for any 1≤q≤n, and the best previous randomized algorithm required time 2n+Θ(logn) using constant-size queues.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Kirzanc, S. Rajasekaran, and T. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays,VLSI Algorithms and Architectures: Proc. AWOC'88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, pp. 411–422.

  2. M. Kunde, Routing and Sorting on Mesh-Connected Arrays,VLSI Algorithms and Architectures: Proc. AWOC'88, Lecture Notes in Computer Science, Vol. 319, Springer-Verlag, Berlin, pp. 423–433.

  3. F. T. Leighton,Introducton to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, Morgan Kaufman, San Mateo, CA, 1992.

    Google Scholar 

  4. F. T. Leighton, Methods for Message Routing in Parallel Machines,Proc. 24th ACM Symp. on Theory of Computing, May 1992, pp. 77–96. (Also inTheoretical Computer Science, Vol. 129, July 1994, pp. 31–62.)

  5. F. T. Leighton, F. Makedon, and I. Tollis, A (2n−2)-Step Algorithm for Routing in anN ×N Array with Constant Size Queues,Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 328–335.

  6. S. Rajasekaran and R. Overholt, Constant Queue Routing on a Mesh,Proc. 8th Annual Symp. on Theoretical Aspects of Computer Science, edited by C. Choffrut and M. Jantzen, Lecture Notes in Computer Science, Vol. 480, Springer-Verlag, Berlin, pp. 444–455.

  7. C. Schnorr and A. Shamir, An Optimal Sorting Algorithm for Mesh Connected Computers,Proc. 18th ACM Symp. on Theory of Computing, 1986, pp. 255–263.

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    T. Leighton

  2. Department of Mathematics and Computer Science, Dartmouth College, 03755, Hanover, NH, USA

    F. Makedon

  3. Department of Computer Science, University of Texas at Dallas, 75083, Richardson, TX, USA

    I. G. Tollis

Authors
  1. T. Leighton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Makedon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. G. Tollis
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

This research was supported by the Clear Center at UTD, DARPA Contracts N00014-91-J-1698 and N00014-92-J-1799, Air Force Contract F49620-92-J-0125, Army Contract DAAL-03-86-K-0171, an NSF Presidential Young Investigator Award with matching funds from AT&T and IBM, and by the Texas Advanced Research Program under Grant No. 3972. A preliminary version of this paper appeared in [5].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leighton, T., Makedon, F. & Tollis, I.G. A 2n−2 step algorithm for routing in ann ×n array with constant-size queues. Algorithmica 14, 291–304 (1995). https://doi.org/10.1007/BF01294128

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation