This paper discusses our implementation of Rajasekaran\u27s (l,m)-mergesort algorithm (LMM) for sorting on parallel disks. LMM is asymptotically optimal for large problems and has the additional advantage of a low constant in its I/O complexity. Our implementation is written in C using the ViC* I/O API for parallel disk systems. We compare the performance of LMM to that of the C library function qsort on a DEC Alpha server. qsort makes a good benchmark because it is fast and performs comparatively well under demand paging. Since qsort fails when the swap disk fills up, we can only compare these algorithms on a limited range of inputs. Still, on most out-of-core problems, our implementation of LMM runs between 1.5 and 1.9 times faster than q...
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset o...
A parallel sorting algorithm is presented for storage-efficient internal sorting on MIMD machines. T...
Abstract. The Parallel Disks Model (PDM) has been proposed to al-leviate the I/O bottleneck that ari...
This paper discusses our implementation of Rajasekaran\u27s (l,m)-mergesort algorithm (LMM) for sort...
In this paper we present a simple parallel sorting algorithm and illustrate its application in gener...
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
The original publication is available at www.springerlink.comExternal sorting|the process of sorting...
We present the design and implementation of a parallel out-of-core sorting algorithm, which is based...
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and tha...
The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottle-neck that arises in the...
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and tha...
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques....
Abstract. Merge sort is useful in sorting a great number of data pro-gressively, especially when the...
The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the ...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset o...
A parallel sorting algorithm is presented for storage-efficient internal sorting on MIMD machines. T...
Abstract. The Parallel Disks Model (PDM) has been proposed to al-leviate the I/O bottleneck that ari...
This paper discusses our implementation of Rajasekaran\u27s (l,m)-mergesort algorithm (LMM) for sort...
In this paper we present a simple parallel sorting algorithm and illustrate its application in gener...
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
The original publication is available at www.springerlink.comExternal sorting|the process of sorting...
We present the design and implementation of a parallel out-of-core sorting algorithm, which is based...
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and tha...
The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottle-neck that arises in the...
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and tha...
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques....
Abstract. Merge sort is useful in sorting a great number of data pro-gressively, especially when the...
The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the ...
(eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps ...
Quicksort is well-know algorithm used for sorting, making O(n log n) comparisons to sort a dataset o...
A parallel sorting algorithm is presented for storage-efficient internal sorting on MIMD machines. T...
Abstract. The Parallel Disks Model (PDM) has been proposed to al-leviate the I/O bottleneck that ari...