Skip to main content

Questions tagged [cache]

0 votes
1 answer
50 views

Can someone explain to me how clean chains work in this paper? Here's the paper: Competitive caching with machine learned advice by Lykouris & Vassilvitskii I'm trying to implement the predictive ...
Adam Brewer's user avatar
0 votes
3 answers
141 views

I'm learning about caching, and currently have some degree of familiarity with main memory and paging. While reading this this Intel paper, I'm confused about the term "cache pages". I know ...
JTB's user avatar
  • 101
0 votes
0 answers
28 views

I am trying to solve this old exam question from a course that I am taking: Consider the following 32-bit MIPS assembly code. ...
albin's user avatar
  • 31
0 votes
1 answer
148 views

Suppose say a computer system uses 16-bit memory addresses. It has a 2K-byte cache organized in a 2-way set associative manner with 64 bytes per cache block. Assume that the size of each memory word ...
Marc Newsom's user avatar
2 votes
1 answer
79 views

In my university class, I received this homework assignment on computer architecture, but I don't know how to solve it. I already know that the correct answer is 0, but I don't understand why. Could ...
H0t_blue_B0i's user avatar
2 votes
1 answer
83 views

I have been studying the assosciative mapping in a cache.Every line in a cache has a unique address which is made of:the index and the offset bits which give the the cache set and the cache line and ...
Cerise's user avatar
  • 153
0 votes
2 answers
2k views

I'm trying to calculate the main memory size, and the only information given is the size of the cache, which is 256 KB, and the number of tag bits, which is 8. Cache is a 4-way set associative memory. ...
Smit Patel's user avatar
4 votes
1 answer
164 views

In my OS course, the instructor mentioned the following: In UNIX if a parent process creates a new child ("fork") then the child is an exact duplicate of the parent. This means its memory ...
Mohammed Arshaan's user avatar
0 votes
0 answers
101 views

This article from IBM (link) talks about Memory hierarchy in its actual hardware parts. NUMA While operating systems present memory to the running applications as a unified space, modern large ...
isomorphik's user avatar
1 vote
2 answers
242 views

For example, if it takes 1 cycle to read the cache and 3 cycles to write the cache, is the hit time equal to 4 cycles? Also, does this vary based on whether the cache is an instruction cache or a data ...
LuminousStar's user avatar
-1 votes
1 answer
3k views

How to determine tag, index and offset size in a two-way associative cache with a 1MB two-way set associative cache with 8 byte blocks
natalia's user avatar
1 vote
0 answers
60 views

Given CPU with: L1 cache: 4-ways, block size = 32 bytes , cache size = 64KB , LRU (Cache replacement policy). L2 cache: 2-ways, block size = 32 bytes , cache size = 512KB , LRU (Cache replacement ...
JobProcessTask's user avatar
2 votes
2 answers
197 views

A common way to resolve a dependency graph is to compute an execution order, and then execute each stage in turn - storing and fetching the resources as necessary. In this example, when executing ...
sdfgeoff's user avatar
  • 121
1 vote
2 answers
2k views

About Random Access Memory (SRAM and DRAM), if multiple read or write operation take place, many books calculate the average access time of those operations. Given the definition of access time, I ...
Bender's user avatar
  • 367
2 votes
1 answer
200 views

From prof. Onut Mutlu's slides on prefetching, this example has been shown as software prefetching: ...
Rufat Imanov's user avatar

15 30 50 per page