SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Parallel and Distributed Computing

Volumn 15, Issue 2, 1992, Pages 160-166

Constant queue routing on a mesh

(2) Rajasekaran, Sanguthevar a Overholt, Richard a

a UNIVERSITY OF PENNSYLVANIA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000986670 PISSN: 07437315 EISSN: None Source Type: Journal
DOI: 10.1016/0743-7315(92)90108-Y Document Type: Article

Times cited : (27)

References (16)

1
- 85034760553
- Routing and sorting on mesh-connected arrays
- Lecture Notes in Computer Science, No. 319, Springer-Verlag, Berlin/New York
- (1988) VLSI Algorithms and Architectures: Proc. AWOC 1988 , pp. 423-433
- Kunde¹

2
- 0026400398
- Concentrated regular data steams on grids: Sorting and routing near to the bisection bound
- (1991) Proc. Symposium on Foundations of Computer Science
- Kunde¹

3
- 84915392481
- Leighton, T., Makedon, F., and Tollis, I. G., A 2n − 2 step algoithm for routing in an n × n array with constant size queues, Proc. 1989 ACM Symposium on Parallel Algorithms and Architectures, PP. 328–335

4
- 0022866986
- The distance bound for sorting on mesh-connected processor arrays in tight
- (1986) Proc. Symposium on Foundations of Computer Science , pp. 255-263
- Ma¹ Sen² Scherson³

5
- 0021570797
- Parallel communication with limited buffers
- (1984) Proc. Symposium on Foundations of Computer Science , pp. 127-136
- Pippenger¹

6
- 35048869515
- Randomized algorithms for packet routing on the mesh
- Blackwell, Oxford, to appear
- (1992) Advances in Parallel Algorithms
- Rajasekaran¹

7
- 84915392480
- Rajasekaran, S., and Overholt, R., An improved 2n − 2 constant queue routing algorithm for an (n × n) mesh. Technical Report MS-CIS-90-25, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104.

8
- 84915392479
- Symposium on Theoretical Aspects of Computer Science
- Also presented in, 1991, Springer-Verlag, Berlin/New York
- (1991) Lecture Notes on Computer Science, No. 480 , pp. 444-455

9
- 84909777336
- An optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks
- 1987, Lecture Notes in Computer Science, No. 287, Springer-Verlag, Berlin/New York
- (1987) Proc. Conference on Foundations of Software Technology and Theoretical Computer Science , pp. 226-241
- Rajasekaran¹ Tsantilas²

10
- 84915392478
- Rajasekaran, S., and Tsantilas, Th., Optimal routing algorithms for mesh-connected processor arrays. Algorithmica, to appear.

11
- 84990690765
- Aegean Workshop on Computing
- 1988, Springer-Verlag, Berlin/New York
- (1988) Lecture Notes in Computer Science, No. 319 , pp. 411-422
- Krizanc¹ Rajasekaran² Tsantilas³

12
- 0023594047
- How to emulate shared memory
- (1987) Proc. Symposium on Foundations of Computer Science , pp. 185-194
- Ranade¹

13
- 0000398654
- An optimal sorting algorithm for mesh connected computers
- (1986) Proc. Symposium on Theory of Computing , pp. 255-263
- Schnorr¹ Shamir²

14
- 84915392477
- Rajasekaran, S., and Overholt, R., An improved 2n − 2 constant queue routing algorithm for an (n × n) mesh. Technical Report MS-CIS-90-25, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104.

15
- 0021465184
- Efficient schemes for parallel communication
- (1984) Assoc. Comput. Math. , vol.31 , Issue.3 , pp. 507-517
- Upfal¹

16
- 85025263656
- Universal schemes for parallel communication
- (1981) Proc. Symposium on Theory of Computing , pp. 263-277
- Valiant¹ Brebner²

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