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

Name the appliances which are controlled by micro-processor, Name the appli...

Name the appliances which are controlled by micro-processor Many household appliances which are microprocessor-controlled do not have operating systems (for example microwave o

First-order inference rules, First-Order Inference Rules: Here now we ...

First-Order Inference Rules: Here now we have a clear definition of a first-order model is that we can define soundness for first-order inference rules in the same way such we

Forward chaining - artificial intelligence, Forward Chaining - Artificial i...

Forward Chaining - Artificial intelligence: Imagine we have a set of axioms which we know are true statements regarding the world. If we set these to each be a starting state o

Explain point-to-point message passing, Q. Explain Point-to-point Message P...

Q. Explain Point-to-point Message Passing? In point to point message passing, one process transmits/receives message from/to another process. There are four communication modes

Illustrate about probability of collision, Illustrate about probability of ...

Illustrate about probability of collision? Probability of collision: There is a triangle and on this let’s assume that there are three ants one on each corner and are free t

Define the concept of encapsulation of OOA, Encapsulation of OOA Encap...

Encapsulation of OOA Encapsulation separates the interface of an abstraction from its implementation. By taking the above example i.e. of a car, we can now categorize them as:

Posix threads and mutex, The objective of this practical assignment is to u...

The objective of this practical assignment is to use the POSIX environment to write a program that simulates the supply and demand between three processes: warehouse, factory and r

Telecommunications, with poisson arrival of two calls per minute what is th...

with poisson arrival of two calls per minute what is the probability that more than three calls will arrive in two minutes? that is the time during which at least 4 calls will arr

Convert a JK flipflop to T type flipflop, With the help of a suitable diagr...

With the help of a suitable diagram, explain how do you convert a JK flipflop to T type flipflop. Ans. As here flip flop is JK flip flop and it is required to convert JK in T.

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

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