1- Which of the following scheduling algorithms could result in starvation? Why? If any, show how can starvation problem be resolved.
a. First-come, first-served (FCFS)
b. Shortest job first (SJF)
c. Round robin (RR)
2- Illustrate Peterson solution to critical section problem, showing how it satisfy the conditions of mutual exclusion, progress, and bounded waiting!
Save your time - order a paper!
Get your paper written from scratch within the tight deadline. Our service is a reliable solution to all your troubles. Place an order on any task and we will take care of it. You won’t have to worry about the quality and deadlinesOrder Paper Now
3- What is the meaning of the term busy waiting? What other kinds of waiting are there in an operating system? Can busy waiting be avoided altogether? Explain your answer.
4- Explain why interrupts are not appropriate for implementing synchronization primitives in multiprocessor systems.
5- Which of the following components of program state are shared across threads in a multithreaded process?
a. Register values
b. Heap memory
c. Global variables
d. Stack memory
6- Using pseudo C like code, illustrate two algorithms uses hardware synchronization.
7- Semaphores are used to overcome a drawback of hardware synchronization, what is this drawback, and how semaphores addresses this drawback?