Compile-Time Analysis and Specialization of Clocks in Concurrent Programs

Authors:
Nalini Vasudevan;Olivier Tardieu;Julian Dolby;Stephen A. Edwards
Affiliations:
Department of Computer Science, Columbia University, New York, USA;IBM T.J. Watson Research Center, New York, USA;IBM T.J. Watson Research Center, New York, USA;Department of Computer Science, Columbia University, New York, USA
Venue:
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 12
Cited 3

Communicating sequential processes

Communicating sequential processes
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Typestate: A programming language concept for enhancing software reliability

IEEE Transactions on Software Engineering
A parallel java grande benchmark suite

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
An Algorithm for Analyzing Communicating Processes

Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
X10: an object-oriented approach to non-uniform cluster computing

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Specialization of CML message-passing primitives

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
May-happen-in-parallel analysis of X10 programs

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
X10: concurrent programming for modern architectures

Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Type inference for locality analysis of distributed data structures

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming

Concurrency and Communication: Lessons from the SHIM Project

SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Distributed generalized dynamic barrier synchronization

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Unifying barrier and point-to-point synchronization in OpenMP with phasers

IWOMP'11 Proceedings of the 7th international conference on OpenMP in the Petascale era

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clocks are a mechanism for providing synchronization barriers in concurrent programming languages. They are usually implemented using primitive communication mechanisms and thus spare the programmer from reasoning about low-level implementation details such as remote procedure calls and error conditions. Clocks provide flexibility, but programs often use them in specific ways that do not require their full implementation. In this paper, we describe a tool that mitigates the overhead of general-purpose clocks by statically analyzing how programs use them and choosing optimized implementations when available. We tackle the clock implementation in the standard library of the X10 programming language--a parallel, distributed object-oriented language. We report our findings for a small set of analyses and benchmarks. Our tool only adds a few seconds to analysis time, making it practical to use as part of a compilation chain.