@Article{clement:overlap,
  author = {Mark J. Clement and Michael J. Quinn},
  title = {Overlapping Computations, Communications and {I/O} in Parallel
  Sorting},
  journal = {Journal of Parallel and Distributed Computing},
  year = {1995},
  month = {August},
  volume = {28},
  number = {2},
  pages = {162--172},
  publisher = {Academic Press},
  keywords = {parallel I/O algorithm, sorting, pario-bib},
  comment = {They present a new parallel sorting algorithm that allows overlap
  between disk, network, and processor. By pipelining the tasks, they can
  double the speed of sorting; best results, of course, when these three
  components take approximately equal time. The disk I/O is really only used to
  load the initial data set and write the output data set, rather than being
  used for an external sorting scheme. They obtain their gains by overlapping
  that disk I/O with the communication and processing.}
}