Solutions for the Second Problem Set COSC 6360 Fall 2014.

Slides:



Advertisements
Similar presentations
Gwendolyn Voskuilen, Faraz Ahmad, and T. N. Vijaykumar Electrical & Computer Engineering ISCA 2010.
Advertisements

MEMORY HIERARCHY – Microprocessor Asst. Prof. Dr. Choopan Rattanapoka and Asst. Prof. Dr. Suphot Chunwiphat.
EECS 470 Virtual Memory Lecture 15. Why Use Virtual Memory? Decouples size of physical memory from programmer visible virtual memory Provides a convenient.
16.317: Microprocessor System Design I
Virtual Memory Introduction to Operating Systems: Module 9.
Review CPSC 321 Andreas Klappenecker Announcements Tuesday, November 30, midterm exam.
Memory Management 2010.
1 Lecture 5: Directory Protocols Topics: directory-based cache coherence implementations.
Virtual Memory and Paging J. Nelson Amaral. Large Data Sets Size of address space: – 32-bit machines: 2 32 = 4 GB – 64-bit machines: 2 64 = a huge number.
Memory: Virtual MemoryCSCE430/830 Memory Hierarchy: Virtual Memory CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu.
Answers to the VM Problems Spring First question A computer has 32 bit addresses and a virtual memory with a page size of 8 kilobytes.  How many.
Cache Organization of Pentium
TIME, CLOCKS AND THE ORDERING OF EVENTS IN A DISTRIBUTED SYSTEM L. Lamport Computer Science Laboratory SRI International.
Locking Key Ranges with Unbundled Transaction Services 1 David Lomet Microsoft Research Mohamed Mokbel University of Minnesota.
Chapter VIII Virtual Memory Review Questions Jehan-François Pâris
Topics covered: Memory subsystem CSE243: Introduction to Computer Architecture and Hardware/Software Interface.
Computer Architecture Lecture 28 Fasih ur Rehman.
Problems discussed in the review session for the final COSC 4330/6310 Summer 2012.
Lecture 19: Virtual Memory
Virtual Memory  Modern Operating systems can run programs that require more memory than the system has  If your CPU is 32-bit, meaning that it has registers.
The Memory Hierarchy 21/05/2009Lecture 32_CA&O_Engr Umbreen Sabir.
IT253: Computer Organization
SafetyNet: improving the availability of shared memory multiprocessors with global checkpoint/recovery Daniel J. Sorin, Milo M. K. Martin, Mark D. Hill,
Virtual Memory Expanding Memory Multiple Concurrent Processes.
Practical, Transparent Operating System Support for Superpages J. Navarro Rice University and Universidad Católica de Chile S. Iyer, P. Druschel, A. Cox.
Fall 2000M.B. Ibáñez Lecture 17 Paging Hardware Support.
The Three C’s of Misses 7.5 Compulsory Misses The first time a memory location is accessed, it is always a miss Also known as cold-start misses Only way.
COSC 3330/6308 Solutions to the Third Problem Set Jehan-François Pâris November 2012.
Solution to the Fall 2012 Second COSC 6360 Quiz Jehan-François Pâris
Princess Sumaya Univ. Computer Engineering Dept. Chapter 5:
Solution to the Second COSC 6360 Quiz for Fall 2013 Jehan-François Pâris
COSC 3330/6308 Second Review Session Fall Instruction Timings For each of the following MIPS instructions, check the cycles that each instruction.
ARM 7 & ARM 9 MICROCONTROLLERS AT91 1 ARM920T Processor.
Operating Systems, Winter Semester 2011 Practical Session 9, Memory 1.
Memory Management & Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.
Memory Hierarchy Ideal memory is fast, large, and inexpensive
Computer Organization
Virtual Memory So, how is this possible?
Virtual Memory Chapter 7.4.
Cache Organization of Pentium
Memory COMPUTER ARCHITECTURE
Lecture 12 Virtual Memory.
CS703 - Advanced Operating Systems
Section 9: Virtual Memory (VM)
CS 704 Advanced Computer Architecture
Virtual Memory Use main memory as a “cache” for secondary (disk) storage Managed jointly by CPU hardware and the operating system (OS) Programs share main.
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
QuickPath interconnect GB/s GB/s total To I/O
Multiprocessor Cache Coherency
Solutions for Second Quiz
Ivy Eva Wu.
Solution to the Fourth COSC 6360 Quiz for Fall 2013
Two Ideas of This Paper Using Permissions-only Cache to deduce the rate at which less-efficient overflow handling mechanisms are invoked. When the overflow.
CSCI206 - Computer Organization & Programming
EECE.4810/EECE.5730 Operating Systems
Replacement Policies Assume all accesses are: Cache Replacement Policy
PRACTICAL, TRANSPARENT OPERATING SYSTEM SUPPORT FOR SUPERPAGES
PERSPECTIVES ON THE CAP THEOREM
Exam Review Mark Stanovich Operating Systems COP
Practical Session 9, Memory
Solutions for the Third Problem Set
The University of Adelaide, School of Computer Science
Questions on Fifth Quiz
Lecture 8: Efficient Address Translation
CSE 542: Operating Systems
Solutions to the Second Quiz
Virtual Memory Use main memory as a “cache” for secondary (disk) storage Managed jointly by CPU hardware and the operating system (OS) Programs share main.
The University of Adelaide, School of Computer Science
ARM920T Processor This training module provides an introduction to the ARM920T processor embedded in the AT91RM9200 microcontroller.We’ll identify the.
Presentation transcript:

Solutions for the Second Problem Set COSC 6360 Fall 2014

First question According to Navarro et al., what is the purpose of speculative demotion of superpages?

Answer According to Navarro et al., what is the purpose of speculative demotion of superpages?  To find out if the superpage is still being actively used in its entirety.  Done at fixed intervals

Second question Consider a system with 4 GB of RAM, a 1 MB L3 cache, and 4 KB pages. What is the minimum TLB size that could prevent most TLB misses for data already in the cache? (10 points)

Answer Consider a system with 4 GB of RAM, an L3 cache, and 4 KB pages. What is the minimum TLB size that could prevent most TLB misses for data already in the cache?  The TLB should cover the whole L3 cache: If cache size is 1 MB:  1 MB/4 KB = 256 entries If cache size is 2 MB:  2 MB/4 KB = 512 entries

Third question In the ARC cache replacement policy, which events result in an update of target_T1? (2×10 points)  Target_T1 will increase when  Target_T1 will decrease when

Answer In the ARC cache replacement policy, which events result in an update of target_T1? (2×10 points)  Target_T1 will increase when a page fault brings in the cache a page in B1, the bottom part of L1  Target_T1 will decrease when a page fault brings in the cache a page in B2, the bottom part of L2

Fourth question What is the main limitation of the Nooks extension recovery mechanism?

Answer What is the main limitation of the Nooks extension recovery mechanism?  It does not work for all extensions: Some extensions cannot be safely killed and restarted

Fifth question Under which conditions do MCS locks perform best? Why?

Answer Under which conditions do MCS locks perform best? Why?  MCS locks perform best at high contention rates because each contending core spins on a separate location. Result is no cache coherence broadcasts

Sixth question A system of physical clocks consists of two clocks, namely, one that is fast and advances by x minutes every hour and another that neither fast nor slow. Assuming that the clocks are managed by Lamport’s physical clock protocol, what will be the time marked by each clock at 4 pm given that:  Both clocks indicated the correct time at noon;  The processors on which the clocks resides continuously exchanged messages between themselves from noon to two pm ; and  Message transmission delays are negligible.

Answer for x = 4 minutes Actual timeFast clockRegular clock Noon12:00 pm 1 pm1:04 pm 2 pm2:08 pm 3 pm3:12 pm3:08 pm 4 pm4:16 pm4:08 pm

Answer for x = 5 minutes Actual timeFast clockRegular clock Noon12:00 pm 1 pm1:05 pm 2 pm2:10 pm 3 pm3:15 pm3:10 pm 4 pm4:20 pm4:10 pm