Sciweavers

69 search results - page 2 / 14
» A Practical Realization of Parallel Disks
Sort
View
MST
2002
128views more  MST 2002»
13 years 4 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
SPAA
1993
ACM
13 years 9 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
IOPADS
1997
152views more  IOPADS 1997»
13 years 6 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
IPPS
2007
IEEE
13 years 11 months ago
A Utility-based Approach to Cost-Aware Caching in Heterogeneous Storage Systems
Modern single and multi-processor computer systems incorporate, either directly or through a LAN, a number of storage devices with diverse performance characteristics. These stora...
Liton Chakraborty, Ajit Singh
TC
2008
13 years 4 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen