scientific article
From MaRDI portal
Publication:3813266
zbMath0662.68002MaRDI QIDQ3813266
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
distributed systemsbibliographyparallel processingdistributed algorithmsmutual exclusiondeadlockcommon memoriesstarving
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of design theory to circuits and networks (94C30) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (32)
Mutual exclusion as a matter of priority ⋮ Optimal availability quorum systems: theory and practice ⋮ A visit to mutual exclusion in seven dates ⋮ On quorum systems for group resources allocation ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Load balancing in quorum systems ⋮ On the equity of mutual exclusion algorithms in distributed systems ⋮ Limitations of fast consistency conditions for distributed shared memories ⋮ Efficiency of asynchronous systems and read arcs in petri nets ⋮ Wait-free computing ⋮ Implementing sequentially consistent programs on processor consistent platforms ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Asynchronous group mutual exclusion ⋮ The congenial talking philosophers problem in computer networks ⋮ Fault-tolerant critical section management in asynchronous environments ⋮ Memory model sensitive bytecode verification ⋮ Efficient distributed algorithms by using the archimedean time assumption ⋮ The availability of crumbling wall quorum systems ⋮ An optimal \(k\)-exclusion real-time locking protocol motivated by multi-GPU systems ⋮ Contention-sensitive data structures and algorithms ⋮ Queue based mutual exclusion with linearly bounded overtaking ⋮ Recoverable mutual exclusion ⋮ Minimum monopoly in regular and tree graphs ⋮ Time and Fairness in a Process Algebra with Non-blocking Reading ⋮ Self-stabilizing \(\ell\)-exclusion ⋮ A queue based mutual exclusion algorithm ⋮ Nonatomic dual bakery algorithm with bounded tokens ⋮ A mutual exclusion algorithm with optimally bounded bypasses ⋮ Dynamic monopolies of constant size ⋮ Local majorities, coalitions and monopolies in graphs: A review ⋮ Efficiency of asynchronous systems, read arcs, and the MUTEX-problem ⋮ SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
This page was built for publication:
