Concurrent Programming: Algorithms, Principles, and Foundations

DOI10.1007/978-3-642-32027-9zbMath1276.68001OpenAlexW1502619425MaRDI QIDQ3166386

Publication date: 12 October 2012

Full work available at URL: https://doi.org/10.1007/978-3-642-32027-9

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (39)

A visit to mutual exclusion in seven dates ⋮ Communication Patterns and Input Patterns in Distributed Computing ⋮ Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time ⋮ Distributed universality ⋮ The entropy of a distributed computation random number generation from memory interleaving ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems ⋮ Extending the wait-free hierarchy to multi-threaded systems ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ A Simple Object that Spans the Whole Consensus Hierarchy ⋮ Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ Power and limits of distributed computing shared memory models ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity ⋮ Reaching agreement in the presence of contention-related crash failures ⋮ Leader-based de-anonymization of an anonymous read/write memory ⋮ Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ About informatics, distributed computing, and our job: a personal view ⋮ Time-efficient read/write register in crash-prone asynchronous message-passing systems ⋮ Linear space bootstrap communication schemes ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ Contention-sensitive data structures and algorithms ⋮ What Can be Computed in a Distributed System? ⋮ Unnamed Item ⋮ Making local algorithms wait-free: the case of ring coloring ⋮ A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring ⋮ Mutual exclusion in fully anonymous shared memory systems ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks ⋮ Asynchronous Coordination Under Preferences and Constraints ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems ⋮ Moded and continuous abstract state machines ⋮ The epigenetic consensus problem

This page was built for publication: Concurrent Programming: Algorithms, Principles, and Foundations