Assumption-Commitment Types for Resource Management in Virtually Timed Ambients
Pages 103 - 121
Abstract
This paper introduces a type system for resource management in the context of nested virtualization. With nested virtualization, virtual machines compete with other processes for the resources of their host environment in order to provision their own processes, which could again be virtual machines. The calculus of virtually timed ambients formalizes such resource provisioning, extending the capabilities of mobile ambients to model the dynamic creation, migration, and destruction of virtual machines. The proposed type system is compositional as it uses assumptions about the outside of a virtually timed ambient to guarantee resource provisioning on the inside. We prove subject reduction and progress for well-typed virtually timed ambients, expressing that upper bounds on resource needs are preserved by reduction and that processes do not run out of resources.
References
[1]
Goldberg RP Survey of virtual machine research IEEE Comput. 1974 7 6 34-45
[2]
Ben-Yehuda, M., et al.: The turtles project: design and implementation of nested virtualization. In: Proceedings 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2010), pp. 423–436. USENIX Association (2010)
[3]
Williams, D., Jamjoom, H., Weatherspoon, H.: The Xen-Blanket: virtualize once, run everywhere. In: Proceedings 7th European Conference on Computer Systems (EuroSys 2012), pp. 113–126. ACM (2012)
[4]
Johnsen EB, Steffen M, and Stumpf JB James P and Roggenbach M A calculus of virtually timed ambients Recent Trends in Algebraic Development Techniques 2017 Cham Springer 88-103
[5]
Cardelli L and Gordon ADMobile ambientsTheoret. Comput. Sci.20002401177-2131774252
[6]
Giovannetti E Priami C Ambient calculi with types: a tutorial Global Computing. Programming Environments, Languages, Security, and Analysis of Systems 2003 Heidelberg Springer 151-191
[7]
Petricek, T., Orchard, D., Mycroft, A.: Coeffects: a calculus of context-dependent computation. In: Jeuring, J., Chakravarty, M.M.T. (eds.) Proceedings of the International Conference on Functional Programming (ICFP 2014). ACM (2014)
[8]
Petricek T, Orchard D, and Mycroft A Fomin FV, Freivalds R, Kwiatkowska M, and Peleg D Coeffects: unified static analysis of context-dependence Automata, Languages, and Programming 2013 Heidelberg Springer 385-397
[9]
Johnsen EB, Steffen M, and Stumpf JBVirtually timed ambients: a calculus of nested virtualizationJ. Log. Algebraic Methods Program.201894109-1273726094
[10]
Albert E, Arenas P, Genaim S, Puebla G, and Zanardini D De Nicola R Cost analysis of java bytecode Programming Languages and Systems 2007 Heidelberg Springer 157-172
[11]
Albert E, Correas J, Johnsen EB, Pun VKI, and Román-Díez GParallel cost analysisACM Trans. Comput. Log.201819431:1-31:373890928
[12]
Milner R and Sangiorgi D Kuich W Barbed bisimulation Automata, Languages and Programming 1992 Heidelberg Springer 685-695
[13]
Merro M and Zappa Nardelli FBehavioral theory for mobile ambientsJ. ACM2005526961-10232179552
[14]
Cardelli L, Ghelli G, and Gordon ADTypes for the ambient calculusInf. Comput.20021772160-1941945252
[15]
Johnsen EB, Steffen M, Stumpf JB, and Tveito L Fischer B and Uustalu T Checking modal contracts for virtually timed ambients Theoretical Aspects of Computing – ICTAC 2018 2018 Cham Springer 252-272
[16]
Gordon AD V for virtual Electr. Notes Theoret. Comput. Sci. 2006 162 177-181
[17]
Johnsen EB, Schlatte R, and Tapia Tarifa SL Integrating deployment architectures and resource consumption in timed object-oriented models J. Logic Algebraic Methods Program. 2015 84 1 67-91
[18]
Albert E et al. Formal modeling and analysis of resource management for cloud architectures: an industrial case study using Real-Time ABS J. Serv.-Oriented Comput. Appl. 2014 8 4 323-339
[19]
Johnsen EB, Hähnle R, Schäfer J, Schlatte R, and Steffen M Aichernig BK, de Boer FS, and Bonsangue MM ABS: a core language for abstract behavioral specification Formal Methods for Components and Objects 2011 Heidelberg Springer 142-164
[20]
Berger, M.: Towards Abstractions for Distributed Systems. Ph.D. thesis, University of London, Imperial College (2004)
[21]
Prisacariu, C.: Timed distributed pi-calculus. In: Modelling and Verifying of Parallel Processes (MOVEP06), pp. 348–354 (2006)
[22]
Aman B and Ciobanu G Jones CB, Liu Z, and Woodcock J Mobile ambients with timers and types Theoretical Aspects of Computing – ICTAC 2007 2007 Heidelberg Springer 50-63
[23]
Paun G, Rozenberg G, and Salomaa A The Oxford Handbook of Membrane Computing 2010 Oxford Oxford University Press
[24]
Cavaliere M and Sburlan D Mauri G, Păun G, Pérez-Jiménez MJ, Rozenberg G, and Salomaa A Time–independent P systems Membrane Computing 2005 Heidelberg Springer 239-258
[25]
Lee I, Philippou A, and Sokolsky OResources in process algebraJ. Logic Algebraic Program.200772198-1222331071
[26]
Philippou A, Lee I, and Sokolsky OPADS: an approach to modeling resource demand and supply for the formal analysis of hierarchical schedulingTheor. Comput. Sci.201241312-202894652
[27]
Mousavi, M.R., Reniers, M.A., Basten, T., Chaudron, M.R.V.: PARS: a process algebraic approach to resources and schedulers. In: Alexander, M., Gardner, W. (eds.) Process Algebra for Parallel and Distributed Processing. Chapman and Hall/CRC (2008)
[28]
Bidinger P and Stefani J-B Najm E, Nestmann U, and Stevens P The Kell calculus: operational semantics and type system Formal Methods for Open Object-Based Distributed Systems 2003 Heidelberg Springer 109-123
[29]
Honda K Best E Types for dyadic interaction CONCUR’93 1993 Heidelberg Springer 509-523
[30]
Orchard, D., Yoshida, N.: Effects as sessions, sessions as effects. In: POPL 2016. ACM Press (2016)
[31]
Garralda, P., Compagnoni, A., Dezani-Ciancaglini, M.: BASS: boxed ambients with safe sessions. In Maher, M. (ed.) PPDP 2006, pp. 61–72. ACM Press (2006)
[32]
Amtoft T Flow-sensitive type systems and the ambient calculus Higher-Order Symb. Comput. 2008 21 4 411-442
[33]
Igarashi A and Kobayashi N Resource usage analysis ACM Trans. Program. Lang. Syst. 2005 27 2 264-313
[34]
Kobayashi, N., Suenaga, K., Wischik, L.: Resource usage analysis for the -calculus. Log. Methods Comput. Sci. 2(3) (2006)
[35]
Kobayashi N and Sangiorgi D A hybrid type system for lock-freedom of mobile processes ACM Trans. Program. Lang. Syst. 2010 32 5 16:1-16:49
[36]
Abadi M and Lamport L Conjoining specifications ACM Trans. Program. Lang. Syst. 1995 17 3 507-534
[37]
Jones CB Tentative steps towards a development method for interfering programs ACM Trans. Program. Lang. Syst. 1983 5 4 596-619
[38]
Misra J and Chandy KMProofs of networks of processesIEEE Trans. Softw. Eng.19817417-426625793
[39]
Ábrahám E, Grabe I, Grüner A, and Steffen MBehavioral interface description of an object-oriented language with futures and promisesJ. Logic Algebraic Program.2009787491-5182559844
[40]
Ábrahám E, Grüner A, and Steffen M Beckmann A, Berger U, Löwe B, and Tucker JV Heap-abstraction for an object-oriented calculus with thread classes Logical Approaches to Computational Barriers 2006 Heidelberg Springer 1-10
[41]
Katsumata, S.: Parametric effect monads and semantics of effect systems. In: Proceedings of POPL 2014, pp. 633–645. ACM (2014)
[42]
Uustalu T and Vene VComonadic notions of computationElectr. Notes Theoret. Comput. Sci.2008203263-2842437403
[43]
Berger M and Yoshida N Shao Z Timed, distributed, probabilistic, typed processes Programming Languages and Systems 2007 Heidelberg Springer 158-174
[44]
Hennessy M and Riely JResource access control in systems of mobile agentsInf. Comput.2002173182-1201889126
[45]
Teller D, Zimmer P, and Hirschkoff D Brim L, Křetínský M, Kučera A, and Jančar P Using ambients to control resources* CONCUR 2002 — Concurrency Theory 2002 Heidelberg Springer 288-303
[46]
Godskesen JC, Hildebrandt T, and Sassone V Brim L, Křetínský M, Kučera A, and Jančar P A calculus of mobile resources* CONCUR 2002 — Concurrency Theory 2002 Heidelberg Springer 272-287
[47]
Charatonik W, Gordon AD, and Talbot J-M Le Métayer D Finite-control mobile ambients Programming Languages and Systems 2002 Heidelberg Springer 295-313
Recommendations
Memory resource management in VMware ESX server
OSDI '02: Proceedings of the 5th Symposium on Operating Systems Design and ImplementationVMware ESX Server is a thin software layer designed to multiplex hardware resources efficiently among virtual machines running unmodified commodity operating systems. This paper introduces several novel ESX Server mechanisms and policies for managing ...
Resource management architecture for future information appliances
Real-Time and Embedded Computing SystemsThis paper presents our CPU resource management architecture and mechanisms for future information appliances. Information appliances are special purpose computational devices. Their examples include mobile phones, digital TVs, and vehicle navigation ...
Autonomic virtual resource management for service hosting platforms
CLOUD '09: Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud ComputingCloud platforms host several independent applications on a shared resource pool with the ability to allocate computing power to applications on a per-demand basis. The use of server virtualization techniques for such platforms provide great flexibility ...
Comments
Information & Contributors
Information
Published In
Oct 2020
595 pages
© Springer Nature Switzerland AG 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 20 October 2020
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in