@Article{rajasekaran:out-of-core,
  author = {Sanguthevar Rajasekaran},
  title = {Out-of-core computing on mesh connected computers},
  journal = {Journal of Parallel and Distributed Computing},
  year = {2004},
  month = {November},
  volume = {64},
  number = {11},
  pages = {1311--1317},
  institution = {Univ Connecticut, Dept CSE, 371 Fairfield Rd, ITEB 257,
  Storrs, CT 06269 USA; Univ Connecticut, Dept CSE, Storrs, CT 06269 USA},
  publisher = {Academic Press Inc. Elsevier Science},
  copyright = {(c)2004 Elsevier Engineering Information, Inc.; The Thomson
  Corporation},
  URL = {http://dx.doi.org/10.1016/j.jpdc.2004.08.003},
  keywords = {out-of-core, sorting, parallel disk model, performance analysis,
  pario-bib},
  abstract = {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. CP 2004
  Elsevier Inc. All rights reserved. (27 Refs.)}
}