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?

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?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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)Consider the producer-consumer problem, Assume that the Consumer Process happens to run first and this process is allowed to run for about 10ms (it means that its running time can be very long). Describe what happens and explain any changes to any of the shared variables, and the flow of control (which statements in the Consumer Process execute). b) Assume that the Consumer Process is swapped out, and the Producer Process gets its chance to run, and the Producer Process is allowed to run for about 10ms (it means that its running time can be very long). Describe what happens and explain any changes to any of the shared variables, and the flow of control (which statements in the Consumer Process execute).
A systolic array, which is a kind of array, is an example of a MISD machine. A systolic array is a pipeline network or "wavefront" of data processing units structured as a network. Because execution is triggered by the reception of fresh data, none of these components need the usage of a program counter. Each unit in a clocked systolic array computes in "lock-step," with each unit completing alternate calculation and communication phases in a single clock cycle.
Considering problems such as Bounded-Buffer, Readers-Writers, and Dining-Philosophers Problems, explain how they work on the process synchronization.
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.
Consider a CPU that implements a single instruction fetch–decode–execute–write- back pipeline for scalar processing. The execution unit of this pipeline assumes that the execution stage requires one step. Describe, and show in diagram form, what happens when an instruction that requires one execution step follows one that requires four execution steps.
On a computer system with one processor (CPU), and N (N> 1) processes present in the system, what is the maximum number of processes that can be in the Running, and in the Blocked states at any given time? Assume 5-state model for process states.
On a parallel computer, three loop iterations are comparable to baking a cake. Find and explain any instances of task- and data-level parallelism throughout the baking process.
Consider a pair of processes in a shared memory system such that process A updates a data structure, and then sets a flag to indicate that the update is completed. Process B monitors the flag, and starts processing the data structure only after it finds the flag is set. Explain the problems that could arise in a memory architecture where writes may be reordered, and explain how the sfence and lfence instructions can be used to ensure the problem does not occur.
Starvation is a problem encountered in concurrent computing where a process is continuously denied execution. i)Articulate a real world example on how to avoid this problem.
Suppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?