Links

Tools

Export citation

Search in Google Scholar

Dynamic scheduling for dependence loops on heterogeneous clusters

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Question mark in circle
Preprint: policy unknown
Question mark in circle
Postprint: policy unknown
Question mark in circle
Published version: policy unknown

Abstract

Distributed computing systems are a viable and less expensive alternative to parallel com- puters. However, concurrent programming methods in distributed systems have not been studied as extensively as for parallel computers. In the pas t, a variety of dynamic scheduling schemes suitable for loops with independent iterations on heterogeneous computer clusters have been obtained and studied. However, no study of dynamic schemes for loops with iteration dependencies has been reported so far. In this work we study the problem of scheduling loops with iteration dependencies for heterogeneous clusters. The iteration de- pendencies incur an extra degree of difficulty and make the de velopment of such schemes quite a challenge. We extend three well known dynamic schemes (CSS, TSS and DTSS) by introducing synchronization points at certain interval s so that processors compute in pipelined fashion. Our scheme is called dynamic multi-phase scheduling (DMP S) and we apply it to loops with iteration dependencies. We implemented our new scheme on a net- work of heterogeneous computers and studied its performance. Through extensive testing on four real-life applications we show that the proposed method is efficient for parallelizing nested loops with dependencies on heterogeneous systems. Results show that DTSS gives a speedup of 3-5 out of the ideal 7, in all cases, when applied to dependence loops.