The multiway rendezvous

DOI10.1145/24039.24050MaRDI QIDQ3761682zbMATH OpenOpenAlexFDO

Authors Arthur Charlesworth

Publication date 1987

Published in ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/toplas/1987-9/

zbMATH Keywords

communicationsynchronizationconcurrencydata encapsulation

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
• scientific article; zbMATH DE number 4026811
• Rendezvous deadlocks in interacting parallel processes
• Classifying rendezvous tasks of arbitrary dimension
• Throughput calculation for basic stochastic rendezvous networks

Cited in

(10)

• Action systems in incremental and aspect-oriented modeling
• Fast and scalable rendezvousing
• Some impossibility results in interprocess synchronization
• Synchronous, asynchronous, and causally ordered communication
• On fairness notions in distributed systems. I: A characterization of implementability
• Résolution du problème du multi-rendezvous à l'aide d'un modèle d'algorithme distribué
• Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
• Fairness and hyperfairness in multi-party interactions
• scientific article; zbMATH DE number 4026811 (Why is no real title available?)
• Deadlock-freedom in component systems with architectural constraints

This page was built for publication: The multiway rendezvous

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3761682)