Classical Synchronization Problems Simulator

Simulate and visualize three classic synchronization problems in operating systems

Producer-Consumer Problem

The Producer-Consumer problem involves two processes sharing a fixed-size buffer. Producers add data to the buffer while consumers remove data from it.

Buffer Size:

Number of Producers:

Number of Consumers:

Producer Min Time (ms):

Producer Max Time (ms):

Consumer Min Time (ms):

Consumer Max Time (ms):

Buffer Status

Producers

Consumers

Activity Log

Readers-Writers Problem

The Readers-Writers problem involves multiple processes wanting to access a shared resource - some for reading (which can be done simultaneously) and some for writing (which requires exclusive access).

Number of Readers:

Number of Writers:

Reading Min Time (ms):

Reading Max Time (ms):

Writing Min Time (ms):

Writing Max Time (ms):

Priority:

Not in use

Readers: 0

Readers

Writers

Activity Log

Dining Philosophers Problem

The Dining Philosophers problem involves N philosophers sitting around a circular table. Each philosopher needs two forks to eat, but there are only N forks in total (one between each pair of philosophers).

Number of Philosophers:

Thinking Min Time (ms):

Thinking Max Time (ms):

Eating Min Time (ms):

Eating Max Time (ms):

Strategy:

Producer-Consumer Problem

Buffer Status

Producers

Consumers

Activity Log

Readers-Writers Problem

Readers

Writers

Activity Log

Dining Philosophers Problem

Philosophers Status

Activity Log