DocumentCode :
1831896
Title :
Deterministic routing and sorting on rings
Author :
Sibeyn, Jop F.
Author_Institution :
Max-Planck-Inst. fur Inf., Saarbrucken, Germany
fYear :
1994
fDate :
26-29 Apr 1994
Firstpage :
406
Lastpage :
410
Abstract :
We present deterministic algorithms for k-k routing and k-k sorting on circular processor arrays with bidirectional connections. We distinguish between cases where k<4, 4⩽k<n2, and k⩾n2. Standing results are considerably improved; for most problem instances, near-optimality is achieved. A very simple algorithm has good performance for dynamic routing problems
Keywords :
multiprocessor interconnection networks; network routing; parallel algorithms; sorting; bidirectional connections; circular processor arrays; deterministic routing algorithms; dynamic routing problems; k-k routing; k-k sorting; near-optimal performance; parallel algorithms; rings; Computational modeling; Concurrent computing; Parallel architectures; Routing; Sorting; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1994. Proceedings., Eighth International
Conference_Location :
Cancun
Print_ISBN :
0-8186-5602-6
Type :
conf
DOI :
10.1109/IPPS.1994.288270
Filename :
288270
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1831896
بازگشت