Abstract
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of interaction based on cooperative threads whose execution proceeds in synchronous rounds called instants. Our contribution is a system of compositional static analyses to guarantee that each instant terminates and to bound the size of the values computed by the system as a function of the size of its parameters at the beginning of the instant.
Our method generalises an approach designed for first-order functional languages that relies on a combination of standard termination techniques for term rewriting systems and an analysis of the size of the computed values based on the notion of quasi-interpretation. These two methods can be combined to obtain an explicit polynomial bound on the resources needed for the execution of the system during an instant.
This work was partly supported by ACI Sécurité Informatique, project CRISS.
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.
Similar content being viewed by others
References
Amadio, R., Dal-Zilio, S.: Resource control for synchronous cooperative threads. Research Report LIF 22-2004 (2004)
Amadio, R., Coupet-Grimal, S., Dal-Zilio, S., Jakubiec, L.: A functional scenario for bytecode verification of resource bounds. Research Report LIF 17-2004 (2004)
Amadio, R.: Max-plus quasi-interpretations. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol. 2701, pp. 31–45. Springer, Heidelberg (2003)
Armstrong, J., Virding, R., Wikström, C., Williams, M.: Concurrent Programming in Erlang. Prentice-Hall, Englewood Cliffs (1996)
Boudol, G.: ULM: A core programming model for global computing. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 234–248. Springer, Heidelberg (2004)
Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the poly-time functions. Computational Complexity 2, 97–110 (1992)
Boussinot, F., De Simone, R.: The SL Synchronous Language. IEEE Trans. on Software Engineering 22(4), 256–266 (1996)
Berry, G., Gonthier, G.: The Esterel synchronous programming language. Science of computer programming 19(2), 87–152 (1992)
Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: On lexicographic termination ordering with space bound certifications. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, p. 482. Springer, Heidelberg (2001)
Baader, F., Nipkow, T.: Term rewriting and all that. CUP (1998)
Baillot, P., Mogbil, V.: Soft lambda-calculus: A language for polynomial time computation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 27–41. Springer, Heidelberg (2004)
Carriero, N., Gelernter, D.: Linda in Context. CACM 32(4), 444–458 (1989)
Cobham, A.: The intrinsic computational difficulty of functions. In: Proc. Logic, Methodology, and Philosophy of Science II. North-Holland, Amsterdam (1965)
Hofmann, M.: The strength of non size-increasing computation. In: Proc. POPL. ACM Press, New York (2002)
Jones, N.: Computability and complexity, from a programming perspective. MIT-Press, Cambridge (1997)
Leivant, D.: Predicative recurrence and computational complexity i: word recurrence and poly-time. In: Clote, Remmel (eds.) Feasible mathematics II, Birkhäuser, pp. 320–343 (1994)
Marion, J.-Y.: Complexité implicite des calculs, de la théorie à la pratique. Habilitation à diriger des recherches, Université de Nancy (2000)
Odersky, M.: Functional nets. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, p. 1. Springer, Heidelberg (2000)
Ousterhout, J.: Why threads are a bad idea (for mot purposes). In: USENIX Technical Conference (1996) (Invited talk)
Puschner, P., Burns, A. (eds.): Real time systems. Worst-Case Execution Time Analysis, vol. 18(2/3) (speacial issue 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
Amadio, R.M., Dal Zilio, S. (2004). Resource Control for Synchronous Cooperative Threads. In: Gardner, P., Yoshida, N. (eds) CONCUR 2004 - Concurrency Theory. CONCUR 2004. Lecture Notes in Computer Science, vol 3170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28644-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-28644-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22940-7
Online ISBN: 978-3-540-28644-8
eBook Packages: Springer Book Archive