Guardians for Concurrent Systems
In this paper we survey the current state of the art on fundamental aspects of concurrent systems. We discuss the notion of concurrency and discuss a model of computation which unifies the lambda calculus model and the sequential stored program model. We develop the notion of a guardian as a module...
| Main Authors: | , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
MIT Artificial Intelligence Laboratory
2008
|
| Online Access: | http://hdl.handle.net/1721.1/41156 |
| _version_ | 1826205122463531008 |
|---|---|
| author | Hewitt, Carl Attardi, Giuseppe |
| author_facet | Hewitt, Carl Attardi, Giuseppe |
| author_sort | Hewitt, Carl |
| collection | MIT |
| description | In this paper we survey the current state of the art on fundamental aspects of concurrent systems. We discuss the notion of concurrency and discuss a model of computation which unifies the lambda calculus model and the sequential stored program model. We develop the notion of a guardian as a module that regulates the use of shared resources by scheduling their access, providing protection, and implementing recovery from hardware failures. A shared checking account is an example of the kind of resource that needs a guardian. We introduce the notions of a customer and a transaction manager for a request and illustrate how to use them to implement arbitrary scheduling policies for a guardian. A proof methodology is presented for proving properties of guardians, such as a guarantee of service for all requests received. |
| first_indexed | 2024-09-23T13:07:05Z |
| format | Working Paper |
| id | mit-1721.1/41156 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:07:05Z |
| publishDate | 2008 |
| publisher | MIT Artificial Intelligence Laboratory |
| record_format | dspace |
| spelling | mit-1721.1/411562019-04-12T09:44:45Z Guardians for Concurrent Systems Hewitt, Carl Attardi, Giuseppe In this paper we survey the current state of the art on fundamental aspects of concurrent systems. We discuss the notion of concurrency and discuss a model of computation which unifies the lambda calculus model and the sequential stored program model. We develop the notion of a guardian as a module that regulates the use of shared resources by scheduling their access, providing protection, and implementing recovery from hardware failures. A shared checking account is an example of the kind of resource that needs a guardian. We introduce the notions of a customer and a transaction manager for a request and illustrate how to use them to implement arbitrary scheduling policies for a guardian. A proof methodology is presented for proving properties of guardians, such as a guarantee of service for all requests received. MIT Artificial Intelligence Laboratory 2008-04-14T13:56:27Z 2008-04-14T13:56:27Z 1980-12 Working Paper http://hdl.handle.net/1721.1/41156 en_US MIT Artificial Intelligence Laboratory Working Papers, WP-212 application/pdf MIT Artificial Intelligence Laboratory |
| spellingShingle | Hewitt, Carl Attardi, Giuseppe Guardians for Concurrent Systems |
| title | Guardians for Concurrent Systems |
| title_full | Guardians for Concurrent Systems |
| title_fullStr | Guardians for Concurrent Systems |
| title_full_unstemmed | Guardians for Concurrent Systems |
| title_short | Guardians for Concurrent Systems |
| title_sort | guardians for concurrent systems |
| url | http://hdl.handle.net/1721.1/41156 |
| work_keys_str_mv | AT hewittcarl guardiansforconcurrentsystems AT attardigiuseppe guardiansforconcurrentsystems |