Protection and synchronisation in a message-switched system

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a language, the Task Graph Language for the centralized representation of distributed control in the Mininet distributed operating system. This context-free language allows a programmer to specify the inter-process communication between a suite of distributed processes in the form of a Task Graph (centralized representation) and to have the constraints of the Task Graph enforced at run-time by coöperating Token Lists, one at each task (distributed control). The language allows the specification of connectivity (which tasks can send messages to which), sequencing (which messages must precede or follow one another), concurrency (which messages can be sent without regard to order), and mutual exclusion (which message sequences incident on a single task must be non-interfering).

Cite

CITATION STYLE

APA

Livesey, J., & Manning, E. (1982). Protection and synchronisation in a message-switched system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 143 LNCS, pp. 331–368). Springer Verlag. https://doi.org/10.1007/3-540-11604-4_61

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free