The multiway rendezvous
From MaRDI portal
Publication:3761682
DOI10.1145/24039.24050zbMATH Open0623.68024OpenAlexW2046042302MaRDI QIDQ3761682FDOQ3761682
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/
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
- Title not available (Why is that?)
- 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)
