article · KITopen · 2011
Algorithm Engineering for Scalable Parallel External Sorting
Cited by 0Open access
Abstract
The talk describes algorithm engineering (AE) as a methodology for algorithmic research where design, analysis, implementation and experimental evaluation of algorithms form a feedback cycle driving the development of efficient algorithms. Additional important components of the methodology include realistic models, algorithm libraries, and collections of realistic benchmark instances. We use one main example throughout this talk: sorting huge data sets using many multi-core processors and disks. The described system broke records for the GraySort and MinuteSort sorting benchmarks and helped with the record for the Joule Sort benchmark.
Cite this paper
Sanders, P. (2011). Algorithm Engineering for Scalable Parallel External Sorting. KITopen, 1. https://doi.org/10.1109/ipdps.2011.418
Sanders, Peter. “Algorithm Engineering for Scalable Parallel External Sorting.” KITopen, 2011, p. 1, https://doi.org/10.1109/ipdps.2011.418.
Sanders, Peter. 2011. “Algorithm Engineering for Scalable Parallel External Sorting.” KITopen: 1. https://doi.org/10.1109/ipdps.2011.418.
Sanders, P. (2011) ‘Algorithm Engineering for Scalable Parallel External Sorting’, KITopen, p. 1. Available at: https://doi.org/10.1109/ipdps.2011.418.
@article{sanders2011algorithm,
title = {{Algorithm Engineering for Scalable Parallel External Sorting}},
author = {Sanders, Peter},
journal = {KITopen},
pages = {1},
year = {2011},
doi = {10.1109/ipdps.2011.418}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.