Skip to content

ankurparihar/Raymond-algorithm

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

28 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Implementation of Raymond's tree based algorithm for Distributed Mutual Exclusion

Live Demo

Mutual Exclusion

Concurrent access of processes to a shared resource or data is executed in mutually exclusive manner. Only one process is allowed to execute the critical section (CS) at any given time.

In other terms, various running processes that have access to shared resource or data should be able to access them in a way such that only one process at a time is working on it.

  • In our simulation, processes are represented as nodes.
  • The work is called executing critical section (CS)
  • Node who has the TOKEN, has the privilege to execute CS.
  • Messege passing is used to implement distributed mutual exclusion.

About

This was an course project in CSN-232 Operating Systems in which we had to implement an OS based algorithm

The research paper: Raymond's tree based algorithm.pdf

Other Contributors

⚠️ C++ version is deprecated as it is single threaded. Javascript version uses asynchronous functions like setTimeout and setInterval and async function calls to achieve an exact simulation

Releases

No releases published

Packages

No packages published

Languages

  • HTML 48.9%
  • JavaScript 43.9%
  • C++ 4.0%
  • CSS 3.2%