Abstract
This paper presents a functional model for timing analysis by abstract interpretation, used for estimation of worst-case execution times (WCET) in multicore architectures using a denotational semantics. The objective aims at surpassing the intrinsic computational complexity of timing analysis of multiple processing units sharing common resources. For this purpose, we propose a novel application of latency-rate (\(\mathcal{LR}\)) servers, phrased in terms of abstract interpretation, to achieve timing compositionality on requests to shared resources. The soundness of the approach is proven with respect to a calculational fixpoint semantics for multicores that is able to express all possible ways in which a shared resource can be accessed. Experimental results show that the loss in precision introduced by the \(\mathcal{LR}\) server model is about 10% on average and is fairly compensated by the gain in analysis time, which is above 99%. The system is implemented in Haskell, taking advantages of the declarative features of the language for a simpler and more robust specification of the underlying concepts.
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
Akesson, B., Hansson, A., Goossens, K.: Composable resource sharing based on latency-rate servers. In: Proc. DSD (2009)
Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Pottosin, I.V., Bjorner, D., Broy, M. (eds.) FMP&TA 1993. LNCS, vol. 735, pp. 128–141. Springer, Heidelberg (1993)
Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Elec. Notes in Theoretical Computer Science, 6 (1997)
Cousot, P.: The calculational design of a generic abstract interpreter. In: Broy, M., Steinbrüggen, R. (eds.) Calculational System Design. NATO ASI Series F. IOS Press, Amsterdam (1999)
Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. Journal of Logic Programming 13(2-3) (1992)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. POPL (1977)
Cullmann, C., Ferdinand, C., Gebhard, G., Grund, D., Maiza, C., Reineke, J., Triquet, B., Wilhelm, R.: Predictability considerations in the design of multi-core embedded systems. In: Proc. ERTS (2010)
Engblom, J., Ermedahl, A., Stappert, F.: A worst-case execution-time analysis tool prototype for embedded real-time systems. In: Proc. RT-TOOLS (2001)
Kelter, T., Falk, H., Marwedel, P., Chattopadhyay, S., Roychoudhury, A.: Bus-aware multicore wcet analysis through tdma offset bounds. In: Proc. ECRTS (2011)
Kleene, S.C.: Introduction to metamathematics. Van Nostrand (1952)
Mälardalen WCET research group, http://www.mrtc.mdh.se/projects/wcet
Rodrigues, V., Pedroso, J.P., Florido, M., de Sousa, S.M.: Certifying execution time. In: Peña, R., van Eekelen, M., Shkaravska, O. (eds.) FOPARA 2011. LNCS, vol. 7177, pp. 108–125. Springer, Heidelberg (2012)
Rodrigues, V.: A declarative compositional timing analysis for multicores using the latency-rate abstraction. Technical report, LIACC, Faculty of Computer Science, University of Porto (2012), http://www.dcc.fc.up.pt/~vitor.rodrigues
Rodrigues, V., Florido, M., de Sousa, S.M.: A functional approach to worst-case execution time analysis. In: Kuchen, H. (ed.) WFLP 2011. LNCS, vol. 6816, pp. 86–103. Springer, Heidelberg (2011)
Schneider, J., Ferdinand, C.: Pipeline behavior prediction for superscalar processors by abstract interpretation. ACM SIGPLAN Not. 34 (1999)
Shah, H., Knoll, A., Akesson, B.: Bounding SDRAM Interference: Detailed Analysis vs. Latency-Rate Analysis. In: Proc. DATE, pp. 308–313 (2013)
Stiliadis, D., Varma, A.: Latency-rate servers: a general model for analysis of traffic scheduling algorithms. IEEE/ACM T. Netw. 6(5) (1998)
Stoy, J.E.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press (1977)
Wiggers, M., Bekooij, M., Smit, G.: Modelling run-time arbitration by latency-rate servers in dataflow graphs. In: Proc. SCOPES, pp. 11–22 (2007)
Wilhelm, R.: Why ai + ilp is good for wcet, but mc is not, nor ilp alone. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 309–322. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodrigues, V., Akesson, B., Melo de Sousa, S., Florido, M. (2013). A Declarative Compositional Timing Analysis for Multicores Using the Latency-Rate Abstraction. In: Sagonas, K. (eds) Practical Aspects of Declarative Languages. PADL 2013. Lecture Notes in Computer Science, vol 7752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45284-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-45284-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45283-3
Online ISBN: 978-3-642-45284-0
eBook Packages: Computer ScienceComputer Science (R0)