Black-box and Gray-box Strategies for Virtual Machine Migration

Size: px
Start display at page:

Download "Black-box and Gray-box Strategies for Virtual Machine Migration"

Transcription

1 Full Review On the paper Black-box and Gray-box Strategies for Virtual Machine Migration (Time required: 7 hours) By Nikhil Ramteke Sr. No

2 1. Introduction Migration is transparent to application and all modern VM supports it. Currently migration is handled manually. Migration may require other VM to shuffle for load balance. While load balancing CPU, N/W & memory issue arise. Paper deals with black-box and gray-box strategies. Technique include Monitoring system resource usage, Hotspot detection, Determine new mapping, Initiate necessary migration. Black-box monitoring : Observes each VM from outside Gray-box monitoring: Observes OS- level statistics. Sandpiper can support either Black-box or Gray-box or both simultaneously using following 2 algorithms Hotspot detection algorithm: when to migrate, Hotspot migration algorithm: what, where to migrate + how much resource allocation is to be done at new location. 2. Background and System Overview Current provisioning allocates more or less CPU s according to need but don t move VM s practically. If VM is moved, application won t know it, so its better option rather to move application. Sandpiper: tool which moves VM s across servers in data-center depending on resource usages of CPU, N/W interface and disk/memory. Top-down Architecture of Sandpiper Physical Machine (PM) Virtual Machine Monitor (VMM) VM s with special component called nucleus which runs in special VM called DOM-0

3 Nucleus gathers information about statistics over each server using monitoring engine. It delivers this information to Sandpiper control panel (SCP) SCP collets information from all VM s on each PM, and checks the resources usage if crossing some threshold value. IF so, then it computes what to move, where to move and then how much resources should be granted to move VM, and if all condition satisfies, it moves VM to another feasible location. 3. Monitoring and Profiling in Sandpiper Unobtrusive Black-box Monitoring Monitoring engine in nucleus periodically reports to SCP with resource usage statistics. Either hypervisor or DOM-0 can act as IO monitor and can thus collect the statistics and CPU usage can be tackled by observing the CPU scheduling movements by using XenMon. Domain-0 overhead is distributed on all rest of the VM s equally. Domain-0 has N/W interface driver of Xen. Other domain attaches to driver through VFR and then monitoring engine can measure the N/W usage. Memory utilization is known to OS within each VM. Shadow page table is used for getting this info but it causes lots of overhead. Alternative can be to use swap activity observation, i.e. measure memory usage by read/write statistics. Gray-box Monitoring Black-box strategy can t move inside the VM to gather the statistics. Gray-box monitoring implements a daemon process which moves into the VM and collects the statistics through logs, DB servers etc, and thus can detect SLA violation easily.

4 Profile Generation Profile engine receives information; compute usage profile for each VM & PM, then maintains the history of it. Black-box: maintains profile of CPU utilization, N/W bandwidth and swap rate. Gray-box: maintains profile of memory utilization, service time, required drop rate and incoming request rate. Profile contains the distribution of usage of resources. This profile is used for futures resource requirements and for decisions of migration of VM s. The time-series profile is abstraction of the profile mentioned above and is used for hotspot detection. 4. Hotspot Detection Hotspot detection algorithm makes decision to migrate VM or not. If some threshold value is crossed, this algorithm is invoked. Black-box works per-pm and Gray-box works per-vm. Algorithm is invoked on at least k+1 out of n violations of threshold. (Threshold) α (1/ migration) α (server utilization) Time-series is used to predict the future values. 5. Resource Provisioning Before migration, resources availability is checked. Black-box provisioning CPU and N/W bandwidth values are predicted by observing the trailing values over certain time window. VM can get more to what it has been allocated only if other VMs are underutilized. (Not applicable to memory issue.) If all VM s are fully utilized, VM that is expecting more has to be satisfy with its own shear fully, and this statistics can be further used for future value prediction by adding some +Δ value to original shear.

5 Gray-box Provisioning It uses information in the logs to estimate peak uses. Peak can be measured even if resource is being fully utilized. Incoming requests= serviced request + dropped request. Let w-cpu weight given to VM, then weight w = + λpeak λpeak, >1 =, h N/W usage= peak arrival rate X required file size. 6. Hotspot Migration Migration algorithm determines new allocation/mapping (NP-hard) and migration mechanism is applied iteratively, It requires N/W bandwidth and thus affects the performance. Capturing multidimensional loads Overall load of VM = volume Migration Phase PM s and VM s are ordered a/c to volume. While(utilization of all resources of PM < threshold) { For all VM s Check if any server has sufficient volume to accommodate it If (yes) move it Else move to next VM (current VM requirement can t be satisfied) } Swap If migration fails, its alternative While(hotspot is resolved or all VM s are visited) { -Consider the highest loaded VM

6 -Consider the lowest loaded server and consider k VM s on it such that after their migration server lefts behind with sufficient volume to accommodate highest loaded VM. -swap the k VM s and highest loaded VM. } 7. Implementation and Evaluation Black-box monitoring requires access to Dom-0 Gray box has 2 components A Linux OS daemon (runs on Each VM) Apache daemon (log analyzer + Dispatcher) Migration Effectiveness Due to move of highest loaded VM, while data transfer, transfer load is maximized. Virtual Machine Swaps If there is high average utilization, migration chances increases due to swap with penalty of more overhead. Mixed Resource Workload Takes care of each resource hotspot individually and resolves the hotspot. Gray v. Black: Memory Allocation Black-box can directly measure memory usage, while Gray-box has that capability and thus can detect memory over provisioning which in turns reduces the swapping. Gray v. Black: Apache Performance Black box don t have good statistics to fulfill the resources needs, while Gray-box has application level access and thus can better understand the needs, and it helps to improve the migration decision. Prototype Data Center Evaluation Sandpiper can deal with multiple hotspots together, overloaded servers are processed during migration phase also.

7 System Overhead and Scalability CPU and IO overhead of tool: negligible. Time for placement algorithm- increases with increase in number of VM s, distributed computation is suggested as solution. Stability during Overhead If half of the servers are overloaded, hotspots can be resolved with one migration per machine, otherwise swaps are required and can be managed till certain extent, after which Sandpiper quits resolving. Tuning Sandpiper Setting Threshold: If threshold is kept high, then migration overhead may violate SLA. (75% for CPU and N/W is suggested) Sustained Overload Requirement: Sandpiper doesn t have choices for different measurement interval, and committed unsurely about Δ factor. 8. Related work Background of Migration. Comparison of Sandpiper with Dedicated hosting and Shared hosting. 9. Conclusion: Migration is good solution to enhance the performance of virtualization Black-box: can deal with simultaneous hotspot which can come in package of multiple hotspots. Gray-box: increases the responsiveness of Sandpiper. Sandpiper: good establishment with nice mechanisms. Little more work with uncertainty of some parameters can take tool at very high level.

8 Further research: Xen is yet to implement a fair-scheduler. Can it be Solution? : Why don t we start will all CPU s giving 0 weight and then scale upwards as needed? Of course there will be higher limit on the server threshold, in case, some higher priority server feels to get CPU and getting less than its peak weight, other CPU processes which are over utilizing can be then shifted to new place or rescheduled. It will save time for checking the boundaries of other CPU every time while asking for more. We need to schedule only when overall CPU usage is at peak. So there is no need of computing and observing time slice frequently which may save lots of overhead. Swapping deals with 2 servers only, can be extended with multiple servers. Work is going on with automatic determination of whether to migrate VM or to replicate it for more resource generation. Limitation: Sandpiper works only on Xen architecture. Sandpiper works only for FIFO virtual machine monitor. While migration swap phase can t consider more than 2-servers. Suggestions: All storage is assumed to be on N/W file system, thereby eliminating need to move disk state during VM migration. Comment: Can it really be entertained? Doesn t it try to skip count of overhead caused due to it? Do we really need to give the separate VM for nucleus? Can t it be managed with some application to be hosted on some low overhead sever? Anyway the CPU and IO load results are negligible, so won t affect much in fully overloaded situation.

9 I didn t understand Explanation of 7.6 Fig. 5 I didn t like: Xen allocates USER SPECIFIED memory to each VM and requires the OS within VM to manage that memory. Spelling mistake on 5 th page, 1 st column, 2 nd row, back-box black-box Fig.3 is not clear with X, Y parameters. Explanation of last 2 paragraphs in point 8. I like: Rest all things.

SANDPIPER: BLACK-BOX AND GRAY-BOX STRATEGIES FOR VIRTUAL MACHINE MIGRATION

SANDPIPER: BLACK-BOX AND GRAY-BOX STRATEGIES FOR VIRTUAL MACHINE MIGRATION SANDPIPER: BLACK-BOX AND GRAY-BOX STRATEGIES FOR VIRTUAL MACHINE MIGRATION Timothy Wood, Prashant Shenoy, Arun Venkataramani, and Mazin Yousif * University of Massachusetts Amherst * Intel, Portland Data

More information

Computer Networks 53 (2009) Contents lists available at ScienceDirect. Computer Networks. journal homepage:

Computer Networks 53 (2009) Contents lists available at ScienceDirect. Computer Networks. journal homepage: Computer Networks 53 (29) 2923 2938 Contents lists available at ScienceDirect Computer Networks journal homepage: www.elsevier.com/locate/comnet Sandpiper: Black-box and gray-box resource management for

More information

Πποχωπημένη Κατανεμημένη Υπολογιστική

Πποχωπημένη Κατανεμημένη Υπολογιστική Πποχωπημένη Κατανεμημένη Υπολογιστική ΗΥ623 Διδάζκων Δημήηριος Καηζαρός @ Τμ. ΗΜΜΥ Πανεπιστήμιο Θεσσαλίαρ Διάλεξη 3η 1 Virtualization Concepts Definitions Virtualization A layer mapping its visible interface

More information

Adaptive Resync in vsan 6.7 First Published On: Last Updated On:

Adaptive Resync in vsan 6.7 First Published On: Last Updated On: First Published On: 04-26-2018 Last Updated On: 05-02-2018 1 Table of Contents 1. Overview 1.1.Executive Summary 1.2.vSAN's Approach to Data Placement and Management 1.3.Adaptive Resync 1.4.Results 1.5.Conclusion

More information

Announcements. Program #1. Program #0. Reading. Is due at 9:00 AM on Thursday. Re-grade requests are due by Monday at 11:59:59 PM.

Announcements. Program #1. Program #0. Reading. Is due at 9:00 AM on Thursday. Re-grade requests are due by Monday at 11:59:59 PM. Program #1 Announcements Is due at 9:00 AM on Thursday Program #0 Re-grade requests are due by Monday at 11:59:59 PM Reading Chapter 6 1 CPU Scheduling Manage CPU to achieve several objectives: maximize

More information

CPU Scheduling (1) CPU Scheduling (Topic 3) CPU Scheduling (2) CPU Scheduling (3) Resources fall into two classes:

CPU Scheduling (1) CPU Scheduling (Topic 3) CPU Scheduling (2) CPU Scheduling (3) Resources fall into two classes: CPU Scheduling (Topic 3) 홍성수 서울대학교공과대학전기공학부 Real-Time Operating Systems Laboratory CPU Scheduling (1) Resources fall into two classes: Preemptible: Can take resource away, use it for something else, then

More information

Announcements. Reading. Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) CMSC 412 S14 (lect 5)

Announcements. Reading. Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) CMSC 412 S14 (lect 5) Announcements Reading Project #1 due in 1 week at 5:00 pm Scheduling Chapter 6 (6 th ed) or Chapter 5 (8 th ed) 1 Relationship between Kernel mod and User Mode User Process Kernel System Calls User Process

More information

Abstract. Testing Parameters. Introduction. Hardware Platform. Native System

Abstract. Testing Parameters. Introduction. Hardware Platform. Native System Abstract In this paper, we address the latency issue in RT- XEN virtual machines that are available in Xen 4.5. Despite the advantages of applying virtualization to systems, the default credit scheduler

More information

Distributed Autonomous Virtual Resource Management in Datacenters Using Finite- Markov Decision Process

Distributed Autonomous Virtual Resource Management in Datacenters Using Finite- Markov Decision Process Distributed Autonomous Virtual Resource Management in Datacenters Using Finite- Markov Decision Process Liuhua Chen, Haiying Shen and Karan Sapra Department of Electrical and Computer Engineering Clemson

More information

Server Virtualization Approaches

Server Virtualization Approaches Server Virtualization Approaches Virtual Machine Applications Emulation Replication Composition Emulation: Mix-and-match cross-platform portability Replication: Multiple VMs on single platform Composition:

More information

Multi-Level Feedback Queues

Multi-Level Feedback Queues CS 326: Operating Systems Multi-Level Feedback Queues Lecture 8 Today s Schedule Building an Ideal Scheduler Priority-Based Scheduling Multi-Level Queues Multi-Level Feedback Queues Scheduling Domains

More information

Process- Concept &Process Scheduling OPERATING SYSTEMS

Process- Concept &Process Scheduling OPERATING SYSTEMS OPERATING SYSTEMS Prescribed Text Book Operating System Principles, Seventh Edition By Abraham Silberschatz, Peter Baer Galvin and Greg Gagne PROCESS MANAGEMENT Current day computer systems allow multiple

More information

Task Scheduling of Real- Time Media Processing with Hardware-Assisted Virtualization Heikki Holopainen

Task Scheduling of Real- Time Media Processing with Hardware-Assisted Virtualization Heikki Holopainen Task Scheduling of Real- Time Media Processing with Hardware-Assisted Virtualization Heikki Holopainen Aalto University School of Electrical Engineering Degree Programme in Communications Engineering Supervisor:

More information

Optimal Algorithm. Replace page that will not be used for longest period of time Used for measuring how well your algorithm performs

Optimal Algorithm. Replace page that will not be used for longest period of time Used for measuring how well your algorithm performs Optimal Algorithm Replace page that will not be used for longest period of time Used for measuring how well your algorithm performs page 1 Least Recently Used (LRU) Algorithm Reference string: 1, 2, 3,

More information

Frequently asked questions from the previous class survey

Frequently asked questions from the previous class survey CS 370: OPERATING SYSTEMS [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University L15.1 Frequently asked questions from the previous class survey Could we record burst times in

More information

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 10 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Chapter 6: CPU Scheduling Basic Concepts

More information

Scheduling II. Today. Next Time. ! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling. !

Scheduling II. Today. Next Time. ! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling. ! Scheduling II Today! Proportional-share scheduling! Multilevel-feedback queue! Multiprocessor scheduling Next Time! Memory management Scheduling with multiple goals! What if you want both good turnaround

More information

PAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo

PAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo PAGE REPLACEMENT Operating Systems 2015 Spring by Euiseong Seo Today s Topics What if the physical memory becomes full? Page replacement algorithms How to manage memory among competing processes? Advanced

More information

OPERATING SYSTEMS. After A.S.Tanenbaum, Modern Operating Systems, 3rd edition. Uses content with permission from Assoc. Prof. Florin Fortis, PhD

OPERATING SYSTEMS. After A.S.Tanenbaum, Modern Operating Systems, 3rd edition. Uses content with permission from Assoc. Prof. Florin Fortis, PhD OPERATING SYSTEMS #5 After A.S.Tanenbaum, Modern Operating Systems, 3rd edition Uses content with permission from Assoc. Prof. Florin Fortis, PhD General information GENERAL INFORMATION Cooperating processes

More information

instruction is 6 bytes, might span 2 pages 2 pages to handle from 2 pages to handle to Two major allocation schemes

instruction is 6 bytes, might span 2 pages 2 pages to handle from 2 pages to handle to Two major allocation schemes Allocation of Frames How should the OS distribute the frames among the various processes? Each process needs minimum number of pages - at least the minimum number of pages required for a single assembly

More information

ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Processes and threads

ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Processes and threads ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective Part I: Operating system overview: Processes and threads 1 Overview Process concept Process scheduling Thread

More information

CS 326: Operating Systems. CPU Scheduling. Lecture 6

CS 326: Operating Systems. CPU Scheduling. Lecture 6 CS 326: Operating Systems CPU Scheduling Lecture 6 Today s Schedule Agenda? Context Switches and Interrupts Basic Scheduling Algorithms Scheduling with I/O Symmetric multiprocessing 2/7/18 CS 326: Operating

More information

Virtual Machine Placement in Cloud Computing

Virtual Machine Placement in Cloud Computing Indian Journal of Science and Technology, Vol 9(29), DOI: 10.17485/ijst/2016/v9i29/79768, August 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Virtual Machine Placement in Cloud Computing Arunkumar

More information

Memory: Paging System

Memory: Paging System Memory: Paging System Instructor: Hengming Zou, Ph.D. In Pursuit of Absolute Simplicity 求于至简, 归于永恒 Content Paging Page table Multi-level translation Page replacement 2 Paging Allocate physical memory in

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 23 Virtual memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ Is a page replaces when

More information

Mark Sandstrom ThroughPuter, Inc.

Mark Sandstrom ThroughPuter, Inc. Hardware Implemented Scheduler, Placer, Inter-Task Communications and IO System Functions for Many Processors Dynamically Shared among Multiple Applications Mark Sandstrom ThroughPuter, Inc mark@throughputercom

More information

Application of SDN: Load Balancing & Traffic Engineering

Application of SDN: Load Balancing & Traffic Engineering Application of SDN: Load Balancing & Traffic Engineering Outline 1 OpenFlow-Based Server Load Balancing Gone Wild Introduction OpenFlow Solution Partitioning the Client Traffic Transitioning With Connection

More information

CS3733: Operating Systems

CS3733: Operating Systems CS3733: Operating Systems Topics: Process (CPU) Scheduling (SGG 5.1-5.3, 6.7 and web notes) Instructor: Dr. Dakai Zhu 1 Updates and Q&A Homework-02: late submission allowed until Friday!! Submit on Blackboard

More information

Virtualization and memory hierarchy

Virtualization and memory hierarchy Virtualization and memory hierarchy Computer Architecture J. Daniel García Sánchez (coordinator) David Expósito Singh Francisco Javier García Blas ARCOS Group Computer Science and Engineering Department

More information

Chapter 3 Virtualization Model for Cloud Computing Environment

Chapter 3 Virtualization Model for Cloud Computing Environment Chapter 3 Virtualization Model for Cloud Computing Environment This chapter introduces the concept of virtualization in Cloud Computing Environment along with need of virtualization, components and characteristics

More information

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5 OPERATING SYSTEMS CS3502 Spring 2018 Processor Scheduling Chapter 5 Goals of Processor Scheduling Scheduling is the sharing of the CPU among the processes in the ready queue The critical activities are:

More information

TA7750 Understanding Virtualization Memory Management Concepts. Kit Colbert, Principal Engineer, VMware, Inc. Fei Guo, Sr. MTS, VMware, Inc.

TA7750 Understanding Virtualization Memory Management Concepts. Kit Colbert, Principal Engineer, VMware, Inc. Fei Guo, Sr. MTS, VMware, Inc. TA7750 Understanding Virtualization Memory Management Concepts Kit Colbert, Principal Engineer, VMware, Inc. Fei Guo, Sr. MTS, VMware, Inc. Disclaimer This session may contain product features that are

More information

Measuring VMware Environments

Measuring VMware Environments Measuring VMware Environments Massimo Orlando EPV Technologies In the last years many companies adopted VMware as a way to consolidate more Windows images on a single server. As in any other environment,

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2019 Lecture 8 Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ POSIX: Portable Operating

More information

Managing Dynamic Memory Allocations in a Cloud through Golondrina

Managing Dynamic Memory Allocations in a Cloud through Golondrina Managing Dynamic Memory Allocations in a Cloud through Golondrina 4th International DMTF Academic Alliance Workshop on Systems and Virtualization Management: Standards and the Cloud Alexander Pokluda,

More information

Transparent Throughput Elas0city for IaaS Cloud Storage Using Guest- Side Block- Level Caching

Transparent Throughput Elas0city for IaaS Cloud Storage Using Guest- Side Block- Level Caching Transparent Throughput Elas0city for IaaS Cloud Storage Using Guest- Side Block- Level Caching Bogdan Nicolae (IBM Research, Ireland) Pierre Riteau (University of Chicago, USA) Kate Keahey (Argonne National

More information

Example: CPU-bound process that would run for 100 quanta continuously 1, 2, 4, 8, 16, 32, 64 (only 37 required for last run) Needs only 7 swaps

Example: CPU-bound process that would run for 100 quanta continuously 1, 2, 4, 8, 16, 32, 64 (only 37 required for last run) Needs only 7 swaps Interactive Scheduling Algorithms Continued o Priority Scheduling Introduction Round-robin assumes all processes are equal often not the case Assign a priority to each process, and always choose the process

More information

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter Lecture Topics Today: Uniprocessor Scheduling (Stallings, chapter 9.1-9.3) Next: Advanced Scheduling (Stallings, chapter 10.1-10.4) 1 Announcements Self-Study Exercise #10 Project #8 (due 11/16) Project

More information

An Integration and Load Balancing in Data Centers Using Virtualization

An Integration and Load Balancing in Data Centers Using Virtualization An Integration and Load Balancing in Data Centers Using Virtualization USHA BELLAD #1 and JALAJA G *2 # Student M.Tech, CSE, B N M Institute of Technology, Bengaluru, India * Associate Professor, CSE,

More information

Operating Systems. Process scheduling. Thomas Ropars.

Operating Systems. Process scheduling. Thomas Ropars. 1 Operating Systems Process scheduling Thomas Ropars thomas.ropars@univ-grenoble-alpes.fr 2018 References The content of these lectures is inspired by: The lecture notes of Renaud Lachaize. The lecture

More information

Increasing Cloud Power Efficiency through Consolidation Techniques

Increasing Cloud Power Efficiency through Consolidation Techniques Increasing Cloud Power Efficiency through Consolidation Techniques Antonio Corradi, Mario Fanelli, Luca Foschini Dipartimento di Elettronica, Informatica e Sistemistica (DEIS) University of Bologna, Italy

More information

Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science

Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science Virtual Memory CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture have been largely based on those from an earlier edition of the course text Operating

More information

Chapter 8 & Chapter 9 Main Memory & Virtual Memory

Chapter 8 & Chapter 9 Main Memory & Virtual Memory Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array

More information

Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras

Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 05 Lecture 18 CPU Scheduling Hello. In this lecture, we

More information

CHAPTER 7 CONCLUSION AND FUTURE SCOPE

CHAPTER 7 CONCLUSION AND FUTURE SCOPE 121 CHAPTER 7 CONCLUSION AND FUTURE SCOPE This research has addressed the issues of grid scheduling, load balancing and fault tolerance for large scale computational grids. To investigate the solution

More information

COMPUTER ARCHITECTURE. Virtualization and Memory Hierarchy

COMPUTER ARCHITECTURE. Virtualization and Memory Hierarchy COMPUTER ARCHITECTURE Virtualization and Memory Hierarchy 2 Contents Virtual memory. Policies and strategies. Page tables. Virtual machines. Requirements of virtual machines and ISA support. Virtual machines:

More information

Subject Name: OPERATING SYSTEMS. Subject Code: 10EC65. Prepared By: Kala H S and Remya R. Department: ECE. Date:

Subject Name: OPERATING SYSTEMS. Subject Code: 10EC65. Prepared By: Kala H S and Remya R. Department: ECE. Date: Subject Name: OPERATING SYSTEMS Subject Code: 10EC65 Prepared By: Kala H S and Remya R Department: ECE Date: Unit 7 SCHEDULING TOPICS TO BE COVERED Preliminaries Non-preemptive scheduling policies Preemptive

More information

A Cool Scheduler for Multi-Core Systems Exploiting Program Phases

A Cool Scheduler for Multi-Core Systems Exploiting Program Phases IEEE TRANSACTIONS ON COMPUTERS, VOL. 63, NO. 5, MAY 2014 1061 A Cool Scheduler for Multi-Core Systems Exploiting Program Phases Zhiming Zhang and J. Morris Chang, Senior Member, IEEE Abstract Rapid growth

More information

CS533 Concepts of Operating Systems. Jonathan Walpole

CS533 Concepts of Operating Systems. Jonathan Walpole CS533 Concepts of Operating Systems Jonathan Walpole Disco : Running Commodity Operating Systems on Scalable Multiprocessors Outline Goal Problems and solutions Virtual Machine Monitors(VMM) Disco architecture

More information

Disco: Running Commodity Operating Systems on Scalable Multiprocessors

Disco: Running Commodity Operating Systems on Scalable Multiprocessors Disco: Running Commodity Operating Systems on Scalable Multiprocessors Edouard Bugnion, Scott Devine, Kinskuk Govil and Mendel Rosenblum Stanford University Presented by : Long Zhang Overiew Background

More information

Memory management, part 2: outline

Memory management, part 2: outline Memory management, part 2: outline Page replacement algorithms Modeling PR algorithms o Working-set model and algorithms Virtual memory implementation issues 1 Page Replacement Algorithms Page fault forces

More information

Xen and the Art of Virtualization. CSE-291 (Cloud Computing) Fall 2016

Xen and the Art of Virtualization. CSE-291 (Cloud Computing) Fall 2016 Xen and the Art of Virtualization CSE-291 (Cloud Computing) Fall 2016 Why Virtualization? Share resources among many uses Allow heterogeneity in environments Allow differences in host and guest Provide

More information

Distributed Operating Systems

Distributed Operating Systems 2 Distributed Operating Systems System Models, Processor Allocation, Distributed Scheduling, and Fault Tolerance Steve Goddard goddard@cse.unl.edu http://www.cse.unl.edu/~goddard/courses/csce855 System

More information

exam.100q. Number: Passing Score: 800 Time Limit: 120 min Provisioning SQL Databases

exam.100q. Number: Passing Score: 800 Time Limit: 120 min Provisioning SQL Databases 70-765.exam.100q Number: 70-765 Passing Score: 800 Time Limit: 120 min 70-765 Provisioning SQL Databases Sections 1. Implementing SQL in Azure 2. Manage databases and instances 3. Deploy and migrate applications

More information

Scheduling. Monday, November 22, 2004

Scheduling. Monday, November 22, 2004 Scheduling Page 1 Scheduling Monday, November 22, 2004 11:22 AM The scheduling problem (Chapter 9) Decide which processes are allowed to run when. Optimize throughput, response time, etc. Subject to constraints

More information

CPU Scheduling: Objectives

CPU Scheduling: Objectives CPU Scheduling: Objectives CPU scheduling, the basis for multiprogrammed operating systems CPU-scheduling algorithms Evaluation criteria for selecting a CPU-scheduling algorithm for a particular system

More information

Principles of Operating Systems

Principles of Operating Systems Principles of Operating Systems Lecture 21-23 - Virtual Memory Ardalan Amiri Sani (ardalan@uci.edu) [lecture slides contains some content adapted from previous slides by Prof. Nalini Venkatasubramanian,

More information

Announcements. Program #1. Reading. Due 2/15 at 5:00 pm. Finish scheduling Process Synchronization: Chapter 6 (8 th Ed) or Chapter 7 (6 th Ed)

Announcements. Program #1. Reading. Due 2/15 at 5:00 pm. Finish scheduling Process Synchronization: Chapter 6 (8 th Ed) or Chapter 7 (6 th Ed) Announcements Program #1 Due 2/15 at 5:00 pm Reading Finish scheduling Process Synchronization: Chapter 6 (8 th Ed) or Chapter 7 (6 th Ed) 1 Scheduling criteria Per processor, or system oriented CPU utilization

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 27 Virtualization Slides based on Various sources 1 1 Virtualization Why we need virtualization? The concepts and

More information

A three phase optimization method for precopy based VM live migration

A three phase optimization method for precopy based VM live migration DOI 10.1186/s40064-016-2642-2 RESEARCH Open Access A three phase optimization method for precopy based VM live migration Sangeeta Sharma * and Meenu Chawla *Correspondence: sanjsharma29@gmail.com Department

More information

8: Scheduling. Scheduling. Mark Handley

8: Scheduling. Scheduling. Mark Handley 8: Scheduling Mark Handley Scheduling On a multiprocessing system, more than one process may be available to run. The task of deciding which process to run next is called scheduling, and is performed by

More information

Virtualization. Pradipta De

Virtualization. Pradipta De Virtualization Pradipta De pradipta.de@sunykorea.ac.kr Today s Topic Virtualization Basics System Virtualization Techniques CSE506: Ext Filesystem 2 Virtualization? A virtual machine (VM) is an emulation

More information

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou (  Zhejiang University Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads

More information

Unit 5: Distributed, Real-Time, and Multimedia Systems

Unit 5: Distributed, Real-Time, and Multimedia Systems Unit 5: Distributed, Real-Time, and Multimedia Systems Unit Overview Unit 5 provides an extension to the core topics of operating systems. It introduces distributed systems and special-purpose operating

More information

Page Replacement. (and other virtual memory policies) Kevin Webb Swarthmore College March 27, 2018

Page Replacement. (and other virtual memory policies) Kevin Webb Swarthmore College March 27, 2018 Page Replacement (and other virtual memory policies) Kevin Webb Swarthmore College March 27, 2018 Today s Goals Making virtual memory virtual : incorporating disk backing. Explore page replacement policies

More information

Dynamic load balancing in OSIRIS

Dynamic load balancing in OSIRIS Dynamic load balancing in OSIRIS R. A. Fonseca 1,2 1 GoLP/IPFN, Instituto Superior Técnico, Lisboa, Portugal 2 DCTI, ISCTE-Instituto Universitário de Lisboa, Portugal Maintaining parallel load balance

More information

Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science

Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science Virtual Memory CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture were based on those Operating Systems Concepts, 9th ed., by Silberschatz, Galvin, and

More information

Chapter 8 Virtual Memory

Chapter 8 Virtual Memory Operating Systems: Internals and Design Principles Chapter 8 Virtual Memory Seventh Edition William Stallings Operating Systems: Internals and Design Principles You re gonna need a bigger boat. Steven

More information

Scheduling of processes

Scheduling of processes Scheduling of processes Processor scheduling Schedule processes on the processor to meet system objectives System objectives: Assigned processes to be executed by the processor Response time Throughput

More information

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process

More information

Overview of MOSIX. Prof. Amnon Barak Computer Science Department The Hebrew University.

Overview of MOSIX. Prof. Amnon Barak Computer Science Department The Hebrew University. Overview of MOSIX Prof. Amnon Barak Computer Science Department The Hebrew University http:// www.mosix.org Copyright 2006-2017. All rights reserved. 1 Background Clusters and multi-cluster private Clouds

More information

Productizing Linux Applications. What We ll Cover

Productizing Linux Applications. What We ll Cover Productizing Linux Applications Peter Ashford Ashford Computer Consulting Service 9/08/2015. What We ll Cover The first part of this presentation describes a process that will assist you in delivering

More information

Page Replacement Algorithms

Page Replacement Algorithms Page Replacement Algorithms MIN, OPT (optimal) RANDOM evict random page FIFO (first-in, first-out) give every page equal residency LRU (least-recently used) MRU (most-recently used) 1 9.1 Silberschatz,

More information

Memory management, part 2: outline. Operating Systems, 2017, Danny Hendler and Amnon Meisels

Memory management, part 2: outline. Operating Systems, 2017, Danny Hendler and Amnon Meisels Memory management, part 2: outline 1 Page Replacement Algorithms Page fault forces choice o which page must be removed to make room for incoming page? Modified page must first be saved o unmodified just

More information

ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System

ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System ProRenaTa: Proactive and Reactive Tuning to Scale a Distributed Storage System Ying Liu, Navaneeth Rameshan, Enric Monte, Vladimir Vlassov, and Leandro Navarro Ying Liu; Rameshan, N.; Monte, E.; Vlassov,

More information

Page Replacement. 3/9/07 CSE 30341: Operating Systems Principles

Page Replacement. 3/9/07 CSE 30341: Operating Systems Principles Page Replacement page 1 Page Replacement Algorithms Want lowest page-fault rate Evaluate algorithm by running it on a particular string of memory references (reference string) and computing the number

More information

Page replacement algorithms OS

Page replacement algorithms OS Page replacement algorithms OS 2007-08 1 When a page fault occurs OS has to choose a page to evict from memory If the page has been modified, the OS has to schedule a disk write of the page The page just

More information

CS2506 Quick Revision

CS2506 Quick Revision CS2506 Quick Revision OS Structure / Layer Kernel Structure Enter Kernel / Trap Instruction Classification of OS Process Definition Process Context Operations Process Management Child Process Thread Process

More information

ò mm_struct represents an address space in kernel ò task represents a thread in the kernel ò A task points to 0 or 1 mm_structs

ò mm_struct represents an address space in kernel ò task represents a thread in the kernel ò A task points to 0 or 1 mm_structs Last time We went through the high-level theory of scheduling algorithms Scheduling Today: View into how Linux makes its scheduling decisions Don Porter CSE 306 Lecture goals Understand low-level building

More information

vsan 6.6 Performance Improvements First Published On: Last Updated On:

vsan 6.6 Performance Improvements First Published On: Last Updated On: vsan 6.6 Performance Improvements First Published On: 07-24-2017 Last Updated On: 07-28-2017 1 Table of Contents 1. Overview 1.1.Executive Summary 1.2.Introduction 2. vsan Testing Configuration and Conditions

More information

Advanced Operating Systems (CS 202) Scheduling (2)

Advanced Operating Systems (CS 202) Scheduling (2) Advanced Operating Systems (CS 202) Scheduling (2) Lottery Scheduling 2 2 2 Problems with Traditional schedulers Priority systems are ad hoc: highest priority always wins Try to support fair share by adjusting

More information

Scheduling. Don Porter CSE 306

Scheduling. Don Porter CSE 306 Scheduling Don Porter CSE 306 Last time ò We went through the high-level theory of scheduling algorithms ò Today: View into how Linux makes its scheduling decisions Lecture goals ò Understand low-level

More information

Keywords Cloud computing, live migration, Load balancing, Server Sprawl, Virtual Machine Monitor (VMM).

Keywords Cloud computing, live migration, Load balancing, Server Sprawl, Virtual Machine Monitor (VMM). Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Algorithms

More information

Uniprocessor Scheduling

Uniprocessor Scheduling Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall CPU- and I/O-bound processes

More information

Assignment 5. Georgia Koloniari

Assignment 5. Georgia Koloniari Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last

More information

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 15: Caching: Demand Paged Virtual Memory

CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring Lecture 15: Caching: Demand Paged Virtual Memory CS 162 Operating Systems and Systems Programming Professor: Anthony D. Joseph Spring 2003 Lecture 15: Caching: Demand Paged Virtual Memory 15.0 Main Points: Concept of paging to disk Replacement policies

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2016 Lecture 33 Virtual Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How does the virtual

More information

Towards Autonomic Detection of SLA Violations in Cloud Infrastructures

Towards Autonomic Detection of SLA Violations in Cloud Infrastructures Towards Autonomic Detection of SLA Violations in Cloud Infrastructures Vincent C. Emeakaroha a, Marco A. S. Netto b, Rodrigo N. Calheiros c, Ivona Brandic a, Rajkumar Buyya c, César A. F. De Rose b a Vienna

More information

Can "scale" cloud applications "on the edge" by adding server instances. (So far, haven't considered scaling the interior of the cloud).

Can scale cloud applications on the edge by adding server instances. (So far, haven't considered scaling the interior of the cloud). Recall: where we are Wednesday, February 17, 2010 11:12 AM Recall: where we are Can "scale" cloud applications "on the edge" by adding server instances. (So far, haven't considered scaling the interior

More information

NEC SigmaSystemCenter Integrated Virtualization Platform Management Software

NEC SigmaSystemCenter Integrated Virtualization Platform Management Software NEC SigmaSystemCenter Integrated ization Platform Management Software 2nd IT Software Division IT Network Global Solutions Division NEC Corporation September, 2011 Why is unified VM management required?

More information

Unit 3 : Process Management

Unit 3 : Process Management Unit : Process Management Processes are the most widely used units of computation in programming and systems, although object and threads are becoming more prominent in contemporary systems. Process management

More information

Chapter 9: Virtual Memory

Chapter 9: Virtual Memory Chapter 9: Virtual Memory Chapter 9: Virtual Memory 9.1 Background 9.2 Demand Paging 9.3 Copy-on-Write 9.4 Page Replacement 9.5 Allocation of Frames 9.6 Thrashing 9.7 Memory-Mapped Files 9.8 Allocating

More information

Processes, PCB, Context Switch

Processes, PCB, Context Switch THE HONG KONG POLYTECHNIC UNIVERSITY Department of Electronic and Information Engineering EIE 272 CAOS Operating Systems Part II Processes, PCB, Context Switch Instructor Dr. M. Sakalli enmsaka@eie.polyu.edu.hk

More information

Deploying Application and OS Virtualization Together: Citrix and Virtuozzo

Deploying Application and OS Virtualization Together: Citrix and Virtuozzo White Paper Deploying Application and OS Virtualization Together: Citrix and Virtuozzo www.swsoft.com Version 1.0 Table of Contents The Virtualization Continuum: Deploying Virtualization Together... 3

More information

Operating System Concepts Ch. 5: Scheduling

Operating System Concepts Ch. 5: Scheduling Operating System Concepts Ch. 5: Scheduling Silberschatz, Galvin & Gagne Scheduling In a multi-programmed system, multiple processes may be loaded into memory at the same time. We need a procedure, or

More information

Availability & Resource

Availability & Resource Achieving Cost-effective High Availability & Resource Management Agenda Virtual Infrastructure Stack How Vmware helps in the Data Center Availability and Resource Management 2 The VMware Virtual Infrastructure

More information

VM Migration, Containers (Lecture 12, cs262a)

VM Migration, Containers (Lecture 12, cs262a) VM Migration, Containers (Lecture 12, cs262a) Ali Ghodsi and Ion Stoica, UC Berkeley February 28, 2018 (Based in part on http://web.eecs.umich.edu/~mosharaf/slides/eecs582/w16/021516-junchenglivemigration.pptx)

More information

Operating Systems 4/27/2015

Operating Systems 4/27/2015 Virtualization inside the OS Operating Systems 24. Virtualization Memory virtualization Process feels like it has its own address space Created by MMU, configured by OS Storage virtualization Logical view

More information