MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Design and Semantics of Quantum: a Language to Control Resource Consumption in Distributed Computing (1997)

Download:
Download as a PDF
by Université De Paris, Luc Moreau, Luc Moreau, Christian Queinnec, Christian Queinnec
In Usenix Conference on Domain-Specific Languages (DSL’97
http://www.usenix.org/publications/library/proceedings/dsl97/full_papers/moreau/moreau.pdf
Add To MetaCart

Abstract:

This paper describes the semantics of Quantum, a language that was speci cally designed to control resource consumption of distributed computations, such as mobile agent style applications. In Quantum, computations can be driven by mastering their resource consumption. Resources can be understood as processors cycles, geographical expansion, bandwidth or duration of communications, etc. We adopt a generic view by saying that computations need energy to be performed. Quantum relies on three new primitives that deal with energy. The rst primitive creates a tank of energy associated with a computation. Asynchronous noti cations inform the user of energy exhaustion and computation termination. The other two primitives allow usto implement suspension and resumption of computations by emptying a tank and by supplying more energy to a tank. The semantics takes the form of an abstract machine with explicit parallelism and energy-related primitives. 1

Citations

800 Intelligent agents: Theories and practice – Wooldridge, Jennings - 1995
481 An analysis of time-dependent planning – Dean, Boddy - 1988
278 A calculus of mobile agents – Fournet, Gonthier, et al. - 1996
251 Call-by-name, call-by-value and the *-calculus – Plotkin - 1975
245 The Lambda Calculus: Its Syntax and Semantics, volume 103 – Barendregt - 1984
150 Agent Tcl: A flexible and secure mobile-agent system – Gray - 1996
135 Operating system support for mobile agents – Johansen, Renesse, et al. - 1995
130 The architecture of the araplatform for mobile agents – Peine, Stolpmann - 1997
108 An introduction to the TACOMA distributed system – Johansen, Renesse, et al. - 1995
99 A type-based approach to program security – Volpano, Smith - 1997
91 Control operators, the SECD machine, and the -calculus – Felleisen, Friedman - 1986
70 The revised 4 report on the algorithmic language Scheme – Clinger, Rees, et al. - 1992
65 The Scheme Programming Language – Dybvig - 2003
65 The scientific community metaphor – Kornfeld, Hewitt - 1981
48 Dybvig. Continuations and concurrency – Hieb, Kent - 1990
38 The Semantics of Future and Its Use in Program Optimization – Flanagan, Felleisen - 1995
38 The new hacker's dictionary – Raymond - 1996
33 Engines build process abstractions – Haynes, Friedman - 1984
32 R.H.: New ideas in parallel Lisp: Language design, implementation, and programming tools – Halstead
26 Static analysis of communication for asynchronous concurrent programming languages – Kobayashi, Nakade, et al. - 1995
26 Speculative computation in Multilisp – Osborne - 1990
25 Abstracting Timed Preemption with Engines – Haynes, Friedman - 1987
23 De Roure. Design of a Concurrent and Distributed Language – Queinnec, David - 1993
15 Telescript technology: The foundation for the electronic marketplace – Magic, Inc - 1994
15 The semantics of scheme with future – Moreau - 1996
13 Speculative Computation in Multilisp, An Overview – Osborne - 1990
13 An introduction to mobile agent programming and the Ara system – Peine - 1997
12 Pattern Matching for Scheme – Wright, Duba - 1995
11 Correctness of a Distributed-Memory Model for Scheme – Moreau - 1996
8 Towards a Framework for Developing Mobile Agents for Managing Distributed Information Resources – Dale, DeRoure - 1997
7 Distributed Computations Driven by Resource Consumption – Moreau, Queinnec - 1998
7 Sharing mutable objects and controlling groups of tasks in a concurrent and distributed language – Queinnec - 1994
7 Models of Control and Their Implications for Programming Language Design – Sitaram - 1994
7 The Language – Lisp - 1990
6 The Semantics of pcall and fork – Moreau, Ribbens - 1995
5 Telescript Technology: Mobile Agents. http: //www.genmagic.com/Telescript/Whitepapers/ wp4/whitepaper-4.html – Magic - 1996
4 Dybvig. Representig Control in the Presence of One-Shot Continuations – Bruggeman, Waddell, et al. - 1996
3 An Asynchronous Model of Locality, Failure – Amadio - 1997
2 Programming in Scheme. The Scienti c Press, 507 – Eisenberg - 1988
2 Locality, Causality and Continuations – Queinnec - 1994
1 et al. A Platform for Secure Mobile Agents – Arthursson - 1997