Cellular Disco Resource management using virtual clusters on shared-memory multiprocessors.

Slides:



Advertisements
Similar presentations
Multiple Processor Systems
Advertisements

CS 443 Advanced OS Fabián E. Bustamante, Spring 2005 Memory Resource Management in VMware ESX Server Carl A. Waldspurger VMware, Inc. Appears in SOSDI.
Virtualization Technology
Disco: Running Commodity Operation Systems on Scalable Multiprocessors E Bugnion, S Devine, K Govil, M Rosenblum Computer Systems Laboratory, Stanford.
1 Disco: Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine, Mendel Rosenblum, Stanford University, 1997 Presented.
Study of Hurricane and Tornado Operating Systems By Shubhanan Bakre.
VSphere vs. Hyper-V Metron Performance Showdown. Objectives Architecture Available metrics Challenges in virtual environments Test environment and methods.
KMemvisor: Flexible System Wide Memory Mirroring in Virtual Environments Bin Wang Zhengwei Qi Haibing Guan Haoliang Dong Wei Sun Shanghai Key Laboratory.
Multiple Processor Systems
Computer Architecture Introduction to MIMD architectures Ola Flygt Växjö University
Hardware Support for Spin Management in Overcommitted Virtual Machines Philip Wells Koushik Chakraborty Gurindar Sohi {pwells, kchak,
Disco Running Commodity Operating Systems on Scalable Multiprocessors Presented by Petar Bujosevic 05/17/2005 Paper by Edouard Bugnion, Scott Devine, and.
Project Overview 2014/05/05 1. Current Project “Research on Embedded Hypervisor Scheduler Techniques” ◦ Design an energy-efficient scheduling mechanism.
Introduction to MIMD architectures
Multiprocessors CS 6410 Ashik Ratnani, Cornell University.
Disco: Running Commodity Operating Systems on Scalable Multiprocessors Bugnion et al. Presented by: Ahmed Wafa.
G Robert Grimm New York University Disco.
Disco Running Commodity Operating Systems on Scalable Multiprocessors.
Disco Running Commodity Operating Systems on Scalable Multiprocessors.
1 Disco: Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine, and Mendel Rosenblum, Stanford University, 1997.
The Design of Robust and Efficient Microkernel ManRiX, The Design of Robust and Efficient Microkernel Presented by: Manish Regmi
Multiprocessors Deniz Altinbuken 09/29/09.
Xen and the Art of Virtualization Paul Barham, Boris Dragovic, Keir Fraser, Steven Hand, Tim Harris, Alex Ho, Rolf Neugebauer, Ian Pratt, Andrew Warfield.
MULTICOMPUTER 1. MULTICOMPUTER, YANG DIPELAJARI Multiprocessors vs multicomputers Interconnection topologies Switching schemes Communication with messages.
Distributed Systems CS Virtualization- Overview Lecture 22, Dec 4, 2013 Mohammad Hammoud 1.
Design and Implementation of a Single System Image Operating System for High Performance Computing on Clusters Christine MORIN PARIS project-team, IRISA/INRIA.
Zen and the Art of Virtualization Paul Barham, et al. University of Cambridge, Microsoft Research Cambridge Published by ACM SOSP’03 Presented by Tina.
Cellular Disco: resource management using virtual clusters on shared memory multiprocessors Published in ACM 1999 by K.Govil, D. Teodosiu,Y. Huang, M.
Microkernels, virtualization, exokernels Tutorial 1 – CSC469.
Disco : Running commodity operating system on scalable multiprocessor Edouard et al. Presented by Jonathan Walpole (based on a slide set from Vidhya Sivasankaran)
CS533 Concepts of Operating Systems Jonathan Walpole.
 What is an operating system? What is an operating system?  Where does the OS fit in? Where does the OS fit in?  Services provided by an OS Services.
Multiple Processor Systems. Multiprocessor Systems Continuous need for faster and powerful computers –shared memory model ( access nsec) –message passing.
Kinshuk Govil, Dan Teodosiu*, Yongqiang Huang, and Mendel Rosenblum
Embedded System Lab. 오명훈 Memory Resource Management in VMware ESX Server Carl A. Waldspurger VMware, Inc. Palo Alto, CA USA
Our work on virtualization Chen Haogang, Wang Xiaolin {hchen, Institute of Network and Information Systems School of Electrical Engineering.
CS533 Concepts of Operating Systems Jonathan Walpole.
Disco: Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine, and Mendel Rosenblum Summary By A. Vincent Rayappa.
Multiple Processor Systems. Multiprocessor Systems Continuous need for faster computers –shared memory model ( access nsec) –message passing multiprocessor.
Chapter 8-2 : Multicomputers Multiprocessors vs multicomputers Multiprocessors vs multicomputers Interconnection topologies Interconnection topologies.
Disco: Running Commodity Operating Systems on Scalable Multiprocessors Edouard et al. Madhura S Rama.
Supporting Multi-Processors Bernard Wong February 17, 2003.
Disco : Running commodity operating system on scalable multiprocessor Edouard et al. Presented by Vidhya Sivasankaran.
Computer Science Lecture 7, page 1 CS677: Distributed OS Multiprocessor Scheduling Will consider only shared memory multiprocessor Salient features: –One.
A. Frank - P. Weisberg Operating Systems Structure of Operating Systems.
VMWare MMU Ranjit Kolkar. Designed for efficient use of resources. ESX uses high-level resource management policies to compute a target memory allocation.
Full and Para Virtualization
6.894: Distributed Operating System Engineering Lecturers: Frans Kaashoek Robert Morris
Technical Reading Report Virtual Power: Coordinated Power Management in Virtualized Enterprise Environment Paper by: Ripal Nathuji & Karsten Schwan from.
Disco: Running Commodity Operating Systems on Scalable Multiprocessors Presented by: Pierre LaBorde, Jordan Deveroux, Imran Ali, Yazen Ghannam, Tzu-Wei.
Advanced Computer Architecture pg 1 Embedded Computer Architecture 5SAI0 Chip Multi-Processors (ch 8) Henk Corporaal
Memory Resource Management in VMware ESX Server By Carl A. Waldspurger Presented by Clyde Byrd III (some slides adapted from C. Waldspurger) EECS 582 –
Primitive Concepts of Distributed Systems Chapter 1.
Presented by: Sagnik Bhattacharya Kingshuk Govil, Dan Teodosiu, Yongjang Huang, Mendel Rosenblum.
Process Scheduling III ( 5.4, 5.7) CPE Operating Systems
Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine and Mendel Rosenblum Presentation by Mark Smith.
Virtualization Technology
Virtual Machines Disco and Xen (Lecture 10, cs262a)
Multiprocessor Virtualization
Reactive NUMA A Design for Unifying S-COMA and CC-NUMA
Reactive NUMA: A Design for Unifying S-COMA and CC-NUMA
Embedded Computer Architecture 5SAI0 Chip Multi-Processors (ch 8)
Disco: Running Commodity Operating Systems on Scalable Multiprocessors
Page Replacement.
Multiple Processor Systems
Virtual Machines Disco and Xen (Lecture 10, cs262a)
Process Migration Troy Cogburn and Gilbert Podell-Blume
High Performance Computing
Virtual Memory: Working Sets
CSE 542: Operating Systems
Presentation transcript:

Cellular Disco Resource management using virtual clusters on shared-memory multiprocessors

NUMA - Multiprocessor Systems ● Hardware-based approach – Requires only very small operating system changes – Fault isolation – Lacks resource sharing and flexibility – Example: Unisys' Cellular Multiprocessing architecture ● Software-based approach – Backwards compatibility – Significant development effort – No fault containment – Example: SGI's IRIX, Tornado and K42, Hive

Goals ● Combine advantages of hardware-based approach and software-based approach using a Hypervisor/VMM – Small hypervisor – Hardware fault containment – Ressource management ● Scalability ● Load balancing – Unmodified guest OS

Design Cellular Disco CP U Interconnect Virtual MachineVM ApplicationApp OS Operating System 32-processor SGI Origin

Fault Containment ● Software fault containment – Straight forward due to virtual machines ● Hardware fault containment – Semi-independent cells: ● Duplicated code ● Local data (Pmap, Memmap, Local ready queue) ● Manages all local memory pages – Hardware support needed

Resource Management ➔ Scalability ➔ Overcommitment of resources ➔ Load balancing ● CPU management – VCPU migration – Gang scheduling ● Memory management – Memory borrowing – Avoid double paging overhead

VCPU Migration – Intra-node migration ● 27 μs to update ready queue ● refillt cache – Intra-cell migration ● 520 μ s to copy L2TLB ● Dynamic memory migration and replication to avoid remote cache misses – Inter-call migration ● 1520 μ s to update data structures ● Conflicts with fault containment

CPU Load Balancing VM Cellular Disco CP U Interconnect VM VMVM VMVM

CPU Balancing Policies ● Idle balancer – Intra-cell balancing – Restricted by gang scheduling ● Periodic balancer – Inter-cell balancing – Maintains load tree – Period is tunable A0A0 CP U 0 CP U 1 CP U CP U 3 A1A1 B0B0 B1B1 B1B1 fault containment boundary

Memory Balancing Policy ● Every VM has allocation preference list ● Threshold: local free memory drops below 16MB ● Borrow 4MB of memory from each cell in the list ● Cells loan memory as long as they have more than 32MB available ● Costs about 758 μ s for 4MB ● Paging as a last recourse

MP Virtualization Overhead ● Worst case uniprocessor overhead only 9% +10 % +20 % +1 % +4 %

Performance Results ● CPU utilization: 31% (HW) vs. 58% (VC)

Questions ● Conflicting mechanisms? ● Can we build a scalable system without global heuristics? ● How to fit this approach into a microkernel architecture?