Limits on Speculative Module-Level Parallelism in Imperative and Object-Oriented Programs on CMP Platforms

Abstract

Abstract: This paper considers program modules, e.g. procedures, functions, and methods as the basic method to exploit speculative parallelism in existing codes. We analyze how much inherent and exploitable parallelism exist in a set of C and Java programs on a set of chip-multiprocessor architecture models, and identify what inherent program features, as well as architectural deficiencies, that limit the speedup. Our data complement previous limit studies by indicating that the programming style - object-oriented versus imperative - does not seem to have any noticeable impact on the achievable speedup. Further, we show that as few as eight processors are enough to exploit all of the inherent parallelism. However, memory-level data dependence resolution and thread management mechanisms of recent CMP proposals may impose overheads that severely limit the speedup obtained.

DOI: 10.1109/PACT.2001.953302
View Slides

Extracted Key Phrases

9 Figures and Tables

Statistics

0510'03'05'07'09'11'13'15'17
Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Warg2001LimitsOS, title={Limits on Speculative Module-Level Parallelism in Imperative and Object-Oriented Programs on CMP Platforms}, author={Fredrik Warg and Per Stenstr{\"{o}m}, booktitle={IEEE PACT}, year={2001} }