Abstract
In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear programs and we show that each encountered linear program can be reduced to the dual problem of an instance of the min-cost flow problem. Thus, we only need to solve instances of the much simpler min-cost flow problem during minimum-cost reachability analysis. Experimental results using Uppaal show a 70-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abdeddaim, Y., Kerbaa, A., Maler, O.: Task graph scheduling using timed automata. In: Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS (2003)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows - Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Alur, R., Dill, D.: Automata for modelling real-time systems. In: Proc. of Int. Colloquium on Algorithms, Languages and Programming, July 1990, vol. 443, pp. 322–335 (1990)
Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, p. 49. Springer, Heidelberg (2001)
Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling aircraft landings - the static case. Transportation Science 34(2), 180–197 (2000)
Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Petterson, P., Romijn, J.: Efficient guiding towards cost-optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, p. 174. Springer, Heidelberg (2001)
Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, p. 147. Springer, Heidelberg (2001)
Berkelaar, M.: (October 2003), http://www.cs.sunysb.edu/~algorith/implement/lpsolve/implement.shtml
Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 546–550. Springer, Heidelberg (1998)
Cunningham, W.H.: A network simplex method. Mathematical Programming 11, 105–106 (1976)
Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
Gruian, F., Kuchcinski, K.: Low-energy directed architecture selection and task scheduling. In: Proceedings of the 25th EuroMICRO Conference, vol. 1, pp. 296–302 (1999)
Kwok, Y.-K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing 59(3), 381–422 (1999)
Larsen, K., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of real-time systems: Compact data structure and state space reduction. In: Proc. Real-Time Systems Symposium, pp. 14–24 (1997)
Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 493. Springer, Heidelberg (2001)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer 1(1-2), 134–152 (1997)
Löbel, A.: (October 2003), http://www.zib.de/Optimization/Software/Mcf/
Rasmussen, J.I.: Priced timed automata and duality (2003), Available at http://www.cs.auc.dk/~illum/pubs/ptaduality.html
Tobita, T., Kouda, M., Kasahara, H.: Performance evaluation of minimum execution time multiprocessor scheduling algorithms using standard task graph set. In: Proc. of PDPTA 2000, pp. 745–751 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rasmussen, J.I., Larsen, K.G., Subramani, K. (2004). Resource-Optimal Scheduling Using Priced Timed Automata. In: Jensen, K., Podelski, A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2004. Lecture Notes in Computer Science, vol 2988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24730-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24730-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21299-7
Online ISBN: 978-3-540-24730-2
eBook Packages: Springer Book Archive