Illustration of a memory organization, Computer Engineering

Assignment Help:

Q. Illustration of a memory organization?

Let's consider an illustration of a memory organization as displayed in Figure below in that main memory can store 32K words of 12 bits each one and cache is capable of storing 512 blocks (every block in present illustration is equal to 24 bits that is equal to two main memory words) at any instance.

634_Illustration of a memory organization.png

Figure: Cache Memory

For each word stored in cache there is a duplicate copy in main memory. The CPU communicates with both memories. It first sends a 15 bits (32K =25 × 210 = 215) address to cache. If there is a hit then CPU uses relevant 12 bits data from 24 bit cache data. If there is a miss then CPU reads block containing relevant word from main memory. So key here is that a cache should store address and data portions of main memory to determine whether the given information is available in cache or not.  But let's presume block size as 1 memory word for further discussions.


Related Discussions:- Illustration of a memory organization

QUELING SYTEM , SHOW THAT AVERAGE NUMBER OF UNIT IN A (M/M/1) QUELING SYTEM...

SHOW THAT AVERAGE NUMBER OF UNIT IN A (M/M/1) QUELING SYTEM IS EQUAL TO P/(1-p). NOTE:P=ROW

Explain cell spacing and cell padding, Q. Explain Cell Spacing and Cell Pad...

Q. Explain Cell Spacing and Cell Padding? Couple of attributes known as CELLSPACING and CELLPADDING. Both are part of tag. CELLPADDING is the amount of space between

Low on the data-input line, For the 8-bit bidirectional register in Figure ...

For the 8-bit bidirectional register in Figure 3, verify the status of the register after every clock pulse for the LEFT RIGHT /control waveform given. A HIGH on this input permits

What is associative mapping cache, Q. What is Associative Mapping Cache? ...

Q. What is Associative Mapping Cache? The most fastest and flexible cache organization employs an associative memory that is displayed in Figure below. The associative memory s

Methods to resolve collision during hashing., What are the two methods to r...

What are the two methods to resolve collision during hashing. The two methods to resolve collision during hashing are: a) Open addressing and b) Chaining.

Explain working of bit serial associative processor, Q. Explain working of ...

Q. Explain working of Bit Serial Associative Processor? When associative processor accepts bit serial memory organization subsequently it is known as bit serial associative pr

Define buffering, Define buffering.  A buffer is a memory area that kee...

Define buffering.  A buffer is a memory area that keeps data while they are transferred among two devices or among a device and an application. Buffering is done for three reas

Interaction design, This unit introduces the most important ID terminology,...

This unit introduces the most important ID terminology, explains why ID is important, and gives a description of the main ID activities and the characteristics of the ID process. I

Describe generic framework for electronic commerce, Describe generic framew...

Describe generic framework for electronic commerce Generic Framework for electronic commerce contains the Applications of EC   (like as banking, shopping in online stores and m

Which analysis finds syntactic structure of source statement, An analysis, ...

An analysis, which determines the syntactic structure of the source statement, is called ? Ans. Syntax analysis that determines the syntactic structure of the source statement.

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