Assume there are three processes A, B and C. Process A executes for 3 milliseconds and then does I/0 for 2 milliseconds. Process B executes then does I/0 for 2 milliseconds and then executes again for another 3 milliseconds. Process C executes for 3 milliseconds and then does I/0 these processes executes twice. What is the Total Execution Duration?

Assume there are three processes A, B and C. Process A executes for 3 milliseconds and then does I/0 for 2 milliseconds. Process B executes then does I/0 for 2 milliseconds and then executes again for another 3 milliseconds. Process C executes for 3 milliseconds and then does I/0 these processes executes twice. What is the Total Execution Duration?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

A, B, C, D, and E are five (5) processes that are awaiting execution. Their respective predicted burst times (in ms) are 10, 5, 8, 2, and 5. These events occur at times of 23, 12, 0, 5, and 15 milliseconds, respectively. use the FCFS algorithm to plan the execution
Suppose two CPU A and B have exactly the same circuits, but different clock frequencies. Answer the following questions: a) If the clock frequency of CPU A is 8MHz, how long is one clock cycle of CPU A? b) If the CPU A can execute 0.4 million instructions per second on average, how long is the average time to execute one instruction? c) What is the average number of clock cycle to execute one instruction for CPU A? d) The frequency of CPU B is 12MHz. What is the average number of instructions that can be executed per second?
Consider a system with 80% hit ratio, 50 nano-seconds time to search the associative registers , 750 nano-seconds time to access memory. Find the time to access a page a. When the page number is in associative memory. b. When the time to access a page when not in associative memory. c. Find the effective memory access time.
Implement Lamport’s logical clocks with three process p1, p2, p3 where each clock duration at 3, 5, and 6 respectively
The arrival time for processes A,B,C and D are 0,2,4 and 5 respectively and the burst time are 7,4,1 and 4 respectively. what is the average waiting time?
Suppose you have a computer that does instruction processing in anatomic way, with a clock cycle of 7ns and one instruction executioncompleted every cycle.You now split the processing into the five stages of the RISC pipeline,and you get required processing times of• IF: 1ns• ID: 1.5ns• EX: 1ns• MEM: 2ns• WB: 1.5nsYou now have added 0.1ns of delay between each of these stages. What’s the clock cycle time of this 5-stage pipelined machine?
Computer Science Suppose for a processor system it takes 35 cycles to push and pop registers onto the stack and change the PC value to the start of the interrupt service routine (ISR) or return from it. Suppose also that the ISR software takes additional 45 cycles to store the process state before the actual ISR body begins its work, and suppose it takes the same number of cycles to restore the process state when ISR is finished. If the ISR body takes 1000 cycles, what is the percent total overhead every time the ISR is executed? If the processor is running at a 2 GHz clock frequency, how long does it take before the ISR body begins execution in nanoseconds? This is usually called the ISR latency
ob 1: arrives at time 0 and needs 500 milliseconds to complete. Job 2: arrives at time 300 milliseconds and needs 400 milliseconds to complete. Job 3: arrives at time 400 milliseconds and needs 200 milliseconds to complete. Job 4: arrives at time 400 milliseconds and needs 500 milliseconds to complete. a) Fill the out timeline table and calculate the waiting time. Each box is 100 ms in duration. Enter (W)ait or (R)unning. Time(ms) 0 100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500 J1 J2 J3 J4 W = Wait State R = Running State Job 1 500 milliseconds to complete _________milliseconds waiting Job 2 400 milliseconds to complete _________milliseconds waiting Job 3 200 milliseconds to complete _________milliseconds waiting Job 4 500 milliseconds to complete _________milliseconds waiting b) Calculate the average wait time. (Hint: average…
Consider a non-pipelined machine with 5 stages of lengths 20 ns, 40 ns, 60 ns, 50 ns, 30 ns. Suppose we introduce pipelining on this machine. Assume that when introducing pipelining, the clock adds 2ns latch. a. How much time does it take to execute 200 instructions on the non-pipelined machine? b. How much time does it take to execute 200 instructions on the pipelined machine? c. What is the speedup obtained from pipelining for 100 instructions?
Suppose we could take the system of (Figure 1) and divide it into an arbitrary number of pipeline stages k, each having a delay of 300/k, and with each pipeline register having a delay of 20 ps. What would be the latency of the system? Express your answer in terms of k. What would be the throughput of the system? Express your answer in terms of k. What would be the ultimate limit on the throughput? Express your answer as in integer.
Assume that the 8051 serial port is connected to the COM port of IBM PC, and on the PC, we are using the terminal.exe program to send and receive data serially. P1.1, P1.2, and P1.3 of the 8051 are connected to a red LED, a green LED, and a switch, respectively. Write an 8051 assembly program to send to PC the message “CSE 36[1]” continuously after activating the switch. During the data sending period make the green LED on and red LED off. After the completion of sending the data make both the red and green LED off.
Draw the flow chart, and write an ARM Cortex M0+ assembly program to compute the following mathematical equation. Assume that x, y, and z is located at address 0x80000008, 0x8000000C and 0x80000010 respectively, and the data size for x, y and z are all 32 bits. z = x/4 + 8y^2