Dynamic Adaptive Scheduling in an Implementation of a Data Parallel Language

PPL Technical Report 1992

Pulication Type: Paper

Download: pdf ps

Abstract

In the execution of a parallel program, it is desirable for all processors dedicated to the program to be kept fully utilized. However, a program that employs a lot of message-passing might spend a considerable amount of time waiting for messages to arrive. In order to mitigate this efficiency loss, instead of blocking execution for every message, we would rather overlap that communication time with other computation. This paper presents an approach to accomplishing this overlap in a systematic manner when compiling a data parallel language targeted for MIMD computers.

Research Areas

Text Ref

Edward Kornkven and Laxmikant Kale, "Dynamic Adaptive Scheduling in an 
Implementation of a Data Parallel Language", Parallel Programming Laboratory, 
Department of Computer Science, University of Illinois, October 1992.

BibTex

@TECHREPORT{DP_TECH92,
        author = "Edward Kornkven and Laxmikant Kale",
        title = "Dynamic Adaptive Scheduling in an Implementation
            of a Data Parallel Language",
        institution = "Parallel Programming Laboratory, Department of
                        Computer Science, University of Illinois",
        month = "October",
        year = "1992",
        group = Y,
}