Multi-packet-routing on mesh connected arrays

Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Volumn , Issue , 1989, Pages 336-343

  Kunde, Manfred ^a   Tensi, Thomas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MESH GENERATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

BUFFER SIZES; CONNECTED ARRAYS; K PERMUTATIONS; PACKET ROUTING; PERMUTATION ROUTING PROBLEM; ROUTING PACKETS; SIDE LENGTH;

PARALLEL ARCHITECTURES;

EID: 0346074012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/72935.72971     Document Type: Conference Paper

References (13)

1. [AJP86] Agrawal, D.P., Janakirarn, V.K., Pathak, G.C.: Evaluating the performance of multicomputer configurations, IEEE Computer, Vol. 19 (1986), pp. 23-37.
2. [KND87] Kunde, M.: Optimal sorting on multidimensionally 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.
3. [KND88a] Kunde, M.: Routing and Sorting on Mesh-Connected Arrays, in: J.H.Reif (ed.): VLSI Algorithms and Architectures, Proceedings of the 3rd AWOC 88, LNCS 319, pp. 423-433.
4. [KND88b] Kunde, M.: Parallel Routing on Multi- Dimensional Grids of Processors, to appear in Proceedings of CONPAR88.
5. [KRT88] Krizanc, D., Rajasekaran, S., Tsantilas, T.: Optimal Routing Algorithms for Mesh- Connected Processor Arrays, in: J.H.Reif (ed.): VLSI Algorithms and Architectures, Proceedings of the 3rd AWOC 88, LNCS 319, pp. 411-422.
6. [LMT89] Leighton, T., Makedon, F., Tollis, I.: A 2n - 2 Step Algorithm for Routing in an n x n Array With Constant Size Queues, these proceedings.
7. [MSS86] 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.
8. [NS79] Nassimi, D., Sahni, S.: Bitonic sort on a mesh-connected parallel computer, IEEE Trans. Comput. C-28 (1979), pp. 2-7.
9. [RT87] Rajasekaran, S., Tsantilas, T.: An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks, Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, Lect. Notes Comp. Sei., vol. 287, pp. 226-241, Berlin-Heidelberg-New York-Tokyo: Springer 1987.
10. [SS86] Schnorr, C.P., Shamir, A.: An optimal sorting algorithm for mesh-connected computers, Proceedings STOC 1986. Berkley 1986, pp. 255-263.
11. [SW89] Stout, Q.F., Wager, B.: Intensive Hypercube Communication I: Prearranged Communication in Link=Bound Machines, to appear in: Journal of Parallel and Distributed Computing.
12. [THKU77] Thompson, C.D., Kung, H.T.: Sorting on a mesh-connected parallel computer, CACM 20 (1977), pp. 263-270.
13. [VAL81] Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication, Proceedings STOC 81, pp. 263-277.