05412799 is referenced by 19 patents and cites 9 patents.

A program is first analyzed in an ideal environment that assumes infinite processing resources and zero communication latency. In this environment, the program is viewed as being comprised of a plurality of steps of computation. Each step of computation is defined as the set of instructions that have all their operands available at that time. As such, each step of computation is limited only by data dependencies. The number of instructions executed for each step of computation is counted by the data processing system. The count of instructions may be used to produce an ideal parallelism profile that produces a graphical representation of the simulation. Having established an ideal level of parallelism in the ideal environment, a more realistic profile of the maximum level of parallelism may be obtained through analusis that accounts for a finite number of processors and for communication latency. This more realistic simulation is compared to the actual level of parallelism experienced when the program is executed. Should the comparison reveal room for improvement the program is tuned to resolve problems of work distribution and contention. of processors that process tokens; comprising the step of:

Efficient data processor instrumentation for systematic program debugging and development
Application Number
Publication Number
Application Date
April 2, 1993
Publication Date
May 2, 1995
Gregory M Papadopoulos
Hamilton Brooks Smith & Reynolds
Massachusetts Institute of Technology
G06F 11/34
G06F 15/82
View Original Source