| Home | Week 01 | Week 02 | Week 03 | Week 04 | Week 05 | Week 06 | Week 07 | Week 08 | Github | Log | Rank | Key |
Dining Philosopher Problem Using Semaphores
The dining philosopher is a classic synchronization problem as it demonstrates a large class of concurrency control problems. This website will tell you the details about the definition of dining philosopher, semaphore solution to dining philosopher, and the code.
What’s Race Condition?
A race condition is a situation that may occur inside a critical section. This happens when the result of multiple thread execution in critical section differs according to the order in which the threads execute. If you want to learn more about race condition, this website will help you to understand it because it contains the meaning of race condition in details, security vulnerabilities caused by race conditions, and how to prevent race conditions.
All about Semaphores in Operating System
Semaphore is a variable that can hold only a non-negative Integer value, shared between all the threads, with operations wait and signal. This website will guide you to undertanding more about everything that is related to semaphores because it contains about semaphores history, definition, properties and types of semaphores.
Petersons Algorithm in Process Synchronization
Petersons Algorithm is used to synchronize two processes. It uses two variables, a bool array flag of size 2 and an int variable turn to accomplish it. This website contains producer consumer problem, explanation of petersons algorithm, and C program to implement petersons algorithm.
Mutual exclusion in distributed system
Mutual exclusion is a concurrency control property which is introduced to prevent race conditions. If you are interested in mutual exclusion, this website is a perfect way to learn because it will help you understand about mutual exclusion in single computer system vs distributed system, requirements of mutual exclusion algorithm, and solution to distributed mutual exclusion.
Banker’s Algorithm in Operating System Example
Banker’s algorithm used to avoid deadlock and allocate resources safely to each process in the computer system. It helps you to identify whether a loan will be given or not. This website will discuss about goals, notations, characteristics, disadvantage, and summary of banker’s algorithm.
Understanding Readers-Writers Problem
The readers-writers problem is a classical problem of process synchronization, it relates to a data set such as a file that is shared between more than one process at a time. To undertanding the details of readers-writers problem, this website will help you a lot because it contains about the meaning of readers-writers problem in general, reader process and writer process, complete with their codes.
Message Passing Model of Process Communication
Message passing model allows multiple processes to read and write data to the message queue without being connected to each other. This website will discuss about process communication, message passing model, diagram that demonstrates message passing model, advantages and disadvantage of message passing model.
OS Critical Section Problem
The critical section is a code segment where the shared variables can be accessed. For those who have interest in this topic, this website will help you to learn deaply about critical section because it will contain about the meaning of critical section problem in general and requirements of synchronization mechanisms that consist of primary and secondary along with simulated image.
Strategies for handling Deadlock
Deadlock is a situation where a process or a set of processes is blocked, waiting for some other resource that is held by some other waiting process. If you experience deadlock, don’t need to worry because this website will tell you how to solve this problem. It will contains about some strategies for handling deadlock such as deadlock ignorance, deadlock prevention, deadlock avoidance, and deadlock detection and recovery.