What is typical storage hierarchy, Computer Engineering

Assignment Help:

Q. What is typical storage hierarchy?

A typical storage hierarchy is displayed in Figure above. Though Figure shows only block diagram however it includes storage hierarchy:   

Register

Cache memory

Main memory

Secondary Storage and 

Mass Storage. 

As we move up hierarchy we encounter storage elements which have faster access time and higher cost per bit stored as well as slower access time as a result of moving down hierarchy. So cache memory normally has the fastest access time and the smallest storage capacity as well as the highest cost per bit stored. Primary memory (main memory) falls next in storage hierarchy list. On-line, direct-access secondary storage devices like magnetic hard disks make up level of hierarchy just below main memory. Off-line, direct-access and sequential access secondary storage devices like magnetic tape, ZIP disk, Floppy disk and WORM disk etc. fall next in storage hierarchy. Mass storage devices generally referred to as archival storage are at the bottom of storage hierarchy. They are cost-effective for storage of very large quantities of data when fast access time is not essential.

Please note two significant points here: 

  • Size of memory increases as we move down hierarchy.
  • Quantum of data which is transferred between two consecutive memory layers at a time also increases as we go from a higher to lower side. For illustration from main memory to Cache transfer one or a few memory words are accessed at a time while in a hard disk to main memory transfer, a block of about 1 Megabyte is transferred in a single access.

 


Related Discussions:- What is typical storage hierarchy

Example of prolog, Example of Prolog: We can say that this is also tru...

Example of Prolog: We can say that this is also true if there are four even numbers. Now we have our first rule: • If there are three or four even numbered cards, such play

Explain cache-only memory access model (coma), Cache-Only Memory Access Mod...

Cache-Only Memory Access Model (COMA) As we have considered earlier, shared memory multiprocessor systems can use cache memories with each processor for decreasing the execution

Propositional logic, Propositional Logic: This is a fairly restrictive...

Propositional Logic: This is a fairly restrictive logic, that allows us to be write sentences about ¬propositions - statements about the world - that can either be true or

Form an 8 bit adder using 2 four bit adder IC's 7483, How will you form an ...

How will you form an 8 bit adder using 2 four bit adder IC's 7483? Ans: 4 bit adder IC is IC 7483. This has two four bit data inputs and output carry, 4 bit data output carr

Define the terms- action semantics and argouml, Define the terms- Action Se...

Define the terms- Action Semantics and  ArgoUML Action Semantics : Action semantics is a group of firms that have responded to the OMG's RFP to define the action semantics fo

Explain about quine mckluskey method, Q. Explain about Quine McKluskey Meth...

Q. Explain about Quine McKluskey Method? A tabular method was proposed to deal with increasing number of variables called Quine McKluskey Method. This method is appropriate for

Define instruction code, Define Instruction Code. An Instruction code i...

Define Instruction Code. An Instruction code is a group of bits that instructs the computer to perform an exact operation. It is usually separated into parts, each having its o

Baic electrical, Ask question #Minimumstate and explain thevenins theorem a...

Ask question #Minimumstate and explain thevenins theorem as applicable to electrical circuits 100 words accepted#

Leading zeroes of a number field, In order to suppress the leading zeroes o...

In order to suppress the leading zeroes of a number field the which keywords is used ? NO-ZERO.

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

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