Memory organization - computer architecture, Computer Engineering

Assignment Help:

Memory Organization - Computer architecture:

BASIC CONCEPTS:

Address space

- 16-bit : 216 = 64K mem. locations

- 32-bit : 232 = 4G mem. locations

- 40-bit : 240 = 1 T locations

Terminology:

Memory access time - it is time between Read and MFC signals

Memory cycle time - it is min. time delay between initiation of two successive memory operations

689_Memory Organization.png

Related Discussions:- Memory organization - computer architecture

SGML, Write short note of SGML

Write short note of SGML

Define about abstraction- object oriented systems, Define about Abstractio...

Define about Abstraction- object oriented systems Abstraction is one of the most important ideas of object oriented systems Abstraction focus on the necessary, inherent aspec

What is sector sparing, What is sector sparing? Low-level formatting al...

What is sector sparing? Low-level formatting also sets aside spare sectors not visible to the operating system. The controller can be told to change each bad sector logically w

What is the advantage of running the vuser as thread, VuGen gives the facil...

VuGen gives the facility to use multithreading. This enables more Vusers to be run pergenerator. If the Vuser is run as a process, the similar driver program is loaded into memory

client will now send ten integers , Change this program so that every clie...

Change this program so that every client will now send ten integers and receives their sum from the server. In Java, for loops can be easily executed as follows: for (int i = 0 ; i

Operating system, explain the various types of computer systems

explain the various types of computer systems

Simplify following using k-map, Q. Explain XNOR gate with three input varia...

Q. Explain XNOR gate with three input variable and draw necessary circuits. Q. Simplify FOLLOWING Using K-Map 1. m0 + m1 + m6 + m7 + m12 + m13 + m8 + m9 2. m0 + m2 + m4 +

Explain the odd-even transposition algorithm, Q. Explain the odd-even trans...

Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of

Design a 4:1 mux in verilog, Design a 4:1 mux in Verilog Mult...

Design a 4:1 mux in Verilog Multiple styles of coding. e.g. Using if-else statements if(sel_1 == 0 && sel_0 == 0) output = I0; else if(sel_1 == 0 && sel_0 ==

Fetching a word from memory - computer architecture, Fetching a word from m...

Fetching a word from memory: CPU transfers the address of the needed information word to the memory address register (MAR). Address of the needed word is transferred to the pr

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages