Compiler techniques for high performance sequentially consistent java programs

  • Authors:
  • Zehra Sura;Xing Fang;Chi-Leung Wong;Samuel P. Midkiff;Jaejin Lee;David Padua

  • Affiliations:
  • IBM Watson Research Center, Yorktown Heights, NY;Purdue University, West Lafayette, IN;University of Illinois, Urbana, IL;Purdue University, West Lafayette, IN;Seoul National University, Seoul, Korea;University of Illinois, Urbana, IL

  • Venue:
  • Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The rise of Java, C#, and other explicitly parallel languages has increased the importance of compiling for different software memory models. This paper describes co-operating escape, thread structure, and delay set analyses that enable high performance for sequentially consistent programs.We compare the performance of a set of Java programs compiled for sequential consistency (SC) with the performance of the same programs compiled for weak consistency. For SC, we observe a slowdown of 10% on average for an architecture based on the Intel Xeon processor, and 26% on average for an architecture based on the IBM Power3.