menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Self Doubt

0 votes
41 views

What does additional memory for tags refer to in Direct Mapping, Associative Mapping and Set- Associative Mapping?

in CO and Architecture 41 views

Please log in or register to answer this question.

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
218 views
Self Doubt: CO Syllabus
Is pipeline hazards there in the syllabus? And are there any previous year questions from there?
Is pipeline hazards there in the syllabus? And are there any previous year questions from there?
asked May 23, 2019 in CO and Architecture Hirak 218 views
0 votes
0 answers
2
70 views
Self doubt
please arrange them in increasing order of speed: Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Base addressing , indexed addressing
please arrange them in increasing order of speed: Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Base addressing , indexed addressing
asked Jan 27, 2019 in CO and Architecture iamdeepakji 70 views
0 votes
0 answers
3
89 views
Self Doubt
GATE2018-50 https://gateoverflow.in/204125/gate2018-50 Why can't I do this question with $(k+(n-1))*t_p$ For PO stage: $0.40*3 + 0.35*2 + 0.25*1 = 2.15$ cycles. This is larger than all the 5 stages of the given pipeline. So applying the above formula it gives $(5+99)*2.15 =224$ cycles. why we use the expanded form of the same formula $k*t_p+(n-1)t_p$ and get answer as $219$ cycles
GATE2018-50 https://gateoverflow.in/204125/gate2018-50 Why can't I do this question with $(k+(n-1))*t_p$ For PO stage: $0.40*3 + 0.35*2 + 0.25*1 = 2.15$ cycles. This is larger than all the 5 stages of the given pipeline. So applying the above formula it gives $(5+99)*2.15 =224$ cycles. why we use the expanded form of the same formula $k*t_p+(n-1)t_p$ and get answer as $219$ cycles
asked Jan 13, 2019 in CO and Architecture Gupta731 89 views
0 votes
1 answer
4
158 views
Self doubt about LRU and Direct mapping cache
Can we apply LRU policy to direct mapped cache. according to me it doesn't make any sense as eventually it will be like FIFO only as unique memory addresses are assigned to each cache line. But my doubt / confusion is can we implement LRU on direct mapped caches?
Can we apply LRU policy to direct mapped cache. according to me it doesn't make any sense as eventually it will be like FIFO only as unique memory addresses are assigned to each cache line. But my doubt / confusion is can we implement LRU on direct mapped caches?
asked Jan 12, 2019 in CO and Architecture S Ram 158 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...