Building a parallel pipelined external memory algorithm library

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Beckmann, Andreas ^a   Dementiev, Roman ^b   Singlery, Johannes ^a  

^a GOETHE UNIVERSITY   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCK SPEED; EXTERNAL MEMORY ALGORITHMS; HARD DISKS; MULTI-CORE PROCESSOR; NEW APPROACHES; PARALLEL DISKS; PARALLELIZATIONS; PRACTICAL USE; SINGLE MACHINES;

DISKS (MACHINE COMPONENTS); DISTRIBUTED PARAMETER NETWORKS;

PARALLEL ALGORITHMS;

EID: 70449905977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161001     Document Type: Conference Paper

References (14)

1. L. Arge. The Buffer Tree: A New Technique for Optimal I/O-Algorithms. In 4th Workshop on Algorithms and Data Structures, number 955 in LNCS, pages 334-345, 1995.
2. L. Arge, G. S. Brodal, and L. Toma. On external-memoryMST, SSSP and multi-way planar graph separation. Journal of Algorithms, 53, 2004.
3. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamasia, D. E. Vengroff, and J. S. Vitter. External memory graph algorithms.In 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, 1995.
4. T. H. Cormen and E. R. Davidson. FG: A framework generator for hiding latency in parallel programs running on clusters. In Proceedings of the ISCA 17th International Conferenceon Parallel and Distributed Computing Systems (ISCA PDCS), pages 137-144, 2004.
5. E. R. Davidson and T. H. Cormen. Building on a framework: Using FG for more flexibility and improved performance in parallel programs. In 19th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2005.
6. R. Dementiev. Algorithm Engineering for Large Data Sets. PhD thesis, Universität des Saarlandes, 2006.
7. R. Dementiev, J. Kärkka7die;inen, J. Mehnert, and P. Sanders.Better external memory suffix array construction. In Proceedings of the SeventhWorkshop on Algorithm Engineering and Experiments (ALENEX), pages 86-97, 2005.
8. R. Dementiev, L. Kettner, and P. Sanders. STXXL: standard template library for XXL data sets. Software: Practice and Experience, 38(6):589-637, 2008.
9. R. Dementiev and P. Sanders. Asynchronous parallel disk sorting. In 15th ACM Symposium on Parallelism in Algorithms and Architectures, pages 138-148, 2003.
10. Intel Threading Building Blocks website. http://osstbb.intel.com/.
11. P. J. Plauger, A. A. Stepanov, M. Lee, and D. R. Musser. The C++ Standard Template Library. Prentice-Hall, 2000.
12. P. Sanders. Fast priority queues for cached memory. ACM Journal of Experimental Algorithmics, 5, 2000.
13. J. Singler, P. Sanders, and F. Putze. The Multi-Core Standard Template Library. In Euro-Par: Parallel Processing, volume 4641 of LNCS, pages 682-694, 2007.
14. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory, I/II. Algorithmica, 12(2/3):110-169, 1994.