Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
BARC2017
utk0203
asked
in
CO and Architecture
Mar 23, 2017
609
views
0
votes
0
votes
L1 and L2 cache access time 2ns and 5ns respt.
Hit percentage 3% and 5% respt.
If Average access time =2.4ns then memory access time=?
utk0203
asked
in
CO and Architecture
Mar 23, 2017
by
utk0203
609
views
answer
comment
Follow
share this
share
4 Comments
Show 3 previous comments
by
srestha
commented
Mar 23, 2017
reply
Follow
share this
yes may be some wrong data
I am getting -ve ans
equation will be
$0.03\times 2+0.97\times 0.05(2+5)+0.97\times 0.05(2+5+m)=2.4$
0
0
by
Heisenberg
commented
Mar 23, 2017
reply
Follow
share this
yes it's possible . if we add the access time of previous memory hierarchy then memory time comes out to be -ve and if you dont, you still get a value very close to access time of L1 which is impossible.
0
0
by
Heisenberg
commented
Mar 23, 2017
reply
Follow
share this
some books have the convention of adding L1 time to L2 and some books don't add. It is still a grey area in COA
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
solution...
akash.dinkar12
answered
Mar 24, 2017
by
akash.dinkar12
comment
Follow
share this
1 comment
by
JeetRoy
commented
Mar 27, 2017
reply
Follow
share this
H1T1+(1-H1)H2T2+(1-H1)(1-H2)H3T3=T
.03*2 + .97*.05*5 + .97*.95*T3 = 2.4
T3 = 2.276 ns
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
utk0203
asked
in
CO and Architecture
Mar 23, 2017
280
views
BARC2017
TCP provides which UDP does not inorder packet , flow control , congestion control , all of these
utk0203
asked
in
CO and Architecture
Mar 23, 2017
by
utk0203
280
views
0
votes
0
votes
1
answer
2
utk0203
asked
in
CO and Architecture
Mar 23, 2017
254
views
BARC2017
SYN packet is sent through options 1)Bind 2)Socket 3)Listen
utk0203
asked
in
CO and Architecture
Mar 23, 2017
by
utk0203
254
views
1
vote
1
vote
1
answer
3
utk0203
asked
in
Algorithms
Mar 24, 2017
538
views
BARC2017
Time complexity of dijkstra's algorithm when array used in place of priority queue Options O(V^2) , O(VlogV+E) , O(VlogV+ElogV) , O(V^3)
utk0203
asked
in
Algorithms
Mar 24, 2017
by
utk0203
538
views
time-complexity
dijkstras-algorithm
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy