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

Consider four processes with the following start and end times: Process Start Time End Time ABCD 3 5 1 7 6 12 4 9 For each pair of proceses, say whether they run concurrently (Y) or not (N). (a) AB (b) AC (c) AD (d) BC (e) BD (f) CD
I want all staps for Consider a computer which has a memory which is capable of storing 4096 K words and each word in memory can be of size 32 bits. The computer supports a total of “6” addressing modes, and it has “8” computer registers. The computer supports instructions, where each instruction consists of following fields: • Mode • Operation code • Register • Register • Memory Address Given that each instruction will be stored in one memory word, discuss with a suitable diagram the format of instruction by specifying number of bits for each field of instruction. Discuss each field of instruction
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.
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.
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. 439508,3112870 qx3zqy7 Jump to level 1 The ready list RL contains processes 0 then 3. Consider (1), (2) as independent operations. PCB 0 PCB 1 PCB 2 PCB 3 process state running other resources state waiting list *** *** Check free RCB 0 3 Next 440 2 *** blocked *** (1) Process 0 requests resource 2. After the operation: Process 0 is ready Resource 2 is Select V RCB 1 allocated (2) Process 0 requests resource 0. After the operation: Process 0 is Select Resource 0 is Select HY blocked 3 *** **** RCB 2 allocated *** ready *** RCB 3 allocated *** Resource 2's waiting list Select RL contains the processes Ex: 1,2,3 Resource 0's waiting list Select RL contains the processes Ex: 1, 2, 3 2 5 2 >> DDD
An example of a MISD machine might be something like a systolic array, which is a kind of array. A pipeline network or "wavefront" of data processing units that is organised as a network might be referred to as a systolic array. Since the receipt of new data is what initiates execution, none of these components need the employment of a program counter in order to function properly. Each individual unit in a timed systolic array computes in "lock-step," meaning that within the course of a single clock cycle, each individual unit finishes alternating stages of computation and communication.
A systolic array, which is the kind of array that a MISD machine is an example of, is one type of array. A "wavefront" is another name for a networked pipeline of data processing units, which is exactly what a systolic array is. Since execution begins whenever fresh data is received, none of these components need to make use of a program counter in order to function properly. Every component in a timed systolic array performs computing in "lock-step," which means that each component finishes alternating phases of computation and communication within the span of a single clock cycle.
Consider a computer whose RAM has the following memory partition: 4K, 8K, 20K, 2K. At time T, a snapshot of the process queue is taken and is given below. Queue Head Tail Process PO P1 P2 P3 P4 P5 P6 P7 Memory 2K 14K 3K 6K 6K 10K 7K 20K Usage time 4ms 10ms 2ms 8ms 4ms 1ms 8ms 6ms If the processes are allocated using FCFS algorithm with best-fit memory allocation, calculate the time at which P6 finishes its execution. Assume there is no additional time overhead for allocating these processes.
implement parallel matrix multiplication by row-partitioning using the Process object of multiprocessing module. The input matrices A and B are small 3×3 matrices and each of 3 processes receives its row and matrix B from the master process, multiplies its row with matrix B to form the row of product matrix C. A worker then sends its associated row of matrixC to the master
Given memory partitions of 100K, 600K, 400K, 500K, and 300K (inorder), howwould each of the First-fit, Best-fit, and Worst-fitalgorithms place processes of 117K, 412K, 325K, and 510K (inorder)?
We are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
4. Consider a system which has logical address is 7 bits, physical address is 6 bits calculate the number of pages and no.of frames. 5. Given Memory partition of 110,510K,210K and310kand600kin that order show how each of the best-fit, worst-fit and first-fit algorithms place process of221,471,112and 426 in that order in memory.