Experiments with a Parallel External Memory System ⋆ (2008)
Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require that the aggregate...
Duality Between Prefetching and Queued Writing with Parallel Disks (2005)
Hutchinson, David A., Sanders, Peter, Vitter, Jeffrey S.
Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. To combat...
The power of duality for prefetching and sorting with parallel disks (2001)
David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
External memory (EM) algorithms are designed to be efficient when the problem data do not fit into the high-speed random access memory (RAM) of a computer and must instead
Duality between prefetching and queued writing with parallel disks (2001)
David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise. To combat...
Duality between prefetching and queued writing with parallel disks (2001)
Abstract. Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise....
Duality between prefetching and queued writing with parallel disks (2001)
Abstract. Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise....
Distribution sort with randomized cycling (2001)
Jeffrey Scott Vitter, David A. Hutchinson
Paxallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often difficult. In this paper we develop randomized vaxiants of distribution...
Distribution sort with randomized cycling (2001)
Jerey Scott Vitter, David A. Hutchinson
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often dicult. In this paper we develop randomized variants of distribution sort...
Duality between prefetching and queued writing with parallel disks (2001)
David A. Hutchinson, Peter Sanders, Scott Vitter
Abstract. Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise....
Duality between prefetching and queued writing with parallel disks (2001)
David A. Hutchinson, Peter Sanders, Scott Vitter
Abstract. Parallel disks promise to be a cost effective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be difficult to devise....
Duality between prefetching and queued writing with applications to external sorting (1998)
Abstract. Parallel disks promise to be a cost e ective means for achieving high bandwidth in applications involving massive data sets, but algorithms for parallel disks can be di cult to devise. To...