A path-based method of parallelizing C++ programs

1 February 1994

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices

Vol. 29 (2) , 19-24
https://doi.org/10.1145/181748.181751

Abstract

This paper presents a path-based method for identifying parallelism in C++ programs and proposes an execution model which trades off the efficiency and parallelism. Based on the path information provided at compiler time or computed at run time, the model reduces the rollbacks while enhances the parallelism.

Keywords

PATH BASED
COMPILER TIME
PATH INFORMATION
EXECUTION MODEL
MODEL REDUCES
RUN TIME
IDENTIFYING PARALLELISM

This publication has 3 references indexed in Scilit:

A technique for summarizing data access and its use in parallelism enhancing transformations
ACM SIGPLAN Notices, 1989
An execution model for distributed object-oriented computation
ACM SIGPLAN Notices, 1988
Virtual time
ACM Transactions on Programming Languages and Systems, 1985