The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1990 vol.16)
pp: 421-431
ABSTRACT
<p>Region scheduling, a technique applicable to both fine-grain and coarse-grain parallelism, uses a program representation that divides a program into regions consisting of source and intermediate level statements and permits the expression of both data and control dependencies. Guided by estimates of the parallelism present in regions, the region scheduler redistributes code, thus providing opportunities for parallelism in those regions containing insufficient parallelism compared to the capabilities of the executing architecture. The program representation and the transformations are applicable to both structured and unstructured programs, making region scheduling useful for a wide range of applications. The results of experiments conducted using the technique in the generation of code for a reconfigurable long instruction word architecture are presented. The advantages of region scheduling over trace scheduling are discussed.</p>
INDEX TERMS
region scheduling; code generation; redistributing parallelism; fine-grain; coarse-grain parallelism; program representation; reconfigurable long instruction word architecture; trace scheduling; parallel programming; program compilers; scheduling.
CITATION
R. Gupta, M.L. Soffa, "Region Scheduling: An Approach for Detecting and Redistributing Parallelism", IEEE Transactions on Software Engineering, vol.16, no. 4, pp. 421-431, April 1990, doi:10.1109/32.54294
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool