Block Scheduling of Iterative Algorithms and Graph-Level Priority Scheduling in a Simulated Data-Flow Multiprocessor

  • Authors:
  • P. Evripidou;J. L. Gaudiot

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Iterative methods for solving linear systems are discussed. Although these methods areinherently highly sequential, it is shown that much parallelism could be exploited in adata-flow system by scheduling the iterative part of the algorithms in blocks and bylooking ahead across several iterations. This approach is general and will apply to otheriterative and loop-based problems. It is also demonstrated by simulation that relyingsolely on data-driven scheduling of parallel and unrolled loops results in low resourceutilization and poor performance. A graph-level priority scheduling mechanism has beendeveloped that greatly improves resource utilization and yields higher performance.