QUESTION 3 103, What is the slowest operation associated with the memory access

Question

QUESTION 3 103, What is the slowest operation associated with the memory access involving page table translation? O TLB lookup (miss) TLB lookup (hit) Physical address calculation O Actual memory access QUESTION 4 An operating system uses a hash-based page table. What happens if two logical addresses have the same hash value? (Hash collision.) Two pages are mapped to the same physical memory frame, thus implementing shared memory. The has values are recalculated using another has function Process identifiers are used to disambiguate the translation. The physical addresses are searched in the bucket associated with the hash value that caused the collision.

Explanation / Answer

3. Physical address calculation is the slowest operation associated with memory access involving page table translation. whereas a TLB is a memory cache that is used to reduce the time taken to access a user memory location.

4. Process identifiers are used to disambiguate has function.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.