Cost Optimality and Predictability of Parallel Programming with Skeletons

  • Holger Bischof
  • Sergei Gorlatch
  • Emanuel Kitzelmann
Conference paper

DOI: 10.1007/978-3-540-45209-6_97

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2790)
Cite this paper as:
Bischof H., Gorlatch S., Kitzelmann E. (2003) Cost Optimality and Predictability of Parallel Programming with Skeletons. In: Kosch H., Böszörményi L., Hellwagner H. (eds) Euro-Par 2003 Parallel Processing. Euro-Par 2003. Lecture Notes in Computer Science, vol 2790. Springer, Berlin, Heidelberg

Abstract

Skeletons are reusable, parameterized components with well-defined semantics and pre-packaged efficient parallel implementation. This paper develops a new, provably cost-optimal implementation of the DS (double-scan) skeleton for the divide-and-conquer paradigm. Our implementation is based on a novel data structure called plist (pointed list); implementation’s performance is estimated using an analytical model. We demonstrate the use of the DS skeleton for parallelizing a tridiagonal system solver and report experimental results for its MPI implementation on a Cray T3E and a Linux cluster: they confirm the performance improvement achieved by the cost-optimal implementation and demonstrate its good predictability by our performance model.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Holger Bischof
    • 1
  • Sergei Gorlatch
    • 1
  • Emanuel Kitzelmann
    • 1
  1. 1.Technical University of BerlinGermany

Personalised recommendations