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

  • Authors:

  • Vladan Bozic

  • Affiliations:

  • Nipissing University, Ontario, Canada

  • Venue:
  • Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.