A distributed abstract data type implemented by a probabilistic communication scheme

Authors:
Nissim Francez;Michael Rodeh
Affiliations:
-;-
Venue:
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Year:
1980

Citing 0
Cited 3

Protocols for Non-Deterministic Communication over Synchronous Channels

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Distributed Prototyping from Validated Specifications

RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Priority Scheduling of Distributed Systems Based on Model Checking

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

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.