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

Explain the fork-join, Explain the Fork-join This is primitives in a hi...

Explain the Fork-join This is primitives in a higher level programming language for implementing interacting processes. The syntax is like this: fork ; join ; where

Bankers algorithm, p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 ...

p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 0014

What are batch systems?, What are batch systems? Early computers were p...

What are batch systems? Early computers were physically huge machines run from a console. The general input devices were card readers and tape drivers. The common output device

priority-based scheduling algorithm , Your task is to replace the round ro...

Your task is to replace the round robin CPU scheduling scheme you developed in Practical 6 with a priority-based scheduling algorithm. To simplify matters, you can maintain the ori

Explain hierarchical paging method, Hierarchical paging method Most mo...

Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy

#title:cs604, Consider a scenario of post mailbox, there are two processes ...

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Define unixware, Define UnixWare UnixWare manages resources at the proc...

Define UnixWare UnixWare manages resources at the process level. Each resource allocated to the application is actually allocated to the process representing the application. C

Define unix device driver, Define UNIX device driver The UNIX device dr...

Define UNIX device driver The UNIX device driver is structured into two halves called top half and bottom half

Explain the various methods of file access, Operating Systems 1. Illust...

Operating Systems 1. Illustrate the Microkernel Architecture with suitable diagram. 2. When Deadlock occurs? What are the Necessary Conditions for Deadlock? 3. Describe f

Cpu scheduling algorithm, Q. A CPU scheduling algorithm determined an orde...

Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible differ

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