Process synchronization is a way to organize processes that use shared data. While executing many simultaneous processes, process synchronization aims to sustain shared data consistency. Considering problems such as bounded-buffer, readers-writers, and dining- philosophers problems, examine process synchronization.

Process synchronization is a way to organize processes that use shared data. While executing many simultaneous processes, process synchronization aims to sustain shared data consistency. Considering problems such as bounded-buffer, readers-writers, and dining- philosophers problems, examine process synchronization.

Principles of Information Systems (MindTap Course List)

12th Edition

ISBN:9781285867168

Author:Ralph Stair, George Reynolds

Publisher:Ralph Stair, George Reynolds

Chapter9: Enterprise Systems

Section: Chapter Questions

Problem 2SAT

See similar textbooks

Similar questions

A conservative strategy for dealing with deadlocks that involves limiting access to resources and imposing restrictions on processes is called:
The experimental Synthesis operating system has an assembler incorpo- rated within the kernel. To optimize system-call performance, the kernel assembles routines within kernel space to minimize the path that the sys- tem call must take through the kernel. This approach is the antithesis of the layered approach, in which the path through the kernel is extended to make building the operating system easier. Discuss the and cons pros of the Synthesis approach to kernel design and to system-performance optimization.
The definition of a schedule assumes that operations can be totally orderedby time. Consider a database system that runs on a system with multiple processors,where it is not always possible to establish an exact ordering betweenoperations that executed on different processors. However, operations on adata item can be totally ordered.Does this situation cause any problem for the definition of conflict serializability?Explain your answer.
2) Consider a system with a uniprocessor environment where multiple processes are executed concurrently. In this context, explain how the Dining Philosophers problem exemplifies the need for process synchronization. What are the possible outcomes if proper synchronization mechanisms are not implemented?
An airport is developing a computer simulation of air-traffic control that handles events such as landings and takeoffs. Each event has a time stamp that denotes the time when the event will occur. The simulation program needs to efficiently perform the following two fundamental operations: • Insert an event with a given time stamp (that is, add a future event). • Extract the event with smallest time stamp (that is, determine the next event to process). The best data structure for this air-traffic control simulation is a priority queue. The priority queue will enable the handling of the time stamps and keep the events in order so that the event with the smallest time stamp is extracted easily. A. True B. False
Deadlock of two processes 3. We see two processes PO and P1 can be in deadlock caused by two semaphores S and Q like below: Let S and Q be two semaphores initialized to 1 Po wait (S); wait (Q) ; signal (S); signal (Q) ; P₁ wait(0); wait (S); signal (Q) ; signal (S); (a) Explain why this happens, i.e. PO waiting for P1 to release something, while P1 waiting for PO to release another thing. (b) Can this be fixed by changing the order of some instructions of P1? Explain!
Consider a system where processes can be dynamically created or terminated. A process can generate a new process. For example, Pi generates both P₂ and P3. Modify the happened-before relation and the linear logical clock scheme for events in such a dynamic set of processes.
Discuss the benefits and drawbacks of the actor model as an approach to building concurrent and distributed systems. Provide scenarios where the actor model is particularly advantageous.
Take, for example, the database management system that is used by an airline; it most certainly makes use of snapshot isolation. Describe a situation in which an airline is willing to accept a non-serializable execution in order to get higher overall performance.
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
a) Suppose a given system allows for indefinite postponementof certain entities. How would you as a systems designer provide ameans for preventing indefinite postponement? b) A system requires that arriving processes must wait forservice if the needed resource is busy. The system does not use"aging" to elevate the priorities of waiting processes to preventindefinite postponement. What other means might the system use toprevent indefinite postponement?
A database is to be shared among several concurrent threads. Some of these threads may want only toread the database (readers), whereas others may want to update (that is, to read and write) the database(writers). Design an algorithm in pseudocode to guarantee fairness between processes such that: no datainconsistency will occur, the readers can read simultaneously, all the readers are to read before writers.Explain on your code how you satisfy these constraints.