DSpace Repository

Specifying and Proving Properties of Guardians for Distributed Systems

Show simple item record

dc.creator Hewitt, Carl
dc.creator Attardi, Giuseppe
dc.creator Lieberman, Henry
dc.date 2004-10-04T14:50:34Z
dc.date 2004-10-04T14:50:34Z
dc.date 1979-06-01
dc.date.accessioned 2013-10-09T02:44:49Z
dc.date.available 2013-10-09T02:44:49Z
dc.date.issued 2013-10-09
dc.identifier AIM-505
dc.identifier http://hdl.handle.net/1721.1/6313
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description In a distributed system where many processors are connected by a networ and communicate using message passing, many users can be allowed to access the same facilities. A public utility is usually an expensive or limited resource whose use has to be regulated. A GUARDIAN is an abstraction that can be used to regulate the use of resources by scheduling their access, providing protection, and implementing recovery from hardware failures. We present a language construct called a PRIMITIVE SERIALIZER which can be used to express efficient implementations of guardians in a modular fashion. We have developed a proof methodology for proving strong properties of network utilities e.g. the utility is guaranteed to respond to each request which it is sent. This proof methodology is illustrated by proving properties of a guardian which manages two hardcopy printing devices.
dc.format 13845108 bytes
dc.format 10093037 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-505
dc.title Specifying and Proving Properties of Guardians for Distributed Systems


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account