A distributed abstract data type implemented by a probabilistic communication scheme
Authors:
- Nissim FrancezNFNissim Francez
- Michael RodehMRMichael Rodeh
- 1 October 1980
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 373-379
Abstract
From the users' point of view, resource management schemes may be considered as an abstract data type. An abstract specification of such schemes using axioms holding in partial algebras and relatively distributed implementations (expressed as CSP programs) are given and analyzed. Then the idea of probabilistic implementation of guard scheduling is suggested, which allows completely distributed symmetric programs. It frees the designer of an algorithm from looking for specific probabilistic algorithms, by allowing the compiler to generate probabilistic target code from nonprobabilistic source code.Keywords
This publication has 11 references indexed in Scilit:
- Partial algebras—survey of a unifying approach towards a two-valued model theory for partial algebrasAlgebra universalis, 1982
- Achieving Distributed Termination without FreezingIEEE Transactions on Software Engineering, 1982
- A distributed abstract data type implemented by a probabilistic communication scheme1980
- Distributed TerminationACM Transactions on Programming Languages and Systems, 1980
- Distributed processesCommunications of the ACM, 1978
- Communicating sequential processesCommunications of the ACM, 1978
- Limits of the "algebraic" specification of abstract data typesACM SIGPLAN Notices, 1977
- Abstract data types and the development of data structuresCommunications of the ACM, 1977
- MonitorsCommunications of the ACM, 1974
- Hierarchical ordering of sequential processesActa Informatica, 1971