Progress Report 11/05.

Slides:



Advertisements
Similar presentations
 Review: The Greedy Method
Advertisements

Chapter 5 Fundamental Algorithm Design Techniques.
Software Development Methodologies 1. A methodology is: A collection of procedures, techniques, principles, and tools that help developers build a computer.
November 5, 2007 ACM WEASEL Tech Efficient Time-Aware Prioritization with Knapsack Solvers Sara Alspaugh Kristen R. Walcott Mary Lou Soffa University of.
Project Overview 2014/05/05 1. Current Project “Research on Embedded Hypervisor Scheduler Techniques” ◦ Design an energy-efficient scheduling mechanism.
COMMA: Coordinating the Migration of Multi-tier applications 1 Jie Zheng* T.S Eugene Ng* Kunwadee Sripanidkulchai† Zhaolei Liu* *Rice University, USA †NECTEC,
Chapter 2: Impact of Machine Architectures What is the Relationship Between Programs, Programming Languages, and Computers.
Progress Report Design, implementation, experiments, and demo plan 2014/12/03 1.
Virtualization and the Cloud
Supporting ethtool with Linux Integration Service Open Source Technology Center Microsoft.
MULTICOMPUTER 1. MULTICOMPUTER, YANG DIPELAJARI Multiprocessors vs multicomputers Interconnection topologies Switching schemes Communication with messages.
Sumit Kumar Archana Kumar Group # 4 CSE 591 : Virtualization and Cloud Computing.
Installation and Integration of Virtual Clusters onto Pragma Grid NAIST Nara, Japan Kevin Lam 06/28/13.
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements Insik Shin, Insup Lee, & Sang Lyul Min CIS, Penn, USACSE,
Network Aware Resource Allocation in Distributed Clouds.
Benefits: Increased server utilization Reduced IT TCO Improved IT agility.
USTH Presentation Power-aware Scheduler for Virtualization TRAN Giang Son Prof. Daniel HAGIMONT Oct 19th, 2011.
Introduction to Java August 14, 2008 Mrs. C. Furman.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 01, 2005 Session 14.
Dynamic Resource Monitoring and Allocation in a virtualized environment.
An Energy-Efficient Hypervisor Scheduler for Asymmetric Multi- core 1 Ching-Chi Lin Institute of Information Science, Academia Sinica Department of Computer.
Chapter 8-2 : Multicomputers Multiprocessors vs multicomputers Multiprocessors vs multicomputers Interconnection topologies Interconnection topologies.
Research on Asymmetric-aware Hypervisor Scheduler Project overview 6/4.
IIS Progress Report 2015/10/12. Problem Revisit Given a set of virtual machines, each contains some virtual cores with resource requirements. Decides.
 Programming - the process of creating computer programs.
Optimal Superblock Scheduling Using Enumeration Ghassan Shobaki, CS Dept. Kent Wilken, ECE Dept. University of California, Davis
Research on Embedded Hypervisor Scheduler Techniques 2014/10/02 1.
Progress Report 2015/06/29. Last Time Implementing performance Mode ◦ Assign all the virtual cores to only the performance cores. ◦ Two parts  Scheduler.
Thermal Management in Datacenters Ayan Banerjee. Thermal Management using task placement Tasks: Requires a certain number of servers (cores) for a specified.
Progress Report 07/30. Virtual Core Scheduling Problem For every time period, the hypervisor scheduler is given a set of virtual cores with their operating.
IIS Progress Report 2016/01/11. Goal Propose an energy-efficient scheduler that minimize the power consumption while providing sufficient computing resources.
Progress Report 07/06 Simon.
Complexity Analysis (Part I)
Virtual memory.
Progress Report 2014/05/23.
CHT Project Progress Report
Project Management Processes
From Algorithm to System to Cloud Computing
Enrico Bonaccorsi, (CERN) Loic Brarda, (CERN) Gary Moine, (CERN)
Who cares about implementation and precision?
The Greedy Method and Text Compression
Ching-Chi Lin Institute of Information Science, Academia Sinica
Computing Resource Allocation and Scheduling in A Data Center
Members: Iwan Sofean Ahmad Syazwan Shamilawanie Nur Anisah
The Greedy Method and Text Compression
Chapter 1 Program Development
OS Virtualization.
CSE591 October Rotation Report Haoran Li Nov
Lesson 15: Processing Arrays
Greedy Methods Knapsack Problem Hoffman Codes
Threads Chapter 4.
Weighted Interval Scheduling
Units with – James tedder
Project Management Processes
Progress Report 2014/04/23.
RNG Implementation Release 1.
(1) Breadth-First Search  S Queue S
Progress Report 10/05 Simon.
Research on Embedded Hypervisor Scheduler Techniques
Route Graph Optimization
Weighted Interval Scheduling
Warp Scheduling.
System calls….. C-program->POSIX call
Outline Chapter 2 (cont) Chapter 3: Processes Virtual machines
Progress Report 2015/01/28.
IIS Progress Report 2016/01/18.
Complexity Analysis (Part I)
Fair Queueing.
Complexity Analysis (Part I)
Progress Report 04/27 Simon.
Presentation transcript:

Progress Report 11/05

Work Items Implement our three-phase asymmetric- aware hypervisor scheduler. Integrate the hypervisor scheduler into Xen. Conduct experiments.

Hypervisor Scheduler Generates a scheduling plan. The amount of time each virtual core should run on each physical core. when a virtual core will run on each physical core.

Three-phase solution Phase 1 Instead of linear programming, assign virtual cores to the most “efficient” physical core. “efficient”: energy/instruction, less is better. Schedule virtual core with small computation resource requirement first.

Three-phase solution(Cont.) Open Shop Scheduling Problem Phase 3 Greedy heuristic

Current Status Code of the three-phase solution is ready. Each phase take at most 1 ms on x86 32-bit machine. Integrating the solution into Xen as a scheduler.

Code Structure

What’s Next - How to Trigger our three-phase solution every interval in Xen. Fetch current virtual core resource requirement. Re-organize the runqueue of each physical core according to the scheduling plan.

Milestones DONE) Algorithm design DONE) Algorithm Implementation 11/12 “Connectors” between Xen and our algorithm 11/21 Integrates scheduler into Xen 11/30 Experimental results 12/ Demo