A distributed abstract data type implemented by a probabilistic communication scheme

@article{Francez1980ADA,
  title={A distributed abstract data type implemented by a probabilistic communication scheme},
  author={N. Francez and M. Rodeh},
  journal={21st Annual Symposium on Foundations of Computer Science (sfcs 1980)},
  year={1980},
  pages={373-379}
}
  • N. Francez, M. Rodeh
  • Published 1980
  • Computer Science
  • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 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… CONTINUE READING
    55 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Views of queues
    • M. Broy
    • Computer Science
    • Sci. Comput. Program.
    • 1988
    • 14
    On the extremely fair treatment of probabilistic algorithms
    • 117
    A Fixed Point Approach to Applicative Multiprogramming
    • 30
    A Theory for Nondeterminism, Parallelism, Communication, and Concurrency
    • M. Broy
    • Computer Science
    • Theor. Comput. Sci.
    • 1986
    • 127
    • PDF
    Automatic verification of probabilistic concurrent finite state programs
    • Moshe Y. Vardi
    • Computer Science
    • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
    • 1985
    • 748
    • PDF
    Priority Scheduling of Distributed Systems Based on Model Checking
    • 11
    • PDF
    Priority scheduling of distributed systems based on model checking
    • 36
    • PDF
    On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem
    • 283
    • Highly Influenced
    • PDF
    The Expressive Power of Synchronizations
    • C. Laneve, A. Vitale
    • Mathematics, Computer Science
    • 2010 25th Annual IEEE Symposium on Logic in Computer Science
    • 2010
    • 15
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 43 REFERENCES
    Abstract data types and the development of data structures
    • 376
    Abstract data types and the development of data structures
    • J. Guttag
    • Computer Science
    • Conference on Data: Abstraction, Definition and Structure
    • 1976
    • 167
    A Proof System for Communicating Sequential Processes
    • 362
    • PDF
    Distributed processes: a concurrent programming concept
    • 487
    • PDF
    Achieving Distributed Termination without Freezing
    • 87
    Verifying properties of parallel programs
    • 27
    Communicating sequential processes
    • 11,986
    • PDF
    Monitors: an operating system structuring concept
    • 1,838
    • PDF
    Distributed Termination
    • 259
    • PDF
    Universal Algebra
    • 820