| Home | W01 | W02 | W03 | W04 | W05 | W06 | W07 | W08 | W09 | W10 | Log | Rank | Github |
Based on this site, process are categorized into two types, independent and cooperative process. Problem in process occurred in cooperative process because it share resources. This site also explains Race Condition and Critical Section Problem very briefly. Pretty good explanations from this site.
So basically, based on this site, race condition is a condition where a some processes access and manipulate the same data at the same time. It also being said that if a thread runs at an unexpected time, it can occurs a wrong input or a deadlock.
From this site, i learnt that critical section is a code segment that more than one processes access that code segment. The solution of critical section can be done by making a method that can lock process.
Based on this site, semaphores are integer variables that are used to solve the critical section problem by using two atomic operations, wait and signal for processing synchronization. There are two main types of semaphore, they are counting and binary semaphores. This site also provides explanation about the advantages and disadvantages of using semaphores.
In week 06, i already list this site and i decided to recall my memory about deadlocks so i revisit this site. This site has a picture to illustrate the explanation so i can recall my memory very easily.
This site explains about how to prevent and avoid deadlock in operating system. This site also gives example on how the algorithm works. it is really good to help me understand about deadlock prevention algorithm.
Banker’s algorithm is one of deadlock prevention algorithm. It is done by simulating he allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue. There is also an example provided in this site.
Deadlock and starvation might be pretty similar. This site shows the difference between them based on arising condition, resources, prevention, etc. This site done its job to show differences between both really good.
This site explains about shared memory and how shared memory are made and can be shared between processes. This site is really good because the explanation is pretty brief and it provides an explanation that really helps me to understand.
Based on this site, Peterson’s Algorithm is used for synchronizing two processes. I like this site a lot because it shows the code example and gives some clear explanation that really help me a lot.
Last revision: 2 May 2021.