Highly-fair bakery algorithm using symmetric tokens (Q1675821): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: jSpin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074482157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded time-stamps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A starvation-free solution to the mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms / rank
 
Normal rank

Latest revision as of 16:39, 14 July 2024

scientific article
Language Label Description Also known as
English
Highly-fair bakery algorithm using symmetric tokens
scientific article

    Statements

    Highly-fair bakery algorithm using symmetric tokens (English)
    0 references
    0 references
    3 November 2017
    0 references
    0 references
    concurrency
    0 references
    distributed algorithm
    0 references
    mutual exclusion
    0 references
    bakery algorithm
    0 references
    fairness
    0 references
    bounded timestamps
    0 references
    0 references
    0 references
    0 references