Details

Autor(en) / Beteiligte

• Ravindra, D. V.
• Srikant, Y. N.
• Shukla, Uday
• Sahni, Sartaj
• Prasanna, Viktor K.

Titel

Improved Preprocessing Methods for Modulo Scheduling Algorithms

Ist Teil von

• High Performance Computing — HiPC 2002, 2002, p.485-494

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2002

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Instruction scheduling with an automaton-based resource conflict model is well-established for normal scheduling. Such models have been generalized to software pipelining in the modulo-scheduling framework. One weakness with existing methods is that a distinct automaton must be constructed for each combination of a reservation table and initiation interval. In this work, we present a different approach to model conflicts. We construct one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling. The basic premise of the construction is to move away from the Proebsting-Fraser model of conflict automaton to the Müller model of automaton modelling issue sequences. The latter turns out to be useful and efficient in this situation. Having constructed this automaton, we show how to improve the estimate of resource constrained initiation interval. Such a bound is always better than the average-use estimate. We show that our bound is safe: it is always lower than the true initiation interval. This use of the automaton is orthogonal to its use in modulo-scheduling. Once we generate the required information during pre-processing, we can compute the lower bound for a program without any further reference to the automaton.