Reference no: EM131321193
Project - (Programming Project)
Topic - The indexing algorithm design for processor cache.
Goal:
i. Study and implement least recently used replacement policy (LRU).
ii. Design a cache indexing scheme to minimize cache conflict miss.
Introduction
In hierarchy memory system, the small memory, cache, is used to keep data temporarily for increasing the system performance. If the data is in cache, processor can get the data with high accessing speed. If the data is not in the cache, called cache miss, processor will read data from main memory. Accessing data form main memory is slower than from cache.
In set-associative or direct mapping scheme, when multiple frequently used data blocks compete for a same cache location, those data blocks will keep kick others out from cache, and results in lots of cache miss, this kind of cache misses is called the conflict misses.
Problem Definition
Give a cache with E entries and A-way set associativity. And, the addressing bus is M-bit. We need to select K = log2E bits among all address bits for indexing the cache.
There are totally possible valid solutions. Your job is to find a valid solution with minimal cache misses under LRU replacement policy. To facilitate this problem, we assume that the offset is 0-bit, i.e. the block size is 1 byte.
Attachment:- Assignment.zip
What is the purpose of means comparisons
: What is the purpose of means comparisons, and what different types of means comparisons are there? What do they tell the researcher that the significance test for F cannot?
|
Explain the effect that this has had on your perception
: During outbreak of Ebola in West Africa in 2014, many U.S. healthcare workers and military members were exposed to the contagious disease (see the New York Times' article, "Ebola-Infected Health Care Worker in Dallas Took a Flight on Monday".
|
Indicate the format of the research design
: Identify the number of factors and the number of levels within each of the factors. Identify whether each of the factors is between participants or repeated measures.
|
Write and test the java program readstoreshow-java
: Design, write and test the Java program ReadStoreShow.java with the following requirements: Invite the user to enter an input file name and a number N (10
|
Topic - the indexing algorithm design for processor cache
: Topic - The indexing algorithm design for processor cache. Goal: Study and implement least recently used replacement policy (LRU). Design a cache indexing scheme to minimize cache conflict miss
|
Charge of the electron
: You are welcome to approximate g as 10 m/s2, 0 as 9 × 10-12 C2/(N m2), the mass of the electron as 9 × 10-31 kg, and the charge of the electron as -2 × 10-19 C to obtain numbers. See how close you come toreaching a number without the use of a calc..
|
What are extraneous and confounding variables
: What are extraneous and confounding variables? Which type of variable is most dangerous to the statistical conclusion validity and the internal validity of experimental research, and why?
|
Discuss any sociological aspects that may be causing
: Select a country and go to the CIA's World Factbook Website, and research its economic wealth or poverty. Note: Please review the other student's responses so that you do not repeat another student's selection of a country. Then, describe the econ..
|
What are placebo effects and how can they be avoided
: In what ways may experimenters unwittingly communicate their expectations to research participants, and what techniques can they use to avoid doing so?
|