Consider a computer with 1024 Mbytes of available memory (not used by the S). Three programs, JOB1, JOB2, and JOB3, are submitted for execution at the same time, with the attributes listed in Table below. JOB1 uses 60% of total processor resource, JOB2 uses 20% of total processor resource and JOB3 uses 10% of total processor resource. What is the processor and memory utilization if we suppose that the jobs run concurrently under a multiprogramming operating system? JOB1 JOB2 8 min JOB3 Duration 4 min 12 min Memory 512 Mbytes 128 Mbytes 256 Mbytes Required

Consider a computer with 1024 Mbytes of available memory (not used by the S). Three programs, JOB1, JOB2, and JOB3, are submitted for execution at the same time, with the attributes listed in Table below. JOB1 uses 60% of total processor resource, JOB2 uses 20% of total processor resource and JOB3 uses 10% of total processor resource. What is the processor and memory utilization if we suppose that the jobs run concurrently under a multiprogramming operating system? JOB1 JOB2 8 min JOB3 Duration 4 min 12 min Memory 512 Mbytes 128 Mbytes 256 Mbytes Required

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

Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz.Computer B has a CPI of 2.5 and can be run at a clock rate of 750 Mhz. Wehave a particular program we wish to run. When compiled for computer A, thisprogram has exactly 100,000 instructions. How many instructions would theprogram need to have when compiled for Computer B, in order for the twocomputers to have exactly the same execution time for this program?
1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program requires 360 seconds, with the number of seconds executing each class as shown in the table below: Instruction Class A B C Time (sec) 100 80 120 60 1.1. By how much is the total execution time changed if the time for class D is reduced by 20% and the time for class C is increased by 10% (assuming no other changes)? 1.2. If we want to reduce the total execution time by 20% by optimizing class A only, what is the target execution time of class A instructions in order to achieve the reduction (assuming all other instructions are not changed)? 1.3. Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify your answer.
Consider a computer running a program that requires 250 seconds, where 70 seconds is spent executing FP instructions, 55 seconds for INT operations, 85 seconds for load/save operations, and 40 seconds for branch instructions. By how much is the time for INT operations reduced if the total time is reduced by 20%?
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?
Q1: Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10° instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. Which computer is faster?
Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.]
5-Consider a computer running a program that requires 400 s, with 80 s spent executing FP instructions, 40 s executed L/S instructions, and 40 s spent execut- ing branch instructions. • By how much is the total time reduced if the time for FP operations is reduced by 5%? • By how much is the time for INT operations reduced if the total time is reduced by 5%? • Can the total time can be reduced by 10% by reducing only the time for branch instructions?
Given an instruction sequence with instructions in classes A, B, and C as the table below: Instruction Class A B C |CPI Instruction Count|10|40|10| 2 1 3 Total number of instructions in this sequence = Number of clock cycles from instruction class A = Number of clock cycles from instruction class B = Number of clock cycles from instruction class C = Total number of clock cycles = Average CPI for this instruction sequence = (Answer with a float the decimal point, e.g. 4.5)
Consider a computer system that has the following characteristics: The memory bus runs at 400 MHz. The memory bus is 8 bytes wide. Accessing a memory address in memory requires 8 memory bus cycles. The disk drives can each read a block every 4 milliseconds. Disk blocks read are 8 kilobytes each. Assume Direct Memory Access from the disk drive. What is the highest percentage of the memory bus capacity that could be consumed by the disk’s Direct Memory Access if there are 4 disk drives in use?
Suppose that DS=1000H, SS= 2000H, CS=3000H, ES=4000H, BP=FFH, BX=FFFFH and DI=5H.i. Which memory locations are addressed by: MOV DL, [BP]?ii. Which memory locations are addressed by: MOV EAX, [BX+DI]?
Computers often have to deal with scheduling the programs which are submitted to them by program- mers. Programmers often require computers to finish running programs quickly. Programmers are very unpredictable and submit programs at arbitrary times. Programmers may also submit programs that take different amounts of time to complete. Programmers are being generous for this problem by allowing preemption. That is, the computer is allowed to switch from working on one program to another program while retaining progress. Suppose we have a single-processor computer which can only run one program at a time. Let J be a set of n jobs. Each job has an arrival time A; and a required amount of processing time P;. The computer doesn't know when jobs will arrive, but once the job arrives, it is given the quantity P. A job is complete once the computer has worked on it for P; units of time. After all the jobs are completed, we will compute a metric to measure how good the scheduling was. Let the…
Consider a group of 5 benchmarks. With an old generation of CPU in the 90s, the execution times of these benchmarks were 10 minutes, 16 minutes, 4 minutes, 1 minute and 8 minutes. With a new generation of CPU in 2020, the execution time of these benchmarks are 5 minutes, 2 minutes, 2 minutes, 15 seconds and 1 minutes. What is the average speedup of the new CPU (comparing to the old CPU)? Note that, you need to determine whether arithmetic mean or geometric mean should be used here.