메뉴 건너뛰기
Algorithmica
Volumn 14, Issue 4, 1995, Pages 291-304
A 2 n-2 step algorithm for routing in an n ×n array with constant-size queues
Author keywords

Array; Packet routing; Queue; Routing algorithm
Indexed keywords

EID: 0040089073     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01294128     Document Type: Article
Times cited : (14)
References (8)
  • 1
    • 84936635276 scopus 로고    scopus 로고
    • 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
    • 84936635277 scopus 로고    scopus 로고
    • 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.
  • 4
    • 84936635280 scopus 로고    scopus 로고
    • F. T. Leighton, Methods for Message Routing in Parallel Machines, Proc. 24th ACM Symp. on Theory of Computing, May 1992, pp. 77–96. (Also in Theoretical Computer Science, Vol. 129, July 1994, pp. 31–62.)
  • 5
    • 84936635279 scopus 로고    scopus 로고
    • F. T. Leighton, F. Makedon, and I. Tollis, A (2n−2)-Step Algorithm for Routing in an N ×N Array with Constant Size Queues, Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, June 1989, pp. 328–335.
  • 6
    • 84936635282 scopus 로고    scopus 로고
    • 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
    • 84936635281 scopus 로고    scopus 로고
    • 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.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.