Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  Assume that in a certain computer, the virtua... Start Learning for Free
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?
  • a)
    256 * 210
  • b)
    16 * 210
  • c)
    4 * 220
  • d)
    8 * 220
Correct answer is option 'A'. Can you explain this answer?
Verified Answer
Assume that in a certain computer, the virtual addresses are 64 bits l...
Given LA = 64 bits, PA = 48 bits, PS = 8 kB
Word size = 4 Bytes
As per question, the memory is word addressable 
Page size (in words) = 
11 bits are required to represent a page (in words)
∴ 128 pages can be addresses with each of size 2kW
∴ Number of virtual addresses can be translated without any TLB miss
View all questions of this test
Most Upvoted Answer
Assume that in a certain computer, the virtual addresses are 64 bits l...
Given:

  • Virtual address length = 64 bits

  • Physical address length = 48 bits

  • Memory is word addressable

  • Page size = 8 kB

  • Word size = 4 bytes

  • TLB size = 128 entries



To find: Maximum number of distinct virtual addresses that can be translated without any TLB miss.

Explanation:

  • Page size: Since the page size is 8 kB and the memory is word addressable, each page contains 2^13 words (8 kB / 4 bytes).

  • Virtual address: The 64-bit virtual address can be divided into page number and word offset. Since the page size is 2^13 words, the page number requires 64 - log2(2^13) = 51 bits.

  • Physical address: The 48-bit physical address can be divided into frame number and word offset. Since the page size is 2^13 words, the frame number requires 48 - log2(2^13) = 35 bits.

  • TLB: The TLB is a cache that stores page table entries for recently accessed pages. Since the TLB has 128 entries, it can store page table entries for 128 pages.

  • Calculation: The maximum number of distinct virtual addresses that can be translated without any TLB miss is equal to the number of pages that can be stored in the TLB. Since the TLB has 128 entries, the number of pages that can be stored in the TLB is 2^7 = 128. Therefore, the maximum number of distinct virtual addresses that can be translated without any TLB miss is 256 * 2^10 = 262,144.



Answer: Option (a) 256 * 2^10.
Explore Courses for Computer Science Engineering (CSE) exam

Similar Computer Science Engineering (CSE) Doubts

Top Courses for Computer Science Engineering (CSE)

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer?
Question Description
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer?.
Solutions for Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer?, a detailed solution for Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? has been provided alongside types of Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLBmiss?a)256 * 210b)16 * 210c)4 * 220d)8 * 220Correct answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev