Out-of-core computing on mesh connected computers
Several models of parallel disks are found in the literature. These models have been proposed to alleviate the I/O bottleneck arising in handling voluminous data. These models have the general theme of assuming multiple disks. For instance the parallel disks model assumes D disks and a single computer. It is also assumed that a block of data from each of the D disks can be fetched into the main memory in one parallel I/O operation. In this paper, we study a model where there are more than one processors and each processor has an associated disk. In addition to the I/O cost, one also has to account for the inter-processor communication costs. To begin with we study the mesh and we investigate the performance of the mesh with respect to out-of-core computing. As a case study we consider the problem of sorting. The goal of this paper is to study the properties of this model. (C) 2004 Elsevier Inc. All rights reserved.
out-of-core computing mesh connected computers i/o bottleneck parallel disks model parallel models of computing sorting algorithms packet routing randomized computing