Real time scheduling is of two types: Soft Real-Time scheduling which does not guarantee when when a critical real-time process will be scheduled; Hard Real-Time scheduling in which the process must be scheduled before the deadline. In this post we will cover two real time scheduling algorithms: rate monotonic scheduling and earliest deadline first. Points …
A common question that comes to our mind is – What is the difference between Contiguous Memory allocation, Paging and Segmentation? We will understand this concept with an individual example, explaining each of the three concepts. Contiguous Memory Allocation In contiguous memory allocation the entire address space of the process is together. For example, if …
Difference between Contiguous Memory Allocation, Paging and Segmentation Read More »
Examples of real-time operating systems include:
1. VxWorks – to be used in Mars 2020 rover (2020 launch), used in Phonix Mars lander, Boing 787, Honda Robot ASIMO etc.
2. QNX – used in cars, mobile phones
If a system neither uses deadlock prevention nor a deadlock avoidance strategy then it might enter into a deadlock. Thus, it becomes important to use deadlock detection and recovery policy. A Deadlock detection algorithm, determines whether the system is in deadlock state or not? If yes, then the system uses a deadlock recovery method to …
Software-based solution like Peterson’s solution are not guaranteed to work on modern architecture. Hence, certain hardware based solution to
Semaphore S is an integer variable which apart from initialization is accessed only through two standard atomic operations: wait() and signal().
When multiple process run in the system, they might at times want to access the same resource at same time. This situation can lead to unwanted results. To understand the issues – race condition and critical section problem, related with process synchronization lets consider a situation as below: Let: counter = 5 If I run …
1. What are Threads in Operating System A thread is the smallest unit of execution which has its own thread ID, program counter, register set and stack. All the threads that belong to the same process share the code, data section and other resources like open files belonging to the process. So, remember thread is …
Solve these Unsolved Questions on CPU Scheduling Algorithms to check out your understanding on the same Q1. Find the av. waiting time and av. turnaround time using:a) FCFSb) SJF(NP)c) SJF(P)d) RR (TQ=3) Process Burst Time Arrival Time P1 2 2 P2 6 5 P3 4 0 P4 7 0 P5 4 7 Q2. Find the …
The most commonly used CPU scheduling algorithms are First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR) and Priority