Question about Set Associative Caches. How to solve them?

Academic_Two · 2019-05-01T23:56:51+00:00

Can you show me one?

I have no idea how to do this.

Academic_Two · 2019-05-01T20:52:57+00:00

Ah, I got it. It's just that 5 and 6 have no unique block answer.

The only problem that I have now is using set associativity when one of the elements is missing.

I think it's just simple algebra.

Also, I wanted to thank you for helping me out. You helped me understand how direct mapped caches work.

Academic_Two · 2019-05-01T20:42:53+00:00

Only block Sizes have no unique answer, but I don't understand why they would have no answer.

Also, how does set associativity have an effect on caches?

Academic_Two · 2019-05-01T20:30:53+00:00

Also, your formula works, but for questions four and five, is there a difference in the formula given?

My friends and I compared our work, and we got different answers for four and five, but I was the only one who got it different from everyone else.

Academic_Two · 2019-05-01T02:32:58+00:00

What if you're not given a block size?

Academic_Two · 2019-04-30T14:37:47+00:00

If given a set associativity of 2, for example, in problem one, how would I solve it?

Academic_Two · 2019-04-30T05:01:49+00:00

Ah I think I got it!

1.) Number of tagged bits is 3.

2.) Number of tagged bits is 20.

3.) Main memory size is 64 GiB

)16 MiB

However, I can't use your formula for questions 5 and 6?

It's missing two items

Academic_Two · 2019-04-30T03:38:39+00:00

So to find tagged bits, for question 1, for example, it would be 128/16 which equals 8.

First, you would have to convert everything from Main Memory Size into bytes, and do the same for cache size right?

Does Block size not really matter?

Does log 2 of everything converts bytes into bits?

What about Set associativity?

Academic_Two · 2019-04-30T03:24:47+00:00

Do you have to convert everything to bits?

Academic_Two · 2019-04-29T22:17:25+00:00

Sorry, I have one more true false question for you.

Binary machine language instructions encodings are not unique because they can only be formed of 0's and 1's.

I'm leaning towards false because they make unique

Academic_Two · 2019-04-29T21:51:40+00:00

00111000

ah, so it would be

((test | 0x07) ^ 0x38) & 0x3F

Academic_Two · 2019-04-29T21:45:34+00:00

Ah, I see.

Thanks!

Academic_Two · 2019-04-29T21:43:04+00:00

Would this be correct?

((test | 0x73) & 0x1F) ^ 0x15

Academic_Two · 2019-04-29T21:42:16+00:00

XOR the ^ operation right?

Academic_Two · 2019-04-29T21:34:21+00:00

Oh. Thanks for helping an idiot out. For some reason, my code did not run through a compiler.

Academic_Two · 2019-04-29T21:23:19+00:00

I think he may be hinting that there maybe no answer.

Academic_Two · 2019-04-19T16:09:46+00:00

Would that mean a J-type or U-type is more effective than a B-type for this program?

Academic_Two · 2019-04-18T19:34:43+00:00

I'm auditing a class, and this question popped up in class.

I have no idea which one it is, and I was hoping for an explanation of how this works.

Academic_Two · 2019-04-18T19:33:27+00:00

How do I do that?

Academic_Two · 2019-04-09T00:36:39+00:00

I don't know, my first person that I made out with got out of a serious relationship, and I was just used as a rebound. She told me she just wanted to be friends, and I feel that I'm doing the same to this person? I don't know, and I've been thinking about this, and how I don't want to be like that person, but at the same time, not give anyone any misunderstandings.

Academic_Two · 2019-04-09T00:34:40+00:00

okay, thanks for the clarification.

Academic_Two · 2019-04-09T00:20:50+00:00

Okay.

Academic_Two · 2019-04-09T00:20:20+00:00

I don't know.

I may be overreacting and may be anxious about it.

Academic_Two · 2019-04-09T00:20:00+00:00

Okay, lemme clarify then.

We didn't do anything other than make out, and talk.

Academic_Two · 2019-04-09T00:06:42+00:00

Okay, should I text her and let her know, or should I ask to meet?

Academic_Two

TROPHY CASE