Scalable and Modular Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Scalable and Modular Scheduling


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 modular scheduling Second, one can use projection methods for solving linear programs incrementatly. This is specially efficient if the dependence graph is sparse.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5180.pdf (219.04 Ko) Télécharger le fichier

Dates and versions

inria-00071408 , version 1 (23-05-2006)


  • HAL Id : inria-00071408 , version 1


Paul Feautrier. Scalable and Modular Scheduling. RR-5180, INRIA. 2004. ⟨inria-00071408⟩
73 View
216 Download


Gmail Facebook Twitter LinkedIn More