Hostname: page-component-848d4c4894-xm8r8 Total loading time: 0 Render date: 2024-06-17T16:52:24.206Z Has data issue: false hasContentIssue false
  • English
  • Français

How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations

Published online by Cambridge University Press:  04 July 2013

Sid-Ahmed-Ali Touati ,
Sébastien Briais  and
Karine Deschinkel
Sid-Ahmed-Ali Touati
Affiliation:
Universitéde Nice Sophia-Antipolis, France.. Sid.Touati@unice.fr; Sid.Touati@inria.fr
Sébastien Briais
Affiliation:
Université de Versailles Saint-Quentin-en-Yvelines, France
Karine Deschinkel
Affiliation:
Université de Franche-Comté, France
Get access

Abstract

Usual periodic scheduling problems deal with precedence constraints having non-negative latencies. This seems a natural way for modelling scheduling problems, since task delays are generally non-negative quantities. However, in some cases, we need to consider edges latencies that do not only model task latencies, but model other precedence constraints. For instance in register optimisation problems devoted to optimising compilation, a generic machine or processor model can allow considering access delays into/from registers. Edge latencies may be then non-positive leading to a difficult scheduling problem in presence of resources constraints. This research result is related to the problem of periodic scheduling with storage requirement optimisation; its aims is to solve the practical problem of register optimisation in optimising compilation. We show that pre-conditioning a data dependence graph (DDG) to satisfy register constraints before periodic scheduling under resources constraints may create circuits with non-positive distances, resulted from the acceptance of non-positive edge latencies. As a compiler construction strategy, it is forbidden to allow the creation of circuits with non-positive distances during the compilation flow, because such DDG circuits do not guarantee the existence of a valid instruction schedule under resource constraints. We study two solutions to avoid the creation of these problematic circuits. A first solution is reactive, it tolerates the creation of non-positive circuit in a first step, and if detected in a further check step, makes a backtrack to eliminate them. A second solution is proactive, it prevents the creation of non-positive circuits in the DDG during the register optimisation process. It is based on shortest path equations which define a necessary and sufficient condition to free any DDG from these problematic circuits. Then we deduce a linear program accordingly. We have implemented our solutions and we present successful experimental results.

Keywords

Periodic schedulinglinear programmingstorage constraintsregister constraintscode optimisation
Type
Research Article
Information
RAIRO - Operations Research , Volume 47 , Issue 3 , July 2013 , pp. 223 - 249
Copyright
© EDP Sciences, ROADEF, SMAI, 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

F. Bouchez, A. Darte, C. Guillon and F. Rastello, Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove?, in International Workshop on Languages and Compilers for Parallel Computing (LCPC’06), Springer Lect. Notes Comput. Sci. (2006) 283–298.
F. Bouchez, A. Darte and F. Rastello, On the Complexity of Register Coalescing, in International Symposium on Code Generation and Optimization (CGO’07). IEEE Computer Society Press (2007) 102–114.
F. Bouchez, A. Darte and F. Rastello, On the complexity of spill everywhere under SSA form, in ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES’07). ACM Press (2007) 103–112.
S. Briais, S.-A.-A. Touati and K. Deschinkel, Ensuring Lexicographic-Positive Data Dependence Graphs in the SIRA Framework. Technical Report HAL-INRIA-00452695, University of Versailles Saint-Quentin en Yvelines (2010). Research report. http://hal.archives-ouvertes.fr/inria-00452695.
T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company (2001).
B. Dupont de Dinechin, Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates, in LCPC ’96: Proceedings of the 9th International Workshop on Languages and Compilers for Paral. Comput., London, UK. Springer-Verlag (1997) 231–245.
de Werra, D., Eisenbeis, C., Lelait, S. and Marmol, B., On a graph-theoretical model for cyclic register allocation. Discrete Appl. Math. 93 (1999) 191–203. Google Scholar
Deschinkel, K., Touati, S.-A.-Ali and Briais, S., SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling. J. Combin. Optim. 22 (2011) 819–844. Google Scholar
Eichenberger, A.E. and Davidson, E.S., Efficient formulation for optimal modulo schedulers. SIGPLAN Notice 32 (1997) 194–205. Google Scholar
Fimmel, D. and Muller, J., Optimal Software Pipelining Under Resource Constraints. Int. J. Found. Comput. Sci. (IJFCS) 12 (2001) 697–718. Google Scholar
R. Govindarajan, H. Yang, J.N. Amaral, C. Zhang and G.R. Gao, Minimum Register Instruction Sequencing to Reduce Register Spills in Out-of-Order Issue Superscalar Architecture. IEEE Trans. Comput. (2003) 4–20.
J. Janssen, Compilers Strategies for Transport Triggered Architectures. Ph.D. thesis, Delft University, Netherlands (2001).
Kuhn, H.W., The Hungarian Method for the assignment problem. Nav. Res. Logist. Q. 2 (1955) 83–97. Google Scholar
Lee, T.-Eog and Park, S.-Ho, An extended event graph with negative places and tokens for time window constraints. IEEE Trans. Autom. Sci. Eng. 2 (2005) 319–332. Google Scholar
Leiserson, C.E. and Saxe, J.B., Retiming Synchronous Circuitry. Algorithmica 6 (1991) 5–35. Google Scholar
Munier, A., A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule. J. Scheduling 14 (2011) 103–117. Google Scholar
S.G. Nagarakatte and R. Govindarajan, Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation, in Compiler Construction (CC), vol. 4420, Lecture Notes in Computer Science, Braga, Portugal (2007) 126–140. Springer.
J. Ruttenberg, G.R. Gao, A. Stoutchinin and W. Lichtenstein, Software Pipelining Showdown : Optimal vs. Heuristic Methods in a Production Compiler, in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implemantation, New York. ACM Press (1996) 1–11.
M. Schlansker, B. Rau and S. Mahlke, Achieving High Levels of instruction-Level Parallelism with Reduced Hardware Complexity. Technical Report HPL-96-120, Hewlet Packard (1994).
P. Sucha and Z. Hanzálek, Scheduling of Tasks with Precedence Delays and Relative Deadlines - Framework for Time-optimal Dynamic Reconfiguration of FPGAs, in IPDPS, IEEE (2006) 1–8.
Touati, S.-A.-A., Brault, F., Deschinkel, K. and de Dinechin, B.D., Efficient Spilling Reduction for Software Pipelined Loops in Presence of Multiple Register Types in Embedded VLIW Processors. ACM Trans. Embedded Comput. Syst. 10 (2011) 1–47. Google Scholar
Touati, S.-A.-A. and Eisenbeis, C., Early Periodic Register Allocation on ILP Processors. Paral. Proc. Lett. 14 (2004) 287–313. Google Scholar