Consider the following failure model for faulty processors. Processors follow the protocol but might fail at unexpected points in time. When processors fail, they simply stop functioning and do not continue to participate in the distributed system. Given such a failure model, design an algorithm for reaching agreement among a set of processors. Discuss the conditions under which agreement could be reached.

Consider the following failure model for faulty processors. Processors follow the protocol but might fail at unexpected points in time. When processors fail, they simply stop functioning and do not continue to participate in the distributed system. Given such a failure model, design an algorithm for reaching agreement among a set of processors. Discuss the conditions under which agreement could be reached.

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

Consider the following failure model for faulty processors. Processors follow the protocol but might fail at unexpected points in time. When processors fail, they simply stop functioning and do not continue to participate in the distributed system. Given such a failure model, design an algorithm for reaching agreement among a set of processors. Discuss the conditions under which agreement could be reached.
Consider the following failure model for faulty processors. Processors follow the protocol but might fail at unexpected points of time. When processors fail, they simply stop functioning and do not continue to participate in the distributed system. Given such a failure model, design an algorithm for reaching agreement among a set of processors. Discuss the conditions under which agreement could be reached. Present your algorithm as a pseudocode. Please write in your own solution
Consider a system consisting of m resources of the same type being shared by n processes, n > m. Each process has a maximum need of m/2 resources. Initially, each process has no resource requests. A process can request or release only one resource at a time. With n=3k and m=2k, for some integer k, show that the system is deadlock free.
a single process, with execution time of BT time units, is detected by the system that uses Round Robin algorithm with time quantum of QT time units. Every time the time quantum elapses; a contect switch is always performed with CS time units. Assume that the process come at time equal to zero(0) If BT is 25, QT is 10 and CS is 2, what is the Cpu utilization of the system? If BT is 20, QT is 6 and CS is 1 what is the CPU utilization of the system? What is the CPU utilization if BT is equal QT and QT is equal to CS? What is the system's throughput if BT is less than QT? What is the system's turnaround time (TAT) if BT is less than QT?
true/false Consider a group of CPU-time sharing processes P1 , P2, ... Pn with CPU burst times of 1,2,...,n units respectively arrive at the same time. The average waiting time of these processes is always less than n2/6 (regardless of scheduling algorithm)
Consider a job mix in which there is one CPU-intensive job, A, that has a single infinitely long CPU burst, and 3 I/O-intensive jobs, B, C, and D. The scheduler uses Round Robin scheduling with a time quantum of 3 ms. Here is an observed execution, where initially A is running and B, C, and D are in the ready queue in this order: AAAoBBoCoDoAAAoBBoAAAoDoAAAoBBoCoDoAAAoBBo Answer the following questions based on the above. Explain and give a specify a part of the execution. a) Could any of B’s I/O-burst time be 6 ms? Explain. b) Could any of B’s I/O-burst time be 4 ms? Explain.
Consider the following processes with the given CPU arrival time and burst time. Please use the round-robin with quantum 10 to make a Gantt chart.
Asap
Given the following processes that arrived on the system as indicated in the table. The table also mention the burst time and priority of each one. Process Arrival time Burst time Priority P1 12 3 P2 7 1 P3 2 2 How the system will allocate the CPU based on Round Robin with time quantum equal to 3– suppose that all processes arrived at time 0. Processes are selected to enter the queue according to priority. So, instead of processes entering the queue in the order P1, P2 and P3. They will enter according to their priority from highest to Lowest. So, they will enter the queue in the order P2, P3, P1. Afterwards, you execute the Round Robins algorithm and draw the Gantt chart.
A distributed system may have multiple, independent resources. Imagine that process 0 wants to access resource A and process I wants to access resource B. Can Ricart and Agrawala's algorithm lead to deadlocks? Explain your answer.
BenchmarkProcessorXYZ12010402408020Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines.i.Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results.
Consider the following set of processes, with the length of the CPU bursts given in milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0 Process Burst Time Priority P1 5 3 P2 11 4 P3 12 P4 1 P5 7 2 a. Draw 3 Gantt charts that illustrate the execution of these processes using the following schedulin algorithms. i. FCFS. Non pre-emptive priority with arrival time for P1, P2, P3, P4 and P5 as 0,2,3,4,5 respectively. (A smaller priority number implies a higher priority). SJF with arrival time for P1, P2, P3, P4 and P5 as 1, 2, 3, 4, 5. ii. 292 iii. b. Calculate the average waiting time for FCFS and SJF scheduling algorithms mentioned in the previous question. Show your work?