Concurrent programming: algorithms, principles, and foundations.
From MaRDI portal
Publication:3166386
DOI10.1007/978-3-642-32027-9zbMATH Open1276.68001OpenAlexW1502619425MaRDI QIDQ3166386FDOQ3166386
Publication date: 12 October 2012
Full work available at URL: https://doi.org/10.1007/978-3-642-32027-9
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (47)
- Power and limits of distributed computing shared memory models
- A Simple Object that Spans the Whole Consensus Hierarchy
- Title not available (Why is that?)
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems
- Making local algorithms wait-free: the case of ring coloring
- Communication Patterns and Input Patterns in Distributed Computing
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- Title not available (Why is that?)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- A visit to mutual exclusion in seven dates
- Leader-based de-anonymization of an anonymous read/write memory
- Asynchronous Coordination Under Preferences and Constraints
- Modelling mutual exclusion in a process algebra with time-outs
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
- Reaching consensus in the presence of contention-related crash failures
- Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
- Tasks in modular proofs of concurrent algorithms
- Distributed universality
- About informatics, distributed computing, and our job: a personal view
- Title not available (Why is that?)
- What Can be Computed in a Distributed System?
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
- Reaching agreement in the presence of contention-related crash failures
- The entropy of a distributed computation random number generation from memory interleaving
- Title not available (Why is that?)
- Linear space bootstrap communication schemes
- Extending the wait-free hierarchy to multi-threaded systems
- Title not available (Why is that?)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- Title not available (Why is that?)
- t-Resilient Immediate Snapshot Is Impossible
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
- Title not available (Why is that?)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Mutual exclusion in fully anonymous shared memory systems
- Moded and continuous abstract state machines
- Object-based concurrent programming. ECOOP '91, Workshop, Geneva, Switzerland, July 15-16, 1991, Proceedings
- Tasks in modular proofs of concurrent algorithms
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time
- Election in fully anonymous shared memory systems: tight space bounds and algorithms
- The epigenetic consensus problem
- Contention-sensitive data structures and algorithms
This page was built for publication: Concurrent programming: algorithms, principles, and foundations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166386)
