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

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?
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
Suppose you have a byte-addressable computer using fully associative mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 16 bytes, determine the size of the tag field, and show how you arrived at the result.
Consider the following example and perform complete working of paging, generate the logical and physical addresses too. Let us consider the main memory size 16 Kb and Framesize is 2 KB therefore the main memory will be divided into the collection of 8 frames of 2KB each. There are 3 processes in the system that is P1, P2 and P3 of 4 KB each. Each process is divided into pages of 2 KB each so that one page can be stored in one frame. Cpuwants 2nd kb of 3rd process for processing
19. 19. We pointed out that I/O buses do not need separate address lines. Construct a timing diagram similar to Figure 7.11 that describes the handshake between an I/O controller and a disk controller for a write operation. (Hint: You will need to add a control signal.)
If each interval shown in Figure 7.11 is 50ns, how long would it take to transfer 10 bytes of data? Devise a bus protocol, using as many control lines as you need, that would reduce the time required for this transfer to take place. What happens if the address lines are eliminated and the data bus is used for addressing instead? (Hint: An additional control line may be needed.)
Consider the RAM16X8 of SAP-1 whose contents are given (in hexadecimal) as following. Address (Hex) 8-bit Contents (In Hex) 0x0 0x0A 0x1 0x1B 0x2 0x1C 0x3 0x1D 0x4 0x2E 0x5 0x2F 0x6 0xCF 0x7 0xFF 0x8 0x00 0x9 0x01 0xA 0x07 0xB 0x01 0xC 0x02 0xD 0x02 0xE 0x01 0xF 0x01 Let's consider the first 8 memory locations are reserved for Instructions and remaining memory locations contain data operands. You are requested to present in Binary and Hexadecimal, the output of the program stored in memory.
Consider a demand-paging system with a paging disk that has an average access/transfer time of 50 ms. Addresses are translated through a page table in main memory, with an access time of 500 ns per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added a TLB that reduces access time to one memory reference if the page-table entry is in the TLB. Assume that 80% of the accesses are in the TLB and that, of those remaining, 15% (or 3% of the total) cause page faults. We assume that the TLB access time is 20 ns. What is the effective access time?