Profile-Guided Composition

  • Jesper Andersson
  • Morgan Ericsson
  • Christoph Kessler
  • Welf Löwe
Conference paper

DOI: 10.1007/978-3-540-78789-1_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4954)
Cite this paper as:
Andersson J., Ericsson M., Kessler C., Löwe W. (2008) Profile-Guided Composition. In: Pautasso C., Tanter É. (eds) Software Composition. SC 2008. Lecture Notes in Computer Science, vol 4954. Springer, Berlin, Heidelberg

Abstract

We present an approach that generates context-aware, optimized libraries of algorithms and data structures. The search space contains all combinations of implementation variants of algorithms and data structures including dynamically switching and converting between them. Based on profiling, the best implementation for a certain context is precomputed at deployment time and selected at runtime. In our experiments, the profile-guided composition outperforms the individual variants in almost all cases.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jesper Andersson
    • 1
  • Morgan Ericsson
    • 1
  • Christoph Kessler
    • 2
  • Welf Löwe
    • 1
  1. 1.Software Technology GroupMSI, Växjö UniversitySweden
  2. 2.Programming Environments LaboratoryIDA, Linköping UniversitySweden

Personalised recommendations