Transparent Contribution of Memory

Slides:



Advertisements
Similar presentations
1 Storage-Aware Caching: Revisiting Caching for Heterogeneous Systems Brian Forney Andrea Arpaci-Dusseau Remzi Arpaci-Dusseau Wisconsin Network Disks University.
Advertisements

Virtual Memory main memory can act as a cache for secondary storage motivation: Allow programs to use more memory that there is available transparent to.
CSC 4250 Computer Architectures December 8, 2006 Chapter 5. Memory Hierarchy.
U NIVERSITY OF M ASSACHUSETTS A MHERST Department of Computer Science CRAMM: Virtual Memory Support for Garbage-Collected Applications Ting Yang, Emery.
Operating System Support Focus on Architecture
Virtual Memory Chapter 8. Hardware and Control Structures Memory references are dynamically translated into physical addresses at run time –A process.
Improving Proxy Cache Performance: Analysis of Three Replacement Policies Dilley, J.; Arlitt, M. A journal paper of IEEE Internet Computing, Volume: 3.
U NIVERSITY OF M ASSACHUSETTS Department of Computer Science Automatic Heap Sizing Ting Yang, Matthew Hertz Emery Berger, Eliot Moss University of Massachusetts.
Modified from Silberschatz, Galvin and Gagne Lecture 15 Chapter 8: Main Memory.
Computer Organization and Architecture
Virtual Memory I Chapter 8.
Memory: Virtual MemoryCSCE430/830 Memory Hierarchy: Virtual Memory CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Operating Systems CMPSCI 377 Lecture.
Idle virtual machine detection in FermiCloud Giovanni Franzini September 21, 2012 Scientific Computing Division Grid and Cloud Computing Department.
1 Efficient Management of Data Center Resources for Massively Multiplayer Online Games V. Nae, A. Iosup, S. Podlipnig, R. Prodan, D. Epema, T. Fahringer,
Defining Anomalous Behavior for Phase Change Memory
Operating Systems  By the end of this session, you will know: What an Operating System is. The functions it performs.
Predicting performance of applications and infrastructures Tania Lorido 27th May 2011.
« Performance of Compressed Inverted List Caching in Search Engines » Proceedings of the International World Wide Web Conference Commitee, Beijing 2008)
Processes and OS basics. RHS – SOC 2 OS Basics An Operating System (OS) is essentially an abstraction of a computer As a user or programmer, I do not.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
July 30, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 8: Exploiting Memory Hierarchy: Virtual Memory * Jeremy R. Johnson Monday.
A User-Lever Concurrency Manager Hongsheng Lu & Kai Xiao.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science 1 Automatic Heap Sizing: Taking Real Memory into Account Ting Yang, Emery Berger,
University of Massachusetts, Amherst TFS: A Transparent File System for Contributory Storage James Cipar, Mark Corner, Emery Berger
Memory. Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation.
1 Virtual Machine Memory Access Tracing With Hypervisor Exclusive Cache USENIX ‘07 Pin Lu & Kai Shen Department of Computer Science University of Rochester.
1 CMSC421: Principles of Operating Systems Nilanjan Banerjee Principles of Operating Systems Acknowledgments: Some of the slides are adapted from Prof.
Memory Thrashing Protection in Multi-Programming Environment Xiaodong Zhang Ohio State University In collaborations with Song Jiang (Wayne State University)
Replicating Memory Behavior for Performance Skeletons Aditya Toomula PC-Doctor Inc. Reno, NV Jaspal Subhlok University of Houston Houston, TX By.
1 Memory Management. 2 Fixed Partitions Legend Free Space 0k 4k 16k 64k 128k Internal fragmentation (cannot be reallocated) Divide memory into n (possible.
Main Memory. Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The.
Virtual Memory The memory space of a process is normally divided into blocks that are either pages or segments. Virtual memory management takes.
Efficient Live Checkpointing Mechanisms for computation and memory-intensive VMs in a data center Kasidit Chanchio Vasabilab Dept of Computer Science,
1/22 Optimization of Google Cloud Task Processing with Checkpoint-Restart Mechanism Speaker: Sheng Di Coauthors: Yves Robert, Frédéric Vivien, Derrick.
Project Presentation By: Dean Morrison 12/6/2006 Dynamically Adaptive Prepaging for Effective Virtual Memory Management.
A BRIEF INTRODUCTION TO CACHE LOCALITY YIN WEI DONG 14 SS.
DynamicMR: A Dynamic Slot Allocation Optimization Framework for MapReduce Clusters Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
Presented by Vishy Grandhi.  Lesson 1: AX Overview  Lesson 2: Role based security  Lesson 3: Monitoring  Troubleshooting.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 31 Memory Management.
1 Contents Memory types & memory hierarchy Virtual memory (VM) Page replacement algorithms in case of VM.
1 Supporting a Volume Rendering Application on a Grid-Middleware For Streaming Data Liang Chen Gagan Agrawal Computer Science & Engineering Ohio State.
Improving Multi-Core Performance Using Mixed-Cell Cache Architecture
Memory Thrashing Protection in Multi-Programming Environment
Memory Management.
Exploiting Sharing for Data Center Consolidation
Operating System Protection Through Program Evolution
Memory Thrashing Protection in Multi-Programming Environment
KERNEL ARCHITECTURE.
Auburn University COMP7500 Advanced Operating Systems I/O-Aware Load Balancing Techniques (2) Dr. Xiao Qin Auburn University.
Virtual Memory Chapter 8.
Economics, Administration & Information system
Lecture 14 Virtual Memory and the Alpha Memory Hierarchy
Lecture 27: Virtual Memory
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 8 11/24/2018.
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 9 12/1/2018.
A Simulator to Study Virtual Memory Manager Behavior
Transparent Contribution of Memory
Contents Memory types & memory hierarchy Virtual memory (VM)
It’s Time for a Break!!!.
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 9 4/5/2019.
Lecture 3: Main Memory.
Virtual Memory: Working Sets
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.
OPERATING SYSTEMS MEMORY MANAGEMENT BY DR.V.R.ELANGOVAN.
Student : Yan Wang student ID:
Sarah Diesburg Operating Systems CS 3430
CSE 542: Operating Systems
Module IV Memory Organization.
Efficient Migration of Large-memory VMs Using Private Virtual Memory
Presentation transcript:

Transparent Contribution of Memory James Cipar, Mark Corner, Emery Berger University of Massachusetts, Amherst

Motivation Applications depend on contributed resources CPU cycles, disk space, memory, network bandwidth etc. Condor, Folding/SETI@home Compete with local applications for memory Up to 50% performance impact on local applications

Transparent Memory Manager Operating system mechanism Contributory applications can be run as-is No special programming techniques or recompilation Contribute memory without affecting local performance Detects local application’s working set size Limits contributory applications accordingly Dynamically adjusts to local working set Can protect the performance of any local working set Gives as much memory as possible to contributory applications

Overview: What it Does Trace memory accesses of local applications Simulate LRU queue of local memory Include out-of-core memory in simulation Determine local working set size Limit contributory applications to the leftovers

Measuring Working Set Size Trace memory accesses Simulate LRU queue Cumulative histogram of LRU access pattern This shows predicted hit rate for any allocation Allow a 5% increase in miss rate

Experimental Setup Compare TMM to static allocations How much memory is contributed What is the performance impact Three typical working sets of different sizes Web browsing Viewing a large image Plotting a large dataset User takes a break, and resumes after a few minutes Contributory application runs during break Record page faults after user resumes work

Amount of Memory Contributed

Local Application’s Page Faults

Related Work

Conclusions Dynamically determines appropriate memory limits Prevents local applications from being swapped out Allows memory-intensive contributory applications