Abstract
In this paper, we study the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [9] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optimize processor register usage in embedded systems. Our storage optimization problem being NP-complete [8], solving an exact integer linear programming formulation is too expensive in practice. In this article, we propose an efficient two-steps heuristic using model’s properties that allows fast resolution times while providing nearly optimal results. This method includes the resolution of a integer linear program with a totally unimodular constraints matrix in first step, then the resolution of a linear assignment problem. Our solution has been implemented and included inside a compiler for embedded processors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
de Dinechin, B.D.: Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1996. LNCS, vol. 1239, pp. 231–245. Springer, Heidelberg (1997)
Hanen, C., Munier, A.: A Study of the Cyclic Scheduling Problem on Parallel Processors. Discrete Applied Mathematics 57(2-3), 167–192 (1995)
Eichenberger, A.E., Davidson, E.S., Abraham, S.G.: Minimizing Register Requirements of a Modulo Schedule via Optimum Stage Scheduling. International Journal of Parallel Programming 24(2), 103–132 (1996)
Fimmel, D., Muller, J.: Optimal Software Pipelining Under Resource Constraints. International Journal of Foundations of Computer Science (IJFCS) 12(6), 697–718 (2001)
Kuhn, H.W.: The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Janssen, J.: Compilers Strategies for Transport Triggered Architectures. PhD thesis, Delft University, Netherlands (2001)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)
Touati, S.-A.-A.: Register Pressure in Instruction Level Parallelisme. PhD thesis, Université de Versailles, France (June 2002), ftp.inria.fr/INRIA/Projects/a3/touati/thesis
Touati, S.-A.-A.: Periodic Task Scheduling under Storage Constraints. In: Proceedings of the Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2007) (August 2007)
Touati, S.-A.-A., Eisenbeis, C.: Early Periodic Register Allocation on ILP Processors. Parallel Processing Letters 14(2) (June 2004)
Strout, M.M., Carter, L., Ferrante, J., Simon, B.: Schedule-Independent Storage Mapping for Loops. ACM SIG-PLAN Notices 33(11), 24–33 (1998)
Thies, W., Vivien, F., Sheldon, J., Amarasinghe, S.: A Unified Framework for Schedule and Storage Optimization. ACM SIGPLAN Notices 36(5), 232–242 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deschinkel, K., Touati, SAA. (2008). Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)