DocumentCode :
301132
Title :
Integer sorting and routing in arrays with reconfigurable optical buses
Author :
Pavel, Sandy ; Akl, Selim G.
Author_Institution :
Dept. of Comput. & Inf. Sci., Queen´´s Univ., Kingston, Ont., Canada
Volume :
2
fYear :
1996
fDate :
12-16 Aug 1996
Firstpage :
90
Abstract :
We present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconfigurable optical buses. The main objective is to identify the mechanisms specific to this type of architecture which allow building efficient integer sorting, partial permutation routing and h-relations algorithms. The consequences of these results on PRAM simulations are also investigated
Keywords :
computational complexity; deterministic algorithms; network routing; optical computing; optical interconnections; parallel algorithms; parallel architectures; reconfigurable architectures; sorting; system buses; PRAM simulations; architectures; arrays; deterministic algorithms; h-relations algorithms; integer sorting; on-line packet routing; partial permutation routing; reconfigurable optical buses; Buildings; Councils; Data engineering; Information science; Optical arrays; Optical computing; Optical fiber networks; Phase change random access memory; Routing; Sorting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on
Conference_Location :
Ithaca, NY
ISSN :
0190-3918
Print_ISBN :
0-8186-7623-X
Type :
conf
DOI :
10.1109/ICPP.1996.537386
Filename :
537386
Link To Document :
بازگشت