Highly-fair bakery algorithm using symmetric tokens
type: Item
instance of: scholarly article
title: Highly-fair bakery algorithm using symmetric tokens
zbMATH Open document ID: 1379.68244
author: Alex A. Aravind
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6802675
zbMATH Keywords: concurrency
zbMATH Keywords: distributed algorithm
zbMATH Keywords: mutual exclusion
zbMATH Keywords: bakery algorithm
zbMATH Keywords: fairness
zbMATH Keywords: bounded timestamps
describes a project that uses: SPIN
describes a project that uses: jSpin
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.09.004
OpenAlex ID: W2074482157
cites work: Q3997236
cites work: Q5452300
cites work: Bounded time-stamps
cites work: Q4473994
cites work: A new solution of Dijkstra's concurrent programming problem
cites work: Q3126969
cites work: A starvation-free solution to the mutual exclusion problem
cites work: Q4808646
cites work: The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
DOI: 10.1016/J.IPL.2010.09.004
description: scientific article; zbMATH DE number 6802675