The Ohio Society of CPAs
Many existing sequential components, libraries, and applications will need to be re-engineered for parallelism. This paper proposes a dynamic analysis of sequential Java programs that helps a programmer to understand bottlenecks for parallelism. The analysis measures the parallelism available in the program by considering a hypothetical parallel execution in which the code within a method executes sequentially, but each caller will execute in parallel with its callees. A best case scenario is assumed: every statement executes as early as possible, as long as all dependences from the sequential program are satisfied.