Application of finite state automata to the bakery algorithm in critical section modeling

The Bakery Algorithm (BA), developed by Dr. Leslie Lamport [1], is utilized as a method to a critical section (CS) problem modeling. A common solution to a CS problem in Operating Systems (OS) must satisfy the three requirements: (1) mutual exclusion; (2) progress; and (3) bounded waiting. The prope...

Full description

Saved in:
Bibliographic Details
Published in:ITiCSE '06 : proceedings of the 11th annual SIGCSE Conference on Innovation and Technology in Computer Science Education : June 26-28, 2006, Bologna, Italy 2006, Bologna, Italy, 2006-09, Vol.38 (3), p.362-362
Main Author: Bozic, Vladan
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Bakery Algorithm (BA), developed by Dr. Leslie Lamport [1], is utilized as a method to a critical section (CS) problem modeling. A common solution to a CS problem in Operating Systems (OS) must satisfy the three requirements: (1) mutual exclusion; (2) progress; and (3) bounded waiting. The property of BA that is most important for this investigation is that it solves the mutual exclusion problem, while satisfying the requirements of CS. The system consisting of two processes is investigated. The proposed computational model may be extended to any number of processes. By offering clarity to the CS problem, this model may be used in OS design due to its simplistic computational structure, as well as it could be applied to teaching Operating Systems.
ISSN:0097-8418
DOI:10.1145/1140123.1140273