Nonatomic dual bakery algorithm with bounded tokens (Q766163)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nonatomic dual bakery algorithm with bounded tokens |
scientific article; zbMATH DE number 6018088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nonatomic dual bakery algorithm with bounded tokens |
scientific article; zbMATH DE number 6018088 |
Statements
Nonatomic dual bakery algorithm with bounded tokens (English)
0 references
23 March 2012
0 references
Recent systems such as smart-phones, network processors, graphic chips use memories which allow nonatomic accesses. This paper presents (for the first time) and proves (by using PVS) a mutual exclusion algorithm that only uses nonatomic shared variables. Furthermore, these shared variables are of bounded size.
0 references
mutual exclusion
0 references
nonatomic shared variables
0 references
bounded size
0 references
first-come-first-serve
0 references
0 references
