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

Related questions

Q: We pointed out that I/O buses do not need separate addresslines. Construct a timing diagram similar…

A: Answer is given below .

Q: is to be connected to a high- definition video card that is supporting a 1920x1080 true-color (3…

A: The data rate as, = (Number of frames per second) * (Number of pixels per frame) * (Number of bytes…

Q: Question 1 Suppose that the WSClock page replacement algorithm uses a tau (t) of ten ticks, and the…

A: Solution (A) For Page1& Page2, the refrence will be reset to zero, so the new entries for Page1…

Q: What is the most significant disadvantage of a single data route design? Multiple Multiplexors are…

A: Given that: What is the most significant disadvantage of a single data route design? Multiple…

Q: Suppose we have a 16-bit main memory address and 32 blocks of cache memory accessible on a…

A: Organisation of virtual memory: The RAM and caches that make up the memory hierarchy in modern…

Q: For our byte-addressable computer, we opted for a fully associative mapping that allows for 32 cache…

A: In associative mapping, the associated memory stores data and references both memory words. Every…

Q: Consider a system in which bus cycles takes 500 ns. Transfer of bus control in either direction,…

Q: An 8-bit data is read from an input device and stored in the memory location 0x20000200. This data…

A: Assembly instructions: MOV This instruction copies the source operand value to destination register.…

Q: a memory reference takes 10 ns (nanoseconds), how long does a paged m mke? we add TLBS, and if 90…

A: A) Paged memory reference takes 20 ns Total 20 nanoseconds 10 nanoseconds to access the page table…

Concept explainers

Computer Fundamentals

The computer is termed computation. For calculating or computing something the device that has been used is known as the computer. Or we can say that for performing a fast arithmetic operation the device that has been used is a computer. Storing, processing, and retrieving are the main features of a computer. 

Question

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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

Define data forwarding in a few sentences. Given the block diagram below, highlight the "feedback paths" that implements the two forwarding paths. (Only for data, no control information) 2. ID/EX WB EX/MEM Control M WB MEM/WB IF/ID EX M WB- Registers ALU Instruction PCH memory Data memory IF/ID.RegisterRs IF/ID.RegisterRt IF/ID.RegisterRt IF/ID.RegisterRd Rs Rt Rt EX/MEM.RegisterRd M Rd Forwarding MEM/WB.RegisterRd unit Data Forwarding: Instruction
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.
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?
A gaming device has to transfer a high definition 1280 x 720 x 3 video frame @ 30 frames/sec. The 32-bit system bus operates at 100MHz clock. It takes one clock cycle to make one transfer through the bus (i.e. D=1) and there is an overhead of ten clock cycles per transfer (i.e. O=10) Is this bus suitable for this system? If not, then what can be done to make it suitable? Explain. What if the bus operates in burst mode (burst size of 4)? Would it be suitable to use? Explain.
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?