Skip to Main content Skip to Navigation

Scalable and Modular Scheduling.

Abstract : Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods for automatic parallelization. A schedule gives a blueprint for constructing a synchronous program, suitable for an ASIC or VLIW processor. However, constructing a schedule entails solving a large linear program. Even if one accept the (experimental) fact that the Simplex is almost always polynomial, the scheduling time is of the order of a large power of the program size. Hence, the method does not scale well. The present paper proposes two methods for improving the situation. Firstly, a big program can be divided in smaller units (processes) which can be scheduled separately. This is \em modular scheduling Second, one can use projection methods for solving linear programs incrementatly. This is specially efficient if the dependence graph is sparse.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:06:33 AM
Last modification on : Saturday, September 11, 2021 - 3:19:19 AM


Files produced by the author(s)


  • HAL Id : hal-02101797, version 1



Paul Feautrier. Scalable and Modular Scheduling.. [Research Report] LIP RR-2004-19, Laboratoire de l'informatique du parallélisme. 2004, 2+17p. ⟨hal-02101797⟩



Record views


Files downloads