file of your submission.2. Consider the following arrivals of processes in an interactive system.(a) Draw three timelines that illustrate the execution of these processes usingi. Shortest job first, SJFii. Nonpreemptive priority NPP - a smaller number has higher priorityiii. Round-robin, RR, with time slice 2with the following data:ProcessP1P2P3P4P5P6Arrival time003488CPU time334231Priority212312If there is a tie (same CPU time for SJF or same priority for NPP), use first-in-first-out(FIFO) to break the tie. For RR scheduling, if P1 is removed from the CPU and put inthe waiting queue just when P3 arrives, P3 will be ahead of P1 in the queue.(b) What is the average waiting time for RR?3. Consider Figure 1-31 in Tanenbaum and Bos, Ed. 5, p81 called The principal metricprefixes and answer these questions:(a) How many bytes in one terabyte (TB) of memory? Please write out all digitsof the number and also express it with an exponent.(b) How many nanoseconds in in a second? Please write out all digits of thenumber and also write it with an exponent.(c) How many bits per second is a 1Gbps running at? Please write out all digits ofthe number.(d) Kilo as a metric prefix means 1000 or 10^3 but as a metric prefix for measuringmemory it means something different - 2^10. Draw three rectangular sketches ofmemory, shaped differently and label addresses at the left starting at all zeroes:1) In the first picture the rectangle is tall and narrow. The data in ASCII is characters'elephantelephant', but you need to write it in ASCII codes shown as hex. The amountstored at each address is just one byte. Use hex for the addresses also. Label theaddresses in hex 0, 1, 2,...E,F going up the page and write the data in each memorylocation using hex and one byte on a line for 16 lines.2) Draw the same picture using binary for addresses and data.3) In this picture the rectangle is wider. Put four bytes of the same datawritten as ASCII coded hex on each of 4 lines of memory. Label hex addresses as 00, 04,08, 0C, 10.4) In the fourth picture, the rectangle is even wider but also very tall, so useany reasonable shape. Put the same sixteen bytes of data on a line like hexdump -C does. Indicate that the same data is repeated on all lines by writing it on thefirst and the top lines and indicating that the same data is in between by using "..." or anarrow. Label the addresses in 16 byte increments from 0000, 0010 to FFFF (top line) onthe left side. How big is this memory?

This question comes from operating system which is a topic computer science. In this question we are…

2. Consider the following arrivals of processes in an interactive system. (a) Draw three timelines that illustrate the execution of these processes using i. Shortest job first, SJF ii. Nonpreemptive priority NPP - a smaller number has higher priority iii. Round-robin, RR, with time slice 2 with the following data:

2. Consider the following arrivals of processes in an interactive system. (a) Draw three timelines that illustrate the execution of these processes using i. Shortest job first, SJF ii. Nonpreemptive priority NPP - a smaller number has higher priority iii. Round-robin, RR, with time slice 2 with the following data:

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

Related questions

Q: Suppose there are N worker processes defined as follows. Develop a monitor BarrierSyn with a…

A: Answer:- In the concepts of parallel and distributed programming. To master the understanding of…

Q: We call the density of a task T, C/min(D, P), where C is the computation time, D is the relative…

A: When we say a system a schedulable ? A system is schedulable when an algorithm always produces a…

Q: Consider the process of doing a group assignment for a class a. List some inputs of the process.…

A: Here we have given a brief note on process of doing a group assignment for class . You can find…

Q: Response Time = Finish = Turnover Wait Time = Duration = Burst time Arrival Complete time= (Finish -…

A: Answer to the above question is in step2:

Q: Process Allocation Махітит Available А B A B C A B C PO 1 3 6 3 1 P1 1 1 1 7 P2 5 4 P3 7 4 3 7 5 3…

A: Solution processes = 5 (p0,p1,p2 ,p3 ,p4) 3 resources A,,B,C A(instance 4) B(instance 2)…

Q: Question 7 Given the following two tasks in a soft real-time system T1 (T-2, E-1) T2 (T-5, E-3) A.…

A: I'm providing all parts of the above question. I hope this will be helpful for you..

Q: please help for parts A,B,C,D of this question. You can choose which option you want to pick for the…

A: Explanation- Part A: How the Program is RunInput Method:The program will read an input text file…

Q: For each RAG below. determine whether: We have a Single instance Resource Allocation Graph OR…

A: Understanding Resource Allocation Graphs (RAGs): Single Instance vs. Deadlock and Safe…

Q: GIPSY (General Intensional Programming System) is a Demand-Driven Execution System that is based on…

A: Here are the Context Model and Use Case Diagram for the GIPSY Demand Migration System (DMS):Context…

Q: Consider a system where processes can be dynamically created or terminated. A process can generate a…

A: "Happens Before" is also called Casual Ordering. "Happens Before" notion is not straightforward in…

Q: GIPSY (General Intensional Programming System) is a Demand-Driven Execution System that is based on…

A: Context Model DiagramUse Case DiagramApproach to solving the question: Identify key components and…

Q: Controlling what processes have access to the untrusted programme and what access the programme has…

A: Confinement Assume that the only activity of program is in computing the sum from 1 to 10, thus…

Q: Draw a model in BPMN that can produce every possible execution sequence that includes tasks {p, q,…

A: BPMN (Business Process Modeling Notation) The Business Process Modeling Notation (BPMN), is an open…

Q: Wait, what happened? Our training process literally blew up, leading to losses becom- ing inf. This…

A: Coding given below

Q: Consider several threads that are common throughout all modules of our course. They are reiterated,…

A: The concept of perpetual learning serves as a foundational principle within our course, transcending…

Q: If a sporadic implicit deadline task set is schedulable under RM, will it be schedulable under RM…

A: The real-time task of sporadic that reoccur at any random instant and have hard deadline are known…

Q: Suppose that an operating system supports two kinds of sequential processes: high-priority…

A: Introduction of Operating System: An operating system (OS) is a collection of software that manages…

Question

file of your submission.
2. Consider the following arrivals of processes in an interactive system.
(a) Draw three timelines that illustrate the execution of these processes using
i. Shortest job first, SJF
ii. Nonpreemptive priority NPP - a smaller number has higher priority
iii. Round-robin, RR, with time slice 2
with the following data:
Process
P1
P2
P3
P4
P5
P6
Arrival time
0
0
3
4
8
8
CPU time
3
3
4
2
3
1
Priority
2
1
2
3
1
2
If there is a tie (same CPU time for SJF or same priority for NPP), use first-in-first-out
(FIFO) to break the tie. For RR scheduling, if P1 is removed from the CPU and put in
the waiting queue just when P3 arrives, P3 will be ahead of P1 in the queue.
(b) What is the average waiting time for RR?
3. Consider Figure 1-31 in Tanenbaum and Bos, Ed. 5, p81 called The principal metric
prefixes and answer these questions:
(a) How many bytes in one terabyte (TB) of memory? Please write out all digits
of the number and also express it with an exponent.
(b) How many nanoseconds in in a second? Please write out all digits of the
number and also write it with an exponent.
(c) How many bits per second is a 1Gbps running at? Please write out all digits of
the number.
(d) Kilo as a metric prefix means 1000 or 10^3 but as a metric prefix for measuring
memory it means something different - 2^10. Draw three rectangular sketches of
memory, shaped differently and label addresses at the left starting at all zeroes:
1) In the first picture the rectangle is tall and narrow. The data in ASCII is characters
'elephantelephant', but you need to write it in ASCII codes shown as hex. The amount
stored at each address is just one byte. Use hex for the addresses also. Label the
addresses in hex 0, 1, 2,...E,F going up the page and write the data in each memory
location using hex and one byte on a line for 16 lines.
2) Draw the same picture using binary for addresses and data.
3) In this picture the rectangle is wider. Put four bytes of the same data
written as ASCII coded hex on each of 4 lines of memory. Label hex addresses as 00, 04,
08, 0C, 10.
4) In the fourth picture, the rectangle is even wider but also very tall, so use
any reasonable shape. Put the same sixteen bytes of data on a line like hexdump -C
<filename> does. Indicate that the same data is repeated on all lines by writing it on the
first and the top lines and indicating that the same data is in between by using "..." or an
arrow. Label the addresses in 16 byte increments from 0000, 0010 to FFFF (top line) on
the left side. How big is this memory?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Discuss introductory part

VIEW

Step 2: Draw required gantt chart

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 6 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

How many traces does figure 2 have?
Process Scheduling in Operating System. All of the information is below
Consider the following task set. Task T T1 1 3 T2 2 4 T3 1 6 Using a timeline, show how a cyclic executive can be constructed for the task set. You may assume that the tasks can be arbitrarily “split up", but only at integer execution-time points. Thus, cach split-part of a task will have an integer execution time.
Computer Science -1 Create an SD diagram that will show the interaction between Simulator, Field, and a single Fox and a single Rabbit, based on your observations of runtime behavior and an examination of the source code for Foxes v-2. [Assume your single fox instance can possibly eat your single rabbit!] Diagram should use at least one Opt block and at least one Alt block. [Could also consider nested blocks!] Include a WORD document that describes your analysis for this, as well as the pdf for your diagram.
Given a system of 4 processes with a set of constraints described by the following precedence relation: › : {(P1, P3), (P1, P4), (P2, P4)} The processes access memory locations according to the table attached. Answer the following questions about the system (you are not required to draw any graphs): 1. Is the system determinate for all interpretations of its processes? Explain why. 2. Is the process pair (P3, P4) mutually non-interfering (MNI)? Explain why. 3. If the process pair (P3, P4) is not MNI, what modifications are necessary to guarantee that the system is determinate for all interpretations?
For each RAG below. determine whether: We have a Single instance Resource Allocation Graph OR Multi-Instance Resource Allocation Graph. There is a deadlock OR There No deadlock. If there is no deadlock, find a safe sequence (Sequence in which processes can safely execute)