Consider a system in which bus cycles takes 500 ns. Transfer of bus control in either direction, from processor to I/O device or vice versa, takes 250 ns. One of the I/O de- vices has a data transfer rate of 50 KB/s and employs DMA. Data are transferred one byte at a time. a. Suppose we employ DMA in a burst mode. That is, the DMA interface gains bus mastership prior to the start of a block transfer and maintains control of the bus until the whole block is transferred. For how long would the device tie up the bus when transferring a block of 128 bytes? b. Repeat the calculation for cycle-stealing mode.

Consider a system in which bus cycles takes 500 ns. Transfer of bus control in either direction, from processor to I/O device or vice versa, takes 250 ns. One of the I/O de- vices has a data transfer rate of 50 KB/s and employs DMA. Data are transferred one byte at a time. a. Suppose we employ DMA in a burst mode. That is, the DMA interface gains bus mastership prior to the start of a block transfer and maintains control of the bus until the whole block is transferred. For how long would the device tie up the bus when transferring a block of 128 bytes? b. Repeat the calculation for cycle-stealing mode.

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

Create a memory mapping from the cache memory of 512 MB to the main memory of 4 GB using the four-way set associative approach with a block size of 1 MB. Consider that each memory location may be accessed using a byte address.
Answer please
Consider a paging system with the page table stored in memory. A. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? B. If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there.)
I need the answer as soon as possible
For a computer with 56-bit physical addresses and a 8-way set associative cache of 64 KB where each cache line has the capacity of holding 32 words. Assume the word size is 3 and the architecture is byte-addressable. Answer the questions below: a.How many bits are needed for tag, index, word offset, and byte offs. Show your derivations and assumptions. b.What are the start and end physical addresses, in hex as discussed in class, for cache line 300? Cache line count starts from 0. c.What is the total size, in KB, of this cache? d.What is the tag value, in hex, of address 0xABCDEF98765432?
What is the biggest drawback of a single data route architecture?Multiplexors are required because of this.The lengthiest delay determines the clock period.This platform does not support the JUMP instruction.At any one moment, each datapath element can only carry out one function.
The following paging system has 64KB main memory, which is divided into 16 frames (frame numbers are from 0 to 15). Suppose the process A has 4 pages. The page numbers are 0, 1, 2, and 3, which are loaded to frame 9, 0, 1, and 14, respectively. What is the length of process A? (ii) For logical addresses 0001 0000 0100 1000 and 0011 0000 0110 0011 (all logical addresses are binary values), convert them to the physical address in the main memory.
The VAX SBI bus uses a distributed, synchronous arbitration scheme. Each SBIN device (i.e., processor, memory, I/O module) has a unique priority and is assigned a unique transfer request (TR) line. The SBI has 16 such lines (TR0, TR1, . . ., TR15), with TR0 having the highest priority. When a device wants to use the bus, it places a reservation for a future time slot by asserting its TR line during the current time slot. At the end of the current time slot, each device with a pending reservation examines the TR lines; the highest-priority device with a reservation uses the next time slot. A maximum of 17 devices can be attached to the bus. The device with priority 16 has no TR line. Why not?
4. bus throughput Consider a serial bus (1 bit wide) that runs at 2GHZ, usingalternate cycles for control signals and the other half of the cycles for data. What is the throughput of the busin bytes/second? Assume you wantto attach a video camera using this bus. The camera generates 60 frames per second, with each frame containing 1 Million pixels, each pixel 4 bytes in size. Would this work? Answer one of the below: a) If not, what compression factor would the camera need to achieve to be supported? A compression factor describes how mu ch smaller the data is when compared to un- compressed data. b) If yes, how many cameras could be connected?
Assume a data bus is 16 bits wide. The data and address lines are multiplexed. If the bus runs at a speed of 300MHz, how long will it take to transfer 15MB over the bus?
Draw a complete datapath for 5 staged (IF, ID, EX, MEM, WB) single-cycle operation that can perform the MIPS code given below. Show the connectivity and the bus width of the connections (in bits)s. Clearly indicate all ALU and Master control signals necessary to implement thedatapath. MIPS Code: lw $t0, 0($zero) % load x from Memoryadd $t1, $zero, $zeroadd $t2, $zero, $zeroL1: beq $t1, $t0, L2% compare i& xadd $t2,$t2, $t1add $t2,$t2, $t1addi$t1,$t1, 1beq$zero, $zero, L1% go back to the loopL2:sw $t2, 4($zero) % store result to Memory
For example, suppose an instruction is not accepted and VA page 30 is generated. A software-managed TLB can outperform a hardware-managed TLB in the following cases: