Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Round Robin Process
Suppose we have a four (4) core processor and all processes are designed to be multi-threaded. Now, like all processors with more than one core, they have the ability to perform multiple tasks at the same time. If there are four (4) with the following CPU and I/O cycles according to the table below, calculate the times for the Round Robin scheduling process (view image): Where A,B,C,D correspond to A=6, B=3, C=5, D=8.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps with 2 images
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
- Q2/ Consider three different processors P1, P2, and P3 with the clock rates and CPIs given in the following table. Processor Clock Rate CPI P1 4 2 P2 2.5 1.0 P3 3 1.5 If the processors each execute a program in 10 seconds, find the number of cycles and the number of instructions. Which processor has the highest performance expressed in instructions per second if all processors have the same instructions set architecture? Q/3 Our favorite program runs in 10 seconds on computer A, which has a 400Mhz. clock. We are trying to help a computer designer build a new machine B, that will run this program in 6 seconds. The designer can use new technology to substantially increase the clock rate, but has informed us that this increase will affect the rest of the CPU design, causing machine B to require 1.2 times as many clock cycles as machine A for the same program. What clock rate should we tell the designer to target? Answer: Q 4/ Suppose we have two implementations of the…arrow_forwardHere are the top five (5) factors that should be considered while formulating a process scheduling policy.arrow_forwardDevelop an algorithm and implement a Preemptive Priority scheduling algorithm using C++ and using bubble sorting .Arrival time, burst time and priority values.The code should also display: (i) Gantt chart and determine the following: (ii) Determine the Turnaround time(TAT), waiting time(WT) of each process (iii) Determine the Average Waiting Time (AWT) and Average Turnaround Time (ATAT) of all processes. please write the commentsarrow_forward
- Explain the differences between the following types of multiprocessing. Can you tell me the pros and cons of utilizing many CPUs at once?arrow_forwardQ2. For the following assume that values A, B, C, D, E, and F reside in memory. Also assume that instruction operation codes are represented in 6 bits, memory addresses are 64 bits, data size is 32 bits and register addresses are 5 bits. a. For each instruction set architecture shown in Figure A.1, how many addresses or names (including both memory and register), appear in each instruction for the code to compute C = A+ B, and what is the total code size? passor TOS Memory (A) Accumulator (C) Registry (D) Re loed oore Figure A.1 Operand locations for four instruction set architecture classes. The arrows indicate whether the oper and is an input or the result of the orithmetic-logical unit ALU operation, or both an input and result Lighter shoes indicate inputs, and the dark shode indicates the result in a top of stack (TOS) register points to the top input operand, which is combined with the operand below. The first operand is removed from the stack, the result takes the place of the…arrow_forwardSubject name: Microcomputer Principle Application Determine the data in AL after the following sequence of instructions. Assume (DS) = 20H. MOV AL, 25H MOV BX, 0061H AND AL, 21H[BX]arrow_forward
- A single-CPU system has four processes, P1, P2, P3 and P4 in the ready queue. The execution times and I/O needs for these processes are given below. All times are in ms. (hint: when a process starts an IO operation, it is removed from the ready queue and put back at the end of the queue only when it completes its IO). Process P1: Arrives at 0ms, needs 23ms of CPU time. Performs I/O for 5ms after 10ms of its execution time, then another 5ms after 20ms of its execution time. Process P2: Arrives at 3ms, needs 12ms of CPU time. Performs I/O for 10ms after 5ms of its execution time. Process P3: Arrives at 1ms, needs 15ms of CPU time. Performs I/O for 1ms after 7ms of its execution time. Process P4: Arrives at 2ms, needs 8ms of CPU time. Performs I/O for 5ms after 4ms of its execution time. We assume that the CPU is idle if no one of these four processes is using it. Using Round Robin scheduling algorithm with a Time Quantum of 4ms and ignoring the context switch time, determine: a) The…arrow_forwardHere are the top five (5) factors that should be considered while formulating a process scheduling policy.arrow_forwardThe result for the SPEC CPU 2017 Integer Speed Result on an Intel Xeon Platinum 8490Hprocessor. This system has an enabled 120 cores, 2 chips and 2 threads/core where each benchmarkprogram is executed simultaneously on all 120 cores with the execution time and ratio for each test asshown on the table. Compute for the speed metric on base and peak.arrow_forward
- In the context of operating systemsarrow_forwardtwo different processors execute same instructions, Processor one has 4Ghz clock rate and 1.5 CPI, processor two has 1.3GHz and 2.2 CPI. 1)find the processor with the highest performance expressed in instructions per second 2)if both processors execute a program in 15seconds, what is the number of cycles and instructionsarrow_forwardAssume a 5-stage pipelined CPU (IF – ID – MU- EX – WR) requires following time for different sections: Required time 15 ns Pipeline stages Fetch Unit Decode Unit 10 ns 20 ns Memory Unit Execution Unit 8 ns 15 ns Write back Unit The maximum delay required to transfer contents from one state to another is 2ns. a) Show the time steps of pipelining stages for the first 10 instructions of a program. Assume that Instruction-4 is a conditional loop instruction. If the condition is TRUE, CPU runs instructions: 7 - 9 twice. Please note that a single-port RAM is used with the system, such that CPU read only one data from RAM or save only one data to RAM at a time. Calculate the execution time for the first 10 instructions of a program as well. b) Show the time steps and calculate the execution time for above problem while a multiport RAM is used with the system.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education