1 Two different I/O systems intended for use in transaction processing: System A can support 1000 I/O operations per second. System B can support 750 I/O operations per second. The systems use the same processor that executes 50 million instructions per second. Assume that each transaction requires 5 I/O operations and that each I/O operation requires 10,000 instructions. Ignoring response time and assuming that transactions may be arbitrarily overlapped, what is the maximum transaction-per-second rate that each machine can sustain?

1 Two different I/O systems intended for use in transaction processing: System A can support 1000 I/O operations per second. System B can support 750 I/O operations per second. The systems use the same processor that executes 50 million instructions per second. Assume that each transaction requires 5 I/O operations and that each I/O operation requires 10,000 instructions. Ignoring response time and assuming that transactions may be arbitrarily overlapped, what is the maximum transaction-per-second rate that each machine can sustain?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 3PE: Processor R is a 64-bit RISC processor with a 2 GHz clock rate. The average instruction requires one...

See similar textbooks

Similar questions

Consider a CPU that operates with a data transfer rate of 30 Mbytes/s. The data is transferred byte-wise and the CPU has to transfer 30bytes of data, and the size of the Status register is 4 bytes. What is the total time needed to perform the data transfer?
A computer employs RAM chips of 512 x8 and ROM chips of 1024x8. The computer system needs 2K bytes of RAM, 2K bytes of ROM. Draw the complete diagram for such system. Show how the address is organized
Four jobs arrive at a batch processing system at the same time and the execution time of each job is 2 hours. They run on a single processor. The average time for the jobs to finish is ...
A computer has instructions that require two bus cycles, one to fetch the instruction and one to fetch the data. Each bus cycle takes 250 nanoseconds and each instruction takes 500 nanoseconds (i.e., the internal processing time is negligible). The computer also has a disk with 16,512 byte sectors per track. Disk rotation time is 8.092 milliseconds. To what percentage of its normal speed is the computer reduced during DMA transfer if each DMA takes one bus cycle? Consider two cases: 8-bit bus transfer and 16-bit bus transfer.
According to Amdahl's Law, what is the maximum possible % reduction in execution time when:process A, which currently runs 19% of the time, is optimized to run faster.
Four jobs arrive at a batch processing system at the same time and the execution time of each job is 2 hours. They run on a single processor. The average time for the jobs to finish is … a.hours b. 4 hours c. 5 hours d. 8 hours e. 1 hour
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…
A computer employs RAM chips of 512 x 16 and ROM chips of 1024 x 8. The computer system needs 4K bytes of RAM and 2K bytes of ROM along with interface unit of 128 registers each. A memory mapped I/0 configuration is used. The two higher order bits are assigned for RAM, ROM and interface as 00, 01 and 10 respectively. a) How many RAM and ROM chips are needed
In the construction process for solid-state flash memory drives (thumb drives), nearly all drives areconstructed with a large potential amount of storage space, and are sold base on the actual amountof memory that forms correctly during the process (For example, drives that are designed to store 64gb but contain a large number of bad sectors will instead be formated and sold as 32 gb). Consider amanufacturing process where every chip has a 21% of having enough bad sectors to be downgraded,and these errors are random and independent. (a) If we wish to compute the probability thatxnumber of chips out of a production run of sizenaredowngraded, do we have a probability distribution that will work for that? Are the assumptionsfor that met? Explain. (b)Graph the probability mass function forxnumber of chips out of a production run of 10 aredowngraded
Consider four processes with the following start and end times: Process Start Time End Time ABCD 3 5 1 7 6 12 4 9 For each pair of proceses, say whether they run concurrently (Y) or not (N). (a) AB (b) AC (c) AD (d) BC (e) BD (f) CD
Suppose that a multiprogrammed system has a load of N processes with individual execution times of t1, t2, ...,tN. Answer the following questions: a) How would it be possible that the time to complete the N processes could be as small as: maximum (t1, t2, ...,tN)? b) How would it be possible that the total execution time, T > t1+ t2+ ...+tN? In other words, what would cause the total execution time to exceed the sum of individual process execution times?
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.