Explain working of direct memory access, Computer Engineering

Assignment Help:

Q. Explain working of Direct Memory Access?

In both programmed I/O and interrupt-driven processor is busy with executing input/output instructions and I/O transfer rate is limited by speed with which processor can test and service a device. What about a scheme that needs minimal intervention of CPU for input/output? These two types of shortcomings can be overcome with a more efficient technique called as DMA that behaves as if it has taken over control from processor.  C  Consequently the question is: why do we employ DMA interface? It is employed primarily when a large amount of data is to be transferred from I/O device to Memory.


Related Discussions:- Explain working of direct memory access

Explain bit-o-ring technique, Explain bit-O-Ring technique. The micro p...

Explain bit-O-Ring technique. The micro program represents that branches are not always made to a one branch address. This is a direct consequence of combining easy micro routi

Projects on cluster computing, Some famous projects on cluster computing ar...

Some famous projects on cluster computing are as follows: High Net Worth Project: (developed by: Bill McMillan, JISC NTI/65 - The HNW Project, University of Glasgow, The prim

What are pooled tables, Normal 0 false false false EN-I...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

E-recruitment system, This project is aimed at developing a web-based and c...

This project is aimed at developing a web-based and central recruitment Process system. this web site is for Fresher candidates who graduated. Some features of this system will be

Information technology or information system, Information Technology or Inf...

Information Technology or Information System Before going further we need to clarify what we mean by the term information system. It is easy to confuse terminology as many tex

Balanced trees and their operations, what is ment by avl tree n insertion n...

what is ment by avl tree n insertion n deletion ,2-3 tress insertion n deletion

Iterative deepening search, Iterative Deepening Search: So, breadth fi...

Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther

Bresenham''s line drawing algorithm, what are advantages and disadvantages ...

what are advantages and disadvantages of bresenham''s line drawing algorithm?

Associative array processing, Consider that a list of record or a table is ...

Consider that a list of record or a table is stored in the memory and you wish to find some information in that particular list. E.g. the list comprises three fields as displayed b

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd