A modular drinking philosophers algorithm (Q1261112): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Upper bounds for static resource allocation in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankers: A classification of synchronization problems / rank
 
Normal rank

Latest revision as of 18:46, 17 May 2024

scientific article
Language Label Description Also known as
English
A modular drinking philosophers algorithm
scientific article

    Statements

    A modular drinking philosophers algorithm (English)
    0 references
    0 references
    16 September 1993
    0 references
    A variant of the drinking philosophers algorithm of Chandy and Misra is described and proved correct in a modular way. The algorithm uses an arbitrary dining philosophers algorithm as a subroutine. For \(O(1)\) time subroutine, the worst-case waiting time of the presented algorithms is shown to be \(O(1)\). Definitions that distinguish the drinking and dining philosophers problem and that specify varying degrees of concurrency are provided.
    0 references
    0 references
    0 references
    0 references
    0 references
    allocation
    0 references
    drinking philosophers
    0 references
    dining philosophers
    0 references
    concurrency
    0 references
    0 references
    0 references