Associative mapping - computer architecture, Computer Engineering

Assignment Help:

Associative Mapping:

It is a more flexible mapping technique

  • A primary memory block can be placed into any specific cache block position.
  • Space in the cache may be used more efficiently, but require to search all 128 tag patterns.

 Set-Associate Mapping

Combination of the - associative and direct mapping technique

  • Blocks of the cache are combined into sets, and the mapping permit a block of the primary

memory to reside in any  particular block of a specific set.

Note: Memory blocks 0, 64, 128,..., 4032 maps into cache set 0.

793_Associative Mapping.png


Related Discussions:- Associative mapping - computer architecture

What is the difference between intranet and extranet, What is the differenc...

What is the difference between intranet and extranet? Given table illustrates brief overview of the differences among the three kinds of the network: Network

An append structure with pooled or cluster tables, Can we include customizi...

Can we include customizing include or an append structure with Pooled or Cluster tables? No.

Describe independent loops in fortran, Q. Describe Independent Loops in for...

Q. Describe Independent Loops in fortran? HPF offers extra opportunities for parallel execution by employing the INDEPENDENT directive to declare the iterations of a do-loop is

What are prefetch instructions, What are prefetch instructions? Prefetc...

What are prefetch instructions? Prefetch instructions are those instructions which can be inserted into a program either by the programmer or by the compiler.

Spcc, Disadvantages of macro processor

Disadvantages of macro processor

Sap system-wide security settings, You are required to review the system-wi...

You are required to review the system-wide security settings on our SAP system. The data file RSPARAM contains an extract from the client's system. You are to produce a report (

What is insertion sort, What is insertion sort? Insertion Sort : One o...

What is insertion sort? Insertion Sort : One of the easiest sorting algorithms is the insertion sort. Insertion sort having of n - 1 passes. For pass p = 2 by  n, insertion so

Design a BCD to excess 3 code converter using NAND gates, Design a BCD to e...

Design a BCD to excess 3 code converter using minimum number of NAND gates. Hint: use k map techniques. Ans. Firstly we make the truth table: BCD no

Determine resources, Consider the following system snapshot using data stru...

Consider the following system snapshot using data structures in the Banker's algorithm, with resources A, B, C, and D, and process P0 to P4:                           Max

Wrapping database calls into mts transactions, What is the advantage of wra...

What is the advantage of wrapping database calls into MTS transactions? Ans) If database calls are made within the context of a transaction, aborting the transaction will undo a

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