No abstract

No abstract

We present an experimental tool for identifying coarse-grained parallelism in Pascal programs. The tool produces a net description of a sequential program where statements that could potentially be executed in parallel have been identified. Conventional control and data dependence analysis is used to map the statements in a sequential program into execution steps in a dependency net. We introduce the concept of dependency strength and show how it is used to guide the grouping of statements. A simulation based on laws adapted from electrostatics and mechanics is performed where the statements are allowed to attract and repel one another to affect their position within the dependency net. Statements that must be executed sequentially are coalesced together. Several translation parameters can be modified and their effects on the resulting net descriptions can be studied.

No abstract

No abstract