@InProceedings{cerin:sorting,
  author = {Christophe C\'erin and Hazem Fkaier and Mohamed Jemni},
  title = {A Synthesis of Parallel Out-of-core Sorting Programs on
  Heterogeneous Clusters},
  booktitle = {Proceedings of the Third IEEE/ACM International Symposium on
  Cluster Computing and the Grid},
  year = {2003},
  month = {May},
  pages = {78--85},
  publisher = {IEEE Computer Society Press},
  address = {Tokyo, Japan},
  URL =
  {http://csdl.computer.org/comp/proceedings/ccgrid/2003/1919/00/19190078abs.htm},
  keywords = {out-of-core, sorting, parallel I/O, load balancing, data
  distribution, pario-app, pario-bib},
  abstract = {The paper considers he problem of parallel external sorting in
  the contex of a form of heterogeneous clusters. We introduce two algorithms
  and we compare them two another one that we have previously developed. Since
  most common sort algorithms assume high-speed random access to all
  intermediate memory, they are unsuitable if the values to be sorted don't fit
  in main memory. This is the case for cluster computing platforms which are
  made of standard, cheap and scarce components. For that class of computing
  resources a good use of I/O operations compatible with the requirements of
  load balancing and computational complexity are the key to success. We
  explore three techniques and show how they can be deployed for clusters with
  processor performances related by a multiplicative factor. We validate the
  approaches in showing experimental results for the load balancing factor.}
}