Loop scheduling for heterogeneity

  • Authors:
  • M. Cierniak;Wei Li;M. J. Zaki

  • Affiliations:
  • -;-;-

  • Venue:
  • HPDC '95 Proceedings of the 4th IEEE International Symposium on High Performance Distributed Computing
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we study the problem of scheduling parallel loops at compile-time for a heterogeneous network of machines. We consider heterogeneity in three aspects of parallel programming: program, processor and network. A heterogeneous program has parallel loops with different amount of work in each iteration; heterogeneous processors have different speeds; and a heterogeneous network has different cost of communication between processors. We propose a simple yet comprehensive model for use in compiling for a network of processors, and develop compiler algorithms for generating optimal and sub-optimal schedules of loops for load balancing, communication optimizations and network contention. Experiments show that a significant improvement of performance is achieved using our techniques.