Reconciling Simplicity and Realism in Parallel Disk Models (2001)
| Venue: | Parallel Computing |
| Citations: | 16 - 3 self |
BibTeX
@INPROCEEDINGS{Sanders01reconcilingsimplicity,
author = {Peter Sanders},
title = {Reconciling Simplicity and Realism in Parallel Disk Models},
booktitle = {Parallel Computing},
year = {2001},
pages = {67--76}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
For the design and analysis of algorithms that process huge data sets, a machine model is needed that handles parallel disks. There seems to be a dilemma between simple and flexible use of such a model and accurate modelling of details of the hardware. This paper explains how many aspects of this problem can be resolved. The programming model implements one large logical disk allowing concurrent access to arbitrary sets of variable size blocks. This model can be implemented efficienctly on multiple independent disks even if zones with different speed, communication bottlenecks and failed disks are allowed. These results not only provide useful algorithmic tools but also imply a theoretical justification for studying external memory algorithms using simple abstract models.
