A path-based method of parallelizing C++ programs
ACM SIGPLAN Notices1994Vol. 29(2), pp. 19–24
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.
Related Papers
- → Exploiting task and data parallelism on a multicomputer(1993)135 cited
- → Exploiting task and data parallelism on a multicomputer(1993)60 cited
- → Software Carry-Save: A Case Study for Instruction-Level Parallelism(2003)9 cited
- → Optimization of data/control conditions in task graphs(2006)10 cited
- → The potential of exploiting coarse-grain task parallelism from sequential programs(1997)