Concepts of an address - data and control bus, Operating System

Assignment Help:

  Let us consider the operation of the EPROM device in more detail. Consider the pining details below again

1663_Concepts of an address, data and control bus.png

 
Before we examine the interface means of the EPROM, it is worth giving the operation a little thought. Each memory cell in the EPROM  could store 1 byte of data i.e. 8 1, 0's. In order to access each location the EPROM has to assign each location a unique address, this is used to access the data. This is similar to the concept of a telephone number  each house has its own number. The device is constructed to request this address from external pins namely: A0 -> A15. The data pathway to the device is by means of the data bus i.e. DQ0 -> DQ7.  The remaining pins of the device are concerned with selecting the device i.e. power on (CE) and reading the data (OE).  These additional pins are often termed 'control bus'. The operation of the device to read data is simple in that we:

    1) Turn on the device CE =0
    2) Present the address on the address pins A0 -> A15
    3) Output enable the device to read the data (OE =0)
    4) Read the data of the data bus (D7 -> D0)
 
The timing of these operations is sometimes critical since it takes a finite time to access the data, therefore we must be careful not to read the data too quick. This time is termed the access time of the device, for this EPROM it is 150ns. RAM devices are similar in operation besides they have a read/write pin which enables the user to input and output data. The remaining digital systems employ VLSI methods ' Very Large scale integration', these devices are the heart of the modern PC, i.e. microprocessors, complex function devices. Before we discuss microprocessor we really should look at base systems and binary, hexadecimal and deanery systems


Related Discussions:- Concepts of an address - data and control bus

Define rotational latency and disk bandwidth, Define rotational latency and...

Define rotational latency and disk bandwidth. Rotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk head. The disk bandwidth is

Explain process description in the unix system, Process Description A pr...

Process Description A process in UNIX is a somewhat complex set of data structures that provides the operating system with all of the information necessary to dispatch and manag

Explain segmentation hardware?, Explain segmentation hardware? We defin...

Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means

Deadlock-avoidance algorithm, Regard as a computer system that runs 5000 jo...

Regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks take place about twice per month and the operator must

Linear Programing, . A paper mill produces two grades of paper viz., X and ...

. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

Explain lru approximation page replacement, LRU approximation page replacem...

LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for

What are the objectives of operating system?, What are the objectives of op...

What are the objectives of operating system? Objectives of OS 1.      Convenience: An OS makes a computer more suitable to use. 2.      Efficiency : An OS allows t

What is the purpose of the command interpreter, What is the purpose of the ...

What is the purpose of the command interpreter? Why is it usually separate from the kernel? It reads commands from the user or from a file of commands and executes them, usuall

How can deadlocks be represented?, How can deadlocks be represented? D...

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

Hj, scheduling

scheduling

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