1. Consider a system of 9 processes, P = {p1, ..., p9}. Associated with the system are 6 memory cells, M = {M1, ..., M6}. The domain and range for each process is given in the following table: Process pi Domain D(pi) pl M1, M2 M1 M3, M4 M3, M4 p2 p3 p4 p5 рб p7 p8 p9 M3 M4 M5 M3, M4 M5, M6 Range R(pi) M3 M5 M1 M5 M4 M4 M5 M2 M6 In addition, you are given the following precedence relation: →= {(P1, P2), (P1, P6), (P2, P3), (P2, P4), (P2, P5), (P3, P6), (P3, P8),(P4,P6), (P4,P7), (P5,P7), (P5,P8), (P6,P8), (P6,P9), (P7,P9), (P8, P9)} a. Construct the Precedence Graph (not containing any redundant edges). Use PowerPoint, diagrams.net, or any other app to draw the graph. b. Determine if the system above is always determinate. If it is not, add to → necessary elements to make it determinate.

1. Consider a system of 9 processes, P = {p1, ..., p9}. Associated with the system are 6 memory cells, M = {M1, ..., M6}. The domain and range for each process is given in the following table: Process pi Domain D(pi) pl M1, M2 M1 M3, M4 M3, M4 p2 p3 p4 p5 рб p7 p8 p9 M3 M4 M5 M3, M4 M5, M6 Range R(pi) M3 M5 M1 M5 M4 M4 M5 M2 M6 In addition, you are given the following precedence relation: →= {(P1, P2), (P1, P6), (P2, P3), (P2, P4), (P2, P5), (P3, P6), (P3, P8),(P4,P6), (P4,P7), (P5,P7), (P5,P8), (P6,P8), (P6,P9), (P7,P9), (P8, P9)} a. Construct the Precedence Graph (not containing any redundant edges). Use PowerPoint, diagrams.net, or any other app to draw the graph. b. Determine if the system above is always determinate. If it is not, add to → necessary elements to make it determinate.

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

Two algorithms A and B report time complexities expressed by the functions n2and 2n , respectively. They are to be executed on a machine M that consumes 10–6 s to execute an instruction. What is the time taken by the algorithms to complete their execution on machine A for an input size of 50? If another machine N that is 10 times faster than machine M is provided for the execution, what is the largest input size that can be handled by the two algorithms on machine N? What are yourobservations?
The following diagram shows the process_state and other_resources fields of 4 processes in the PCB array. The RCB array shows the state and the waiting_list of 4 resources. The ready list RL contains processes 3 then 2. Consider (1), (2) as independent operations. РСВ 1 PCB 0 РСВ 2 PCB 3 process_state blocked blocked ready running ... other_resources ... RCB 0 RCB 1 RCB 2 RCB 3 ... ... state allocated free allocated free waiting list 1 Now consider that Process 3 requests resource 0. Now, answer the following questions: 5.1.1 What is the status of process 3? (a) blocked (b) ready (c) running Answer: 5.1.2 Resource O's waiting list contains: (a) process 0 (b) process 1 (c) process 2 (d) process 3 (e) empty Answer: 5.1.3 Resource 0 is: (a) allocated (b) free Answer: 5.1.4 RL contains the processes: (a) process 0 (b) process 1 (c) process 2 (d) process 3 Answer:
For instance, a systolic array is a kind of array that may be thought of as a MISD device. Systolic arrays are networks of data processing nodes organized in a wavelike fashion, thus the name. None of these parts need the employment of a program counter since execution is started by the arrival of new data. In a timed systolic array, all of the nodes calculate and communicate synchronously, or "in lock-step," with one another.
A certain application runs in 10 minutes on a single PXY processor. When we run the same application on a 6-core PXY system, we observe that it runs in 2 minutes. Assume that some portion of this application’s execution is due to the inherently sequential code, and the remaining portion is fully parallelizable. How long would it take to run the same application on an 8-core PXY system? Give briefly the main lines of your reasoning and your derivation to get credit.
Consider the following processes and their associated threads running on a multiprocessor system: Process Thread Arrival Time CPU Burst I/O Burst Total CPU Time X X1 0 4 2 11 X2 3 2 4 5 X3 3 2 4 5 Y Y1 5 6 2 14 Y2 5 3 5 7 Z Z1 7 1 1 6 Z2 7 3 2 10 Create a scheduling simulation for these threads on a system with two (2) processors using the First Come First Served (FCFS) algorithm. A thread may migrate from one processor to another if it returns from blocked waiting time and 1) the processor it was running on previously is occupied with other work; and 2) and the other processor is available to execute the thread. If both processors are available when a thread becomes unblocked, it will remain on the processor it was most recently running on. In this simulation, you will be managing a single ready queue that schedules all processes. When two processes arrive in the ready queue at…
In a computer system five processes are attempting to proceed with three resource types. The total units of system resources are: (8,9,7). The maximum demands for every process are: P1(3,1,1), P2(3,3,2), P3(5,3,2), P4(5,1,2), P5(8,4,3). The current allocation is: P1 (0,1,1), P2 (2,1,1), P3 (3,1,2), P4 (1,1,1), and P5 (2,3,2). Is this state a safe state? Explain your answer. Please explain in great detail so i can understand .
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?
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).
Please explain in detail
We have 4 periodical processes II₁, I₂, I3 and П4, that process a video. We know their periods P, and their running times C; (in milliseconds). For: (a) the rate monotonic scheduling (RMS) algorithm and (b) the earliest deadline first (EDF) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process PC₁ II₁ 45 10 II₂ 40 10 II 3 35 5 II4 50 10 In the case of equal priorities the process that is already running has the priority. If this is not the case then take the process with the lowest ID. Does any of the above algorithms fail?
Suppose that an operating system supports two kinds of sequential processes: high-priority interactive processes, and low-priority non-interactive processes. The behavior of the high-priority processes is to alternate between periods of computation of duration Tc and periods of blocking (waiting for input) of duration Tb. The behavior of the low-priority processes is to compute constantly, with no blocking. The operating system’s scheduling policy is round-robin with a quantum q, where Tc < q. Scheduling decisions are made only when a quantum expires, or when the running process blocks. The scheduler selects a low-priority process to run only if no high-priority processes are ready. Suppose there is one high-priority process and one low-priority process in the system, and that both processes will run for a long time. For what fraction of the time does the low-priority process run?
Mapping is a process in which data is transformed between main memory and cache memory. Consider a computer with main memory capable of storing 1024 K words, each word in memory is 64 bits. The computer has cache memory capable of storing 2048 words, each word is of size 64 bits. Discuss with suitable diagram how associative mapping method can be used to transform data between main memory and cache memory? Note: i need Decimal to binary number in diagram