Memory organization - computer architecture, Computer Engineering

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

Posted Date: 10/13/2012 5:03:04 AM | Location : United States







Related Discussions:- Memory organization - computer architecture, Assignment Help, Ask Question on Memory organization - computer architecture, Get Answer, Expert's Help, Memory organization - computer architecture Discussions

Write discussion on Memory organization - computer architecture
Your posts are moderated
Related Questions

Question: (a) List five main characteristics of ‘Prototyping'. (b) Describe briefly why ‘Prototyping' is essential to Rapid Application Development. (c) Describe the 2 t

Write a script that will first initialize a string variable that will kept x and y coordinates of a point in the form 'x 3.1 y 6.4'.  Then, use string manipulating functions to ext

Q. Concurrently read concurrently write? It is one of the models derived from PRAM. In this model the processors access the memory locations simultaneously for reading and writ

Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

What is Software and hardware interrupt The software interrupts are program instructions. These instructions are inserted at desired location in a program. A program formed int

Truth Tables - artificial intelligence: In propositional logic, where we are limited to expressing sentences where propositions are true or false - we can check whether a speci

With relevant diagram explain the working of master-slave JK flip flop. Ans. Master-Slave J-K FLIP-FLOP: A cascade of two S-R FLIP-FLOPS is a master-slave J-K FLIP-FLOP. One

Multiplication Algorithms Multiplication of the two fixed-point binary numbers in signed magnitude representation is done with paper and pencil through a process of successive

In SDK – 86 kit 128KB SRAM and 64KB EPROM is provided on system and provision for expansion of another 128KB SRAM is given. The on system SRAM address starts from 00000H and that