Routing and sorting on mesh-connected arrays: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 319 LNCS, Issue , 1988, Pages 423-433

  Kunde, Manfred ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MESH GENERATION; SORTING; VLSI CIRCUITS;

ASYMPTOTICALLY OPTIMAL; CONNECTED ARRAYS; DETERMINISTIC ROUTING ALGORITHMS; EXTENDED ABSTRACTS; HIGH PROBABILITY; RANDOMIZED ALGORITHMS; ROUTING DATA; SORTING ALGORITHM;

COMPUTER ARCHITECTURE;

EID: 85034760553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0040409     Document Type: Conference Paper

References (17)

1. Foster, M.J., Kung, H.T.: The design of special-purpose VLSI-chips. IEEE Comput. 13, 26-40 (1980)
2. Kumar, M., Hirschberg, D.S.: An efficient implementation of Batcher’s odd-even merge algorithm and its application in parallel sorting schemes. IEEE Trans. Comput. C-32, 254-264 (1983)
3. Kunde, M.: A general approach to sorting on 3-dimensionally mesh-connected arrays. In: Händlers, W. (eds.) Lect. Notes Comput. Sci., vol. 237, pp. 84-95. Berlin-Heidelberg-New York-Tokyo: Springer 1986
4. Kunde, M.: Lower bounds for sorting on mesh-connected architectures. Acta Informatica 24, 121-130 (1987).
5. Kunde, M.: Optimal sorting on multi-dimensionally mesh-connected computers. Proceedings of STACS 87. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) Lect. Notes Comp. Sci., vol. 247, pp. 408-419. Berlin-Heidelberg-New York-Tokyo: Springer 1987
6. Kunde, M.: Bounds for l-section and related problems on grids of processors; submitted
7. Kung, H.T., Leiserson, C.E.: Systolic arrays for VLSI. Symposium on Sparse Matrix Computation 1978, Proceeding, Duff, I.S., Stewart, C.G. (eds.) 1978
8. Knuth, D.E.: The art of computer programming, vol. 3: Sorting and Searching, Addison Wesley, Reading, 1973, pp. 224-225.
9. Lang, H.-W., Schimmler, M., Schmeck, H., Schröder, H.: Systolic sorting on a mesh-connected network. IEEE Trans. Comput. C-34, 652-658 (1985)
10. Ma, Y., Sen, S., Scherson, I.D.: The distance bound for sorting on mesh-connected processor arrays is tight. Proceedings FOCS 86, pp. 255-263
11. Nassimi, D., Sahni, S.: Bitonic sort on a mesh-connected parallel computer. IEEE Trans. Comput. C-28, 2-7 (1979)
12. Rajasekaran, S., Tsantilas, Th.: An optimal randomized routing algorithm for the mesh and a class of efficient mesh-like routing networks. 7th Conference on Foundations of Software Technology and Theoretical Science, Pune, India
13. Sado, K., Igarashi, Z.: A fast parallel pseudo-merge sort algorithm. Gunma University, Technical Report, Japan, 1985
14. Schimmler, M.: Fast sorting on a three dimensional cube grid. Technical Report 8604, University of Kiel, Germany, 1986
15. Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh-connected computers, pp. 255-263. Proceedings STOC 1986. Berkley 1986
16. Thompson, C.D., Kung, H.T.: Sorting on a mesh-connected parallel computer. CACM 20, 263-271 (1977)
17. Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. Proceedings STOC 81, pp. 263-277.