Efficient Scheduling of Strict Multithreaded Computations

In this paper we study the problem of efficiently scheduling a wide class of multithreaded computations, called strict; that is, computations in which all dependencies from a thread go to the thread's ancestors in the computation tree. Strict multithreaded computations allow the limited use of synchronization primitives. We present the first fully distributed scheduling algorithm which applies to any strict multithreaded computation. The algorithm is asynchronous, on-line, and follows the work-stealing paradigm. We prove that our algorithm is efficient not only in terms of its memory requirements and its execution time, but also in terms of its communication complexity. Our analysis applies to both shared and distributed memory machines.

More specifically, the expected execution time of our algorithm is O(T ₁ /P + hT _∈fty ) , where T ₁ is the minimum serial execution time, T _∈fty is the minimum execution time with an infinite number of processors, P is the number of processors, and h is the maximum ``distance'' in the computation tree between any two threads that need to communicate. Furthermore, the total space required during the execution is O(S ₁ P) , where S ₁ is the space required by a serial computer to execute the computation, while the expected communication cost incurred by our algorithm is O(PhT _∈fty (1+n _d ) S _max ) , where n _d is the maximum number of dependencies entering any thread and S _max is the largest amount of storage needed for the execution of any specific thread of the computation. Our communication complexity bound is the first nontrivial bound ever proved for the model of strict parallel programming.

Authors and Affiliations

1. Max-Planck Institut für Informatik, Im Stadtwald, Saarbrücken, Germany faturu@mpi-sb.mpg.de , , , , , , DE

   P. Fatourou

2. Department of Computer Engineering and Informatics, University of Patras, Patras, Greece and Computer Technology Institute, Patras, Greece spirakis@cti.gr, , , , , , GR

   P. Spirakis

Received January 20, 1999, and in revised form March 26, 1999, and November 30, 1999.

Reprints and permissions