Autotuning Skeleton-Driven Optimizations for Transactional Worklist Applications

Luis Fabricio Wanderley Goes, Nikolas Ioannou, Polychronis Xekalakis, Murray Cole, Marcelo Cintra

Research output: Contribution to journalArticlepeer-review


Skeleton or pattern-based programming allows parallel programs to be expressed as specialized instances of generic communication and computation patterns. In addition to simplifying the programming task, such well structured programs are also amenable to performance optimizations during code generation and also at runtime. In this paper, we present a new skeleton framework that transparently selects and applies performance optimizations in transactional worklist applications. Using a novel hierarchical autotuning mechanism, it dynamically selects the most suitable set of optimizations for each application and adjusts them accordingly. Our experimental results on the STAMP benchmark suite show that our skeleton autotuning framework can achieve performance improvements of up to 88 percent, with an average of 46 percent, over a baseline version for a 16-core system and up to 115 percent, with an average of 56 percent, for a 32-core system. These performance improvements match or even exceed those obtained by a static exhaustive search of the optimization space.
Original languageEnglish
Pages (from-to)2205-2218
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number12
Publication statusPublished - Dec 2012


  • Concurrent programming
  • parallel patterns and application-transparent adaptation
  • transactional memory


Dive into the research topics of 'Autotuning Skeleton-Driven Optimizations for Transactional Worklist Applications'. Together they form a unique fingerprint.

Cite this