DocumentCode :
2453562
Title :
Selection algorithms for parallel disk systems
Author :
Rajasekaran, Sanguthevar
Author_Institution :
Dept. of Comput. & Inf. Sci., Florida Univ., Gainesville, FL, USA
fYear :
1998
fDate :
17-20 Dec 1998
Firstpage :
343
Lastpage :
350
Abstract :
With the widening gap between processor speeds and disk access speeds, the I/O bottleneck has become critical. Parallel disk systems (PDS) have been introduced to alleviate this bottleneck. We present deterministic and randomized selection algorithms for parallel disk systems. The algorithms to be presented, in addition to being asymptotically optimal, have small underlying constants in their time bounds and hence have the potential of being practical
Keywords :
computational complexity; concurrency theory; deterministic algorithms; parallel algorithms; randomised algorithms; PRAM; asymptotically optimal; deterministic algorithms; disk access speeds; input output bottleneck; parallel disk systems; processor speeds; randomized algorithms; selection algorithms; time bounds;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Computing, 1998. HIPC '98. 5th International Conference On
Conference_Location :
Madras
Print_ISBN :
0-8186-9194-8
Type :
conf
DOI :
10.1109/HIPC.1998.738007
Filename :
738007
Link To Document :
بازگشت