Question

Assume there are three processes A, B and C. All processes are submitted for execution at...

Assume there are three processes A, B and C. All processes are submitted for execution at the same time. The process A executes for 2 milliseconds and then does I/O for 3 milliseconds and then executes for 3 milliseconds more. The process B executes for 4 milliseconds and then does I/O for 7 milliseconds. The process C executes for 2 millisecond and then does I/O for 4 milliseconds. Assume no contention for the resources and the order of execution (priority) is A, B and C.

What would be the total job duration, if these processes were executed on a multi-processor system with two processors?

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Using the non-preemptive and preemptive Priority schedulers, draw out process execution timelines for the following processes....
Using the non-preemptive and preemptive Priority schedulers, draw out process execution timelines for the following processes. Clearly indicate the wait time for each process for each scheduler.   Process Arrival Burst Priority P1 0 6 2 P2 3 2 1 P3 6 8 4 P4 9 4 5 P5 12 3 3
A certain program consists of three independent parts A, B and C that can execute in...
A certain program consists of three independent parts A, B and C that can execute in parallel on separate processors within a multiprocessor system. None of the parts can be further subdivided and each part must execute on a single processor. Part A requires 78 billion cycles to complete, part B requires 40 billion cycles to complete and part C requires 62 billion cycles. The program is executed on an SMP system with 4 identical processors all running at the...
Operating Sytsem [2] (i) Define Timesharing.      (ii) In a one processor system, there is an interrupt...
Operating Sytsem [2] (i) Define Timesharing.      (ii) In a one processor system, there is an interrupt clock which is set to a “time slice Q”, that is, every Q an interrupt occurs to stop the process. There is only one I/O device in the system    which is interrupted when the process needs an I/O. There are 3 processes A, B, C.            Process A executes an I/O interrupt every T units of time.      Process B executes an I/O interrupt every...
You are given the independent jobs A(5), B(7), C(10), D(12), E(6), F(4), G(3). (a) Using the...
You are given the independent jobs A(5), B(7), C(10), D(12), E(6), F(4), G(3). (a) Using the alphabetical order priority list above, if the jobs are scheduled on 3 processors, what is the completion time? (b) If the decreasing time algorithm is used to schedule the jobs on 3 processors, what is the completion time? (c) If the decreasing time algorithm is used to schedule the jobs on 3 processors, which is the second job scheduled on processor 1? A B...
1. A mechanism by which other modules, such as I/O and memory, may interrupt the normal...
1. A mechanism by which other modules, such as I/O and memory, may interrupt the normal sequencing of the processor is called (A) Communication (B) Trap (C) Interrupt (D) I/O (E) None of the above 2. A mode of operation that provides for the interleaved execution of two or more computer programs by a single processor is called (A) Interrupt (B) Multi-programming (C) Multi-tasking (D) Multi-threading (E) None of the above 3. Which of the following is a memory location...
You are given the independent jobs A(5), B(7), C(10), D(12), E(6), F(4), G(3). (a) Using the...
You are given the independent jobs A(5), B(7), C(10), D(12), E(6), F(4), G(3). (a) Using the alphabetical order priority list above, if the jobs are scheduled on 3 processors, what is the completion time? (b) If the decreasing time algorithm is used to schedule the jobs on 3 processors, what is the completion time? 21 Incorrect: Your answer is incorrect. (c) If the decreasing time algorithm is used to schedule the jobs on 3 processors, which is the second job...
Assume several processes are running concurrently on a single processor system. Assume also that at time...
Assume several processes are running concurrently on a single processor system. Assume also that at time 2, P1 is running, no system resources (other than the CPU and memory) are being used, and that no process is in a blocked state waiting for an event to occur. Consider the following events: At time 3: P1's time slice expires At time 6: P2 is dispatched and given the CPU At time 7: P2 executes a command to read from disk unit...
In a CAN bus, there are three computers: Computer A, Computer B, and Computer C. The...
In a CAN bus, there are three computers: Computer A, Computer B, and Computer C. The messages being sent are 1.5 milliseconds long. Computer A starts sending a message on the bus; 500 microseconds later, Computer B starts to send a message, and 250 microseconds after that, Computer C starts to send a message. When does Computer A retransmit its message? A) After 1 millisecond B) After 2.25 milliseconds C) Never; Computer A will not retransmit. D) After 2 milliseconds
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling , Premtive PRIORITY Sheduling, Highest Response ratio Next (HRRN) and Round Robin(quantum=4). I need this in half hour
(Pipelining) Given 3 different instruction types, A, B and C. Each type-A, B, and C instruction...
(Pipelining) Given 3 different instruction types, A, B and C. Each type-A, B, and C instruction takes 40ns, 25ns and 50ns to complete, respectively. An assembly program is written with 30 type-A, 40 type-B and 20 type-C instructions. (a). Assume a single-issue not pipelined processor, how much time (in nano-seconds) is required to complete the execution of this program? (10pts) (b). Now let us pipeline these instructions based on a cycle time of 10ns. To pipeline these instructions equally and...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT