Cyclic Staggered Scheme: A Loop Allocation Policy for DOACROSS Loops

Authors:
A. R. Hurson;J. T. Lim;K. Kavi
Affiliations:
Pennsylvania State Univ., University Park;Pennsylvania State Univ., University Park;Univ. of Texas at Arlington, Arlington
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 3
Cited 1

Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds

IEEE Transactions on Computers
Loop Allocation Scheme for Multithreaded Dataflow Computers

Proceedings of the 8th International Symposium on Parallel Processing
A Loop Allocation Policy for DOACROSS Loops

SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)

Time Stamp Algorithms for Runtime Parallelization of DOACROSS Loops with Dynamic Dependences

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

Within the scope of the multithreaded dataflow, the problem of scheduling/allocation of DOACROSS loops has been discussed and it was shown that the so-called staggered allocation offers higher performance and resource utilization than other schemes described in the literature. The staggered scheme, however, produces an unbalanced load among processors. This paper introduces an extension to the staggered scheme驴cyclic staggered scheme驴that produces a more balanced distribution of iterations among processors. The cyclic staggered scheme is simulated and its performance improvement is analyzed.