ENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR GREEN CLOUDS
|
|
- Judith Bruce
- 5 years ago
- Views:
Transcription
1 ENERGY EFFICIENT CONTROL OF VIRTUAL MACHINE CONSOLIDATION UNDER UNCERTAIN INPUT PARAMETERS FOR GREEN CLOUDS
2 ENERGY SAVING IN VIRTUALIZED DATACENTERS Assume small datacenter, 1064 Servers LighWng UPS 588 Cooling Compute Out of the 588 KW for Compute/Network 44% are for processor, server power supply and other server components (in total 258 kw), à This is what we try to opwmize 4% for storage 4% for communicawon equipment Saving 1 W for processing saves addiwonal 1.84 W for other components
3 ENERGY SAVING IN VIRTUALIZED DATACENTERS For example, save 20% energy for this datacenter results in: Total CO2 footprint avoided per year 846t California 690t Sweden 1387t China 1407t Australia Monetary savings per year USD for California SEK for Sweden Yuan for China $ for Australia
4 VM CONSOLIDATION: MOTIVATION VM Workload Varies over Wme due to unpredictable workload May require VM resizing, VM creawon, VM terminawon Result in the physical servers to be UnderuWlized OveruWlized Consequences for Cloud Operators SLA ViolaWons versus Minimum Energy ConsumpWon Case Study Evaluated Workload of 6 VMs in KAU Compute Service Department
5 VM CONSOLIDATION: KAU WORKLOAD TRACES EXAMPLE: KAU workload traces VMDatacenter Demand Varies over /me
6 VM CONSOLIDATION: KAU WORKLOAD TRACES VM Demand Varies within bounds
7 VM CONSOLIDATION - REVISITIED VM1 VM2 VM3 VM4 60% 40% 20% 50% VM demands vary over Wme SLA may be violated!!! GOAL: Provide a soluwon that is robust against input variability VM1 VM3 80% VM2 VM4 105% 90%
8 VM CONSOLIDATION - REVISITED VM1 VM2 VM3 VM4 60% 40% 20% 50% VM demands vary over Wme SLA may be violated!!! GOAL: Provide a soluwon that is robust against input variability DeterminisWc OpWmizaWon: Too conservawve Apply robust opwmizawon theory VM1 VM3 80% VM2 VM4 40% 50% Higher energy consumpwon and more unused resources Less probability of SLA viola/on
9 CLASSICAL OPTIMIZATION FRAMEWORKS Almost all models for Cloud (any?) OpWmisaWon (e.g. VM ConsolidaWon) assume perfect knowledge! MIN ct(x) s.t. Ax<=b Once x* calculated, it is used BUT: Many factors not known precisely, e.g. VM Resource Demands Energy Model of Servers We can only assume incomplete knowledge in A, b, c Consequence (Ben Tal+Nemirovski, 2000): Small errors in parameters can make x* highly unfeasible
10 ROBUST OPTIMIZATION PARADIGM Assume uncertainty model for data is known (e.g. bounds) Define a soluwon is robust feasible as one that is guaranteed to remain feasible for all admissible data values (out of uncertainty set U) OpWmize objecwve over set of approximate robustly feasible soluwons Robust counterpart ai i-th row of uncertain matrix objecwve Nominal boundary robust x*à nominal becomes infeasible
11 ROBUST VM CONSOLIDATION MODEL ROBUST Mixed Integer Linear Problem SoluWon x* is robust feasible if it sawsfies all uncertain constraints Robust counterpart Typically has infinite number of constraints Depends on uncertainty set U SoluWon typically has worse objecwve value Tries to miwgate adverse effects of uncertainty Special case: cardinality constraint uncertainty set (Bertsimas, Sim) Polyhedral uncertainty set, budget of uncertainty in terms of cardinality constraints Each coefficient in matrix is within, max Γi coefficients deviate Robust counterpart becomes aqer duality
12 UNCERTAINTY ON SERVER POWER MODEL Power of server can be modeled as linear funcwon of resource uwlizawon (e.g. CPU load, etc) But errors up to 10-14% due to processor opwmizawons, etc Power consumpwon is random variable from uncertainty set symmetrically distributed between with zero mean Decision variable Constraints depend on VM uwlizawon, see next slide
13 UNCERTAINTY ON VM RESOURCE DEMANDS Power consumpwon depends on resource demands of VMs, which are uncertain Resource demand is random variable symmetrically distributed with zero mean plus fixed demand UWlizaWon Resource demands of Old assignment VMs migrawng towards server Budget constraint VMs migrawng away Overprovisioning Factor
14 UNCERTAINTY MODEL PRICE OF ROBUSTNESS Uncertainty set for cardinality constraint Defines deviawons from nominal values, i.e. mean values plus deviawon bounds ProtecWon from deviawon by introducing hard constraints that cut-off feasible soluwons that may become unfeasible ones for some deviawons Price of robustness Cloud Operator can tradeoff by modifying Γ Higher risk aversion à consider more unlikely deviawons à higher protecwon à higher energy consumpwon OpportunisWc soluwon à less protecwon à less energy consumpwon
15 HOW MUCH RISK TO TAKE? TUNING OF Γ Probability of constraint violawon ω coefficients may deviate Upper bound can be computed according to (Bertsimas, Sim) For small ω need to ensure full protecwon (sesng Γ to max) to ensure small violawon probability
16 EVALUATION ImplementaWon in Matlab with IBM CPLEX Not suitable for online opwmizawon Benchmark for heuriswcs Small example to demonstrate model capabiliwes 0.1 CPU = 1 core 0.1 RAM = 512 MB
17 CPU DEMANDS UNCERTAIN (Δ=5%) Γ=0 Γ=50 Pr(viol)=52% Pr(viol)<1% Cloud Operator can tradeoff by modifying Γ CONSERVATIVE SOLUTION = TOTAL PROTECTION LEVEL (MAX Γ) = HIGHEST ENERGY PROTECTION AGAINST UNCERTAINTY OF 50 UNITS HIGHER ENERGY = PRICE OF ROBUSTNESS OPPORTUNISTIC SOLUTION (NO PROTECTION) = LESS ENERGY CONSUMPTION
18 CPU DEMANDS UNCERTAIN
19 CPU DEMANDS UNCERTAIN LARGE INSTANCE (100/14) ADDITIONAL POWER, NO OVERBOOKING EXPECTED POWER, 50% DEMAND UNCERTAINTY RELATIVE POWER, 40% UNCERTAINTY ON DEMAND SLA VIOLATION, 50% DEMAND UNCERTAINTY
20 CONCLUSIONS AND FUTURE WORK Conclusions Applied Robust OpWmizaWon Framework to cope with unknown and imprecise input data to VM ConsolidaWon problem Uncertainty on VM resource demands and Power model of servers Γ uncertainty and constraint violawon probability gives Cloud operators a tool to tradeoff robustness versus energy efficiency Many more results with enhanced model with e.g. resource overbooking Future work Comparison with robust heuriswcs IntegraWon of network model and NFV concept (service chain) Apply Robust OpWmizaWon to 5G Network OpWmizaWon
21 THANK YOU FOR YOUR ATTENTION! Thank you for your axenwon! ANDREAS KASSLER ACROSS WORKSHOP, 11TH SEPTEMBER 2015, GHENT, BELGIUM
ROBUST OPTIMIZATION. Lecturer : Majid Rafiee
ROBUST OPTIMIZATION Uncertainty : INTRODUCTION Very often, the realistic data are subect to uncertainty due to their random nature, measurement errors, or other reasons. Robust optimization belongs to
More informationSolving Two-stage Robust Optimization Problems by A Constraint-and-Column Generation Method
Solving Two-stage Robust Optimization Problems by A Constraint-and-Column Generation Method Bo Zeng Department of Industrial and Management Systems Engineering University of South Florida, Email: bzeng@usf.edu
More informationRobust Optimization in AIMMS
Robust Optimization in AIMMS Peter Nieuwesteeg Senior AIMMS specialist Online webinar July 20, 2010 Paragon Decision Technology Inc 5400 Carillon Point, Kirkland, WA, USA E-mail: info@aimms.com Internet:
More informationEnergy Aware Rou.ng in Packet Networks [Presenta.on at Green Days, Paris May 30, 2011]
Energy Aware Rou.ng in Packet Networks [Presenta.on at Green Days, Paris May 30, 2011] Erol Gelenbe e.gelenbe@imperial.ac.uk Intelligent Systems and Networks Group Department of Electrical and Electronic
More informationConsolidating Complementary VMs with Spatial/Temporalawareness
Consolidating Complementary VMs with Spatial/Temporalawareness in Cloud Datacenters Liuhua Chen and Haiying Shen Dept. of Electrical and Computer Engineering Clemson University, SC, USA 1 Outline Introduction
More informationEnergy Aware Scheduling in Cloud Datacenter
Energy Aware Scheduling in Cloud Datacenter Jemal H. Abawajy, PhD, DSc., SMIEEE Director, Distributed Computing and Security Research Deakin University, Australia Introduction Cloud computing is the delivery
More informationExploiting Temporal Diversity of Water Efficiency to Make Data Center Less "Thirsty"
Exploiting Temporal Diversity of Water Efficiency to Make Data Center Less "Thirsty" M. A. Islam, K. Ahmed, Shaolei Ren, and G. Quan Florida International University 1 A massive data center Google's data
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationBinary decision diagrams for computing the non-dominated set
Binary decision diagrams for computing the non-dominated set July 13, 2015 Antti Toppila and Ahti Salo 27th European Conference on Operational Research, 12-15 July 2015, University of Strathclyde, Glasgow,
More informationLinear & Conic Programming Reformulations of Two-Stage Robust Linear Programs
1 / 34 Linear & Conic Programming Reformulations of Two-Stage Robust Linear Programs Erick Delage CRC in decision making under uncertainty Department of Decision Sciences HEC Montreal (joint work with
More informationA robust optimization based approach to the general solution of mp-milp problems
21 st European Symposium on Computer Aided Process Engineering ESCAPE 21 E.N. Pistikopoulos, M.C. Georgiadis and A. Kokossis (Editors) 2011 Elsevier B.V. All rights reserved. A robust optimization based
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationConsidering Resource Demand Misalignments To Reduce Resource Over-Provisioning in Cloud Datacenters
Considering Resource Demand Misalignments To Reduce Resource Over-Provisioning in Cloud Datacenters Liuhua Chen Dept. of Electrical and Computer Eng. Clemson University, USA Haiying Shen Dept. of Computer
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationibench: Quantifying Interference in Datacenter Applications
ibench: Quantifying Interference in Datacenter Applications Christina Delimitrou and Christos Kozyrakis Stanford University IISWC September 23 th 2013 Executive Summary Problem: Increasing utilization
More informationQuality-Assured Cloud Bandwidth Auto-Scaling for Video-on-Demand Applications
Quality-Assured Cloud Bandwidth Auto-Scaling for Video-on-Demand Applications Di Niu, Hong Xu, Baochun Li University of Toronto Shuqiao Zhao UUSee, Inc., Beijing, China 1 Applications in the Cloud WWW
More informationPrediction-Based Admission Control for IaaS Clouds with Multiple Service Classes
Prediction-Based Admission Control for IaaS Clouds with Multiple Service Classes Marcus Carvalho, Daniel Menascé, Francisco Brasileiro 2015 IEEE Intl. Conf. Cloud Computing Technology and Science Summarized
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationOn the use of Fuzzy Logic Controllers to Comply with Virtualized Application Demands in the Cloud
On the use of Fuzzy Logic Controllers to Comply with Virtualized Application Demands in the Cloud Kyriakos M. Deliparaschos Cyprus University of Technology k.deliparaschos@cut.ac.cy Themistoklis Charalambous
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationDynamic Vertical Memory Scalability for OpenJDK Cloud Applications
Dynamic Vertical Memory Scalability for OpenJDK Cloud Applications Rodrigo Bruno, Paulo Ferreira: INESC-ID / Instituto Superior Técnico, University of Lisbon Ruslan Synytsky, Tetiana Fydorenchyk: Jelastic
More informationA Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed Integer Conic Quadratic Programs Juan Pablo Vielma Shabbir Ahmed George L. Nemhauser H. Milton Stewart School of Industrial and Systems
More informationQUT Digital Repository:
QUT Digital Repository: http://eprints.qut.edu.au/ This is the accepted version of this conference paper. To be published as: Ai, Lifeng and Tang, Maolin and Fidge, Colin J. (2010) QoS-oriented sesource
More informationImproving Throughput in Cloud Storage System
Improving Throughput in Cloud Storage System Chanho Choi chchoi@dcslab.snu.ac.kr Shin-gyu Kim sgkim@dcslab.snu.ac.kr Hyeonsang Eom hseom@dcslab.snu.ac.kr Heon Y. Yeom yeom@dcslab.snu.ac.kr Abstract Because
More informationTransactions on the Built Environment vol 28, 1997 WIT Press, ISSN
Shape/size optimization of truss structures using non-probabilistic description of uncertainty Eugenio Barbieri, Carlo Cinquini & Marco Lombard! LWveraz'ry of fawa, DeparfmcMf q/#r%cf%ra7 Mzc/zamcj, fawa,
More informationAdvances In Industrial Logic Synthesis
Advances In Industrial Logic Synthesis Luca Amarù, Patrick Vuillod, Jiong Luo Design Group, Synopsys Inc., Sunnyvale, California, USA Design Group, Synopsys, Grenoble, FR Logic Synthesis Y
More informationGeorge B. Dantzig Mukund N. Thapa. Linear Programming. 1: Introduction. With 87 Illustrations. Springer
George B. Dantzig Mukund N. Thapa Linear Programming 1: Introduction With 87 Illustrations Springer Contents FOREWORD PREFACE DEFINITION OF SYMBOLS xxi xxxiii xxxvii 1 THE LINEAR PROGRAMMING PROBLEM 1
More informationAdvanced Use of GAMS Solver Links
Advanced Use of GAMS Solver Links Michael Bussieck, Steven Dirkse, Stefan Vigerske GAMS Development 8th January 2013, ICS Conference, Santa Fe Standard GAMS solve Solve william minimizing cost using mip;
More informationand 6.855J March 6, Maximum Flows 2
5.08 and.855j March, 00 Maximum Flows Network Reliability Communication Network What is the maximum number of arc disjoint paths from s to t? How can we determine this number? Theorem. Let G = (N,A) be
More informationIncreasing 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 informationElastic Resource Provisioning for Cloud Data Center
Elastic Resource Provisioning for Cloud Data Center Thant Zin Tun, and Thandar Thein Abstract Cloud data centers promises flexible, scalable, powerful and cost-effective executing environment to users.
More informationDatacenter application interference
1 Datacenter application interference CMPs (popular in datacenters) offer increased throughput and reduced power consumption They also increase resource sharing between applications, which can result in
More informationMachine Learning Opportunities in Cloud Computing Datacenter Management for 5G Services
Machine Learning Opportunities in Cloud Computing Datacenter Management for 5G Services Benjamín Barán National University of the East, Ciudad del Este, Paraguay bbaran@pol.una.py Introduction and Motivation
More informationIBM InfoSphere Data Replication s Change Data Capture (CDC) for DB2 LUW databases (Version ) Performance Evaluation and Analysis
Page 1 IBM InfoSphere Data Replication s Change Data Capture (CDC) for DB2 LUW databases (Version 10.2.1) Performance Evaluation and Analysis 2014 Prasa Urithirakodeeswaran Page 2 Contents Introduction...
More informationSEARCH ALGORITHMS NOTES FOR THE ADVANCED ALGORITHM CLASS
SEARCH ALGORITHMS NOTES FOR THE ADVANCED ALGORITHM CLASS GIUSEPPE PERSIANO Contents 1. Model 1 2. Exhaustive Search 2 3. Backtrack 3 3.1. Backtrack for Sudoku 4 3.2. Backtrack for Vertex Cover 4 4. Branch
More informationCSE P 501 Compilers. Dynamic Languages Hal Perkins Winter UW CSE P 501 Winter 2016 X2-1
CSE P 501 Compilers Dynamic Languages Hal Perkins Winter 2016 UW CSE P 501 Winter 2016 X2-1 References An Efficient Implementa/on of Self, a dynamically-typed object-oriented language based on prototypes,
More informationPCAP: Performance-Aware Power Capping for the Disk Drive in the Cloud
PCAP: Performance-Aware Power Capping for the Disk Drive in the Cloud Mohammed G. Khatib & Zvonimir Bandic WDC Research 2/24/16 1 HDD s power impact on its cost 3-yr server & 10-yr infrastructure amortization
More informationQLIKVIEW SCALABILITY BENCHMARK WHITE PAPER
QLIKVIEW SCALABILITY BENCHMARK WHITE PAPER Hardware Sizing Using Amazon EC2 A QlikView Scalability Center Technical White Paper June 2013 qlikview.com Table of Contents Executive Summary 3 A Challenge
More informationJason Waxman General Manager High Density Compute Division Data Center Group
Jason Waxman General Manager High Density Compute Division Data Center Group Today 2015 More Users Only 25% of the world is Internet connected today 1 New technologies will connect over 1 billion additional
More informationLEVERAGING FLASH MEMORY in ENTERPRISE STORAGE
LEVERAGING FLASH MEMORY in ENTERPRISE STORAGE Luanne Dauber, Pure Storage Author: Matt Kixmoeller, Pure Storage SNIA Legal Notice The material contained in this tutorial is copyrighted by the SNIA unless
More informationA Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems
Gutenberg School of Management and Economics Discussion Paper Series A Note on the Separation of Subtour Elimination Constraints in Asymmetric Routing Problems Michael Drexl March 202 Discussion paper
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationPart I: You Are Here!
CS 61C: Great Ideas in Computer Architecture VM 2 : Virtual Memory and Machines Instructor: Randy H. Katz hbp://inst.eecs.berkeley.edu/~cs61c/fa13 1 Parallel Requests Assigned to computer e.g., Search
More informationInteger Programming ISE 418. Lecture 7. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 7 Dr. Ted Ralphs ISE 418 Lecture 7 1 Reading for This Lecture Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Wolsey Chapter 7 CCZ Chapter 1 Constraint
More informationA Row-and-Column Generation Method to a Batch Machine Scheduling Problem
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation
More informationMath 5490 Network Flows
Math 590 Network Flows Lecture 7: Preflow Push Algorithm, cont. Stephen Billups University of Colorado at Denver Math 590Network Flows p./6 Preliminaries Optimization Seminar Next Thursday: Speaker: Ariela
More informationCharles Lefurgy IBM Research, Austin
Super-Dense Servers: An Energy-efficient Approach to Large-scale Server Clusters Outline Problem Internet data centers use a lot of energy Opportunity Load-varying applications Servers can be power-managed
More informationMusings on Analysis of Measurements of a Real-Time Workload
Musings on Analysis of Measurements of a Real-Time Workload Analysis of real-time performance is often focused on the worst case "bad" value, such as maximum latency or maximum interrupt disabled time.
More informationEnergy-Efficient Load Balancing in Cloud: A Survey on Green Cloud
Energy-Efficient Load Balancing in Cloud: A Survey on Green Cloud M. Nirmala, Associate Professor, Department of Computer Science & Engineering, Aurora s Technology & Research Institute, Uppal, Hyderabad.
More informationCloud Konsolidierung mit Oracle (RAC) Wie viel ist zu viel?
Cloud Konsolidierung mit Oracle (RAC) Wie viel ist zu viel? Markus Michalewicz Oracle Corporation Oracle HQ, Redwood Shores, CA, USA Key words: cloud, consolidation, Oracle RAC, database, limits Introduction
More informationConforming Vector Interpolation Functions for Polyhedral Meshes
Conforming Vector Interpolation Functions for Polyhedral Meshes Andrew Gillette joint work with Chandrajit Bajaj and Alexander Rand Department of Mathematics Institute of Computational Engineering and
More informationLARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH
LARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH Richard Kipp Martin Graduate School of Business University of Chicago % Kluwer Academic Publishers Boston/Dordrecht/London CONTENTS Preface
More informationYour Speakers. Iwan e1 Rahabok Linkedin.com/in/e1ang
Your Speakers Iwan e1 Rahabok virtual-red-dot.info e1@vmware.com @e1_ang Linkedin.com/in/e1ang 9119 9226 Sunny Dua vxpresss.blogspot.com duas@vmware.com @sunny_dua Linkedin.com/in/duasunny 2 Need more
More informationCyber Security Analysis of State Estimators in Electric Power Systems
Cyber Security Analysis of State Estimators in Electric Power Systems H. Sandberg, G. Dán, A. Teixeira, K. C. Sou, O. Vukovic, K. H. Johansson ACCESS Linnaeus Center KTH Royal Institute of Technology,
More informationJava Heap Resizing From Hacked-up Heuristics to Mathematical Models. Jeremy Singer and David R. White
Java Heap Resizing From Hacked-up Heuristics to Mathematical Models Jeremy Singer and David R. White Outline Background Microeconomic Theory Heap Sizing as a Control Problem Summary Outline Background
More informationMaking MCP more agile for ING Best of both worlds
Making MCP more agile for ING Best of both worlds Boris Maltha 26 September 2017 Agenda Best of both worlds The Challenge Background ING Challenge for ING and Unisys The Response to the Challenges Results
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationA Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
0 IEEE Congress on Evolutionary Computation (CEC) July -, 0, Beijing, China A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem Tianxiang Cui, Shi Cheng, and Ruibin
More informationCloudSim: A Toolkit for Modeling and Simulation of Cloud Computing Environments
CloudSim: A Toolkit for Modeling and Simulation of Cloud Computing Environments Presented by: Dr. Faramarz Safi Islamic Azad University, Najafabad Branch, Esfahan, Iran. and with special thanks to Mrs.
More informationTowards Energy-Efficient Reactive Thermal Management in Instrumented Datacenters
Towards Energy-Efficient Reactive Thermal Management in Instrumented Datacenters Ivan Rodero1, Eun Kyung Lee1, Dario Pompili1, Manish Parashar1, Marc Gamell2, Renato J. Figueiredo3 1 NSF Center for Autonomic
More informationMATLAB Solution of Linear Programming Problems
MATLAB Solution of Linear Programming Problems The simplex method is included in MATLAB using linprog function. All is needed is to have the problem expressed in the terms of MATLAB definitions. Appendix
More informationSymmetrical Buffered Clock-Tree Synthesis with Supply-Voltage Alignment
Symmetrical Buffered Clock-Tree Synthesis with Supply-Voltage Alignment Xin-Wei Shih, Tzu-Hsuan Hsu, Hsu-Chieh Lee, Yao-Wen Chang, Kai-Yuan Chao 2013.01.24 1 Outline 2 Clock Network Synthesis Clock network
More informationOutline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk Outline History The Simplex algorithm (re-visited) Column Generation as an extension of the Simplex algorithm A simple example! DTU-Management
More informationColumn Generation: Cutting Stock
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline History The Simplex algorithm (re-visited) Column Generation as an extension
More informationA set-based approach to robust control and verification of piecewise affine systems subject to safety specifications
Dipartimento di Elettronica, Informazione e Bioingegneria A set-based approach to robust control and verification of piecewise affine systems subject to safety specifications Maria Prandini maria.prandini@polimi.it
More informationEnergy efficient mapping of virtual machines
GreenDays@Lille Energy efficient mapping of virtual machines Violaine Villebonnet Thursday 28th November 2013 Supervisor : Georges DA COSTA 2 Current approaches for energy savings in cloud Several actions
More informationParallel and Distributed Optimization with Gurobi Optimizer
Parallel and Distributed Optimization with Gurobi Optimizer Our Presenter Dr. Tobias Achterberg Developer, Gurobi Optimization 2 Parallel & Distributed Optimization 3 Terminology for this presentation
More informationIntroduction 2 Load Testing
Introduction 2 Load Testing Gus Björklund, Progress Software Exchange Australia, October 18, 20, 22, 2010 Melbourne, Brisbane, Sydney Abstract Load testing your application is well worth the time and effort.
More informationCost-Efficient and Robust On-Demand Video Stream Transcoding Using Heterogeneous Cloud Services
1 Cost-Efficient and Robust On-Demand Video Stream Transcoding Using Heterogeneous Cloud Services Xiangbo Li, Mohsen Amini Salehi, Member, IEEE, Magdy Bayoumi, Fellow, IEEE, Nian-Feng Tzeng, Fellow, IEEE,
More informationUsing Multiple Machines to Solve Models Faster with Gurobi 6.0
Using Multiple Machines to Solve Models Faster with Gurobi 6.0 Distributed Algorithms in Gurobi 6.0 Gurobi 6.0 includes 3 distributed algorithms Distributed concurrent LP (new in 6.0) MIP Distributed MIP
More informationHITACHI UNIFIED COMPUTE PLATFORM
HITACHI UNIFIED COMPUTE PLATFORM NEXT-GEN CONVERGED INFRASTRUCTURE SOLUTIONS FOR MISSION-CRITICAL WORKLOADS Frank Tenambergen Special Engagement Manager Norway UCP SOFTWARE DEFINED DC REQUIREMENTS 1: EVERYTHING
More informationProviding Near-Optimal Fair- Queueing Guarantees at Round-Robin Amortized Cost
Providing Near-Optimal Fair- Queueing Guarantees at Round-Robin Amortized Cost Paolo Valente Department of Physics, Computer Science and Mathematics Modena - Italy Workshop PRIN SFINGI October 2013 2 Contributions
More informationLinear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.
University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall
More informationWelcome. Jeremy Poon Territory Manager, VMware
Welcome Jeremy Poon Territory Manager, VMware Partner Recognition VMware Infrastructure The New Computing Platform Presented by: Yasser Elgammal Regional Director, VMware VMware: Who We Are World s leading
More informationComparison of Interior Point Filter Line Search Strategies for Constrained Optimization by Performance Profiles
INTERNATIONAL JOURNAL OF MATHEMATICS MODELS AND METHODS IN APPLIED SCIENCES Comparison of Interior Point Filter Line Search Strategies for Constrained Optimization by Performance Profiles M. Fernanda P.
More informationExact Solution of the Robust Knapsack Problem
Exact Solution of the Robust Knapsack Problem Michele Monaci 1 and Ulrich Pferschy 2 and Paolo Serafini 3 1 DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy. monaci@dei.unipd.it 2 Department
More informationOktober 2018 Dell Tech. Forum München
Oktober 2018 Dell Tech. Forum München Virtustream Digital Transformation & SAP Jan Büsen Client Solutions Executive, Virtustream The Business Agenda: Digital IT = Competitive Advantage Business Driven
More informationPervasive Insight. Mission Critical Platform
Empowered IT Pervasive Insight Mission Critical Platform Dynamic Development Desktop & Mobile Server & Datacenter Cloud Over 7 Million Downloads of SQL Server 2008 Over 30,000 partners are offering solutions
More informationarxiv: v1 [cs.dc] 12 Feb 2018 Informatics Engineering Final Work César Augusto Amarilla Cardozo San Lorenzo - Paraguay
(currentpage.northwest) + (4cm, 1cm)(currentpage.southeast) arxiv:1802.04245v1 [cs.dc] 12 Feb 2018 Scalarization Methods for Many-Objective Virtual Machine Placement of Elastic Infrastructures in Overbooked
More informationSolving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach
Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach Amir Salehipour School of Mathematical and Physical Sciences, The University of Newcastle, Australia
More informationSolving basis pursuit: infeasible-point subgradient algorithm, computational comparison, and improvements
Solving basis pursuit: infeasible-point subgradient algorithm, computational comparison, and improvements Andreas Tillmann ( joint work with D. Lorenz and M. Pfetsch ) Technische Universität Braunschweig
More information10. EXTENDING TRACTABILITY
0. EXTENDING TRACTABILITY finding small vertex covers solving NP-hard problems on trees circular arc coverings vertex cover in bipartite graphs Lecture slides by Kevin Wayne Copyright 005 Pearson-Addison
More informationRiverWare Optimization
RiverWare Optimization RiverWare User Group Meeting February 6-7, 2007 Tim Magee and Patrick Lynn Reimplementation of Optimization Goals of reimplementation Replace the Constraint editor with the Rules
More informationA Novel Energy Efficient Algorithm for Cloud Resource Management. Jing SiYuan. Received April 2013; revised April 2013
International Journal of Knowledge www.iklp.org and Language Processing KLP International c2013 ISSN 2191-2734 Volume 4, Number 2, 2013 pp.12-22 A Novel Energy Efficient Algorithm for Cloud Resource Management
More informationOutline 1 Motivation 2 Theory of a non-blocking benchmark 3 The benchmark and results 4 Future work
Using Non-blocking Operations in HPC to Reduce Execution Times David Buettner, Julian Kunkel, Thomas Ludwig Euro PVM/MPI September 8th, 2009 Outline 1 Motivation 2 Theory of a non-blocking benchmark 3
More informationPredicting Web Service Levels During VM Live Migrations
Predicting Web Service Levels During VM Live Migrations 5th International DMTF Academic Alliance Workshop on Systems and Virtualization Management: Standards and the Cloud Helmut Hlavacs, Thomas Treutner
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationA Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs
A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs Lars Eufinger Deutsche Bahn AG, Poststraße 0, 6039 Frankfurt a. Main, Germany, lars.eufinger@deutschebahn.com Jannis Kurtz
More informationBlack-box and Gray-box Strategies for Virtual Machine Migration
Full Review On the paper Black-box and Gray-box Strategies for Virtual Machine Migration (Time required: 7 hours) By Nikhil Ramteke Sr. No. - 07125 1. Introduction Migration is transparent to application
More informationApproximation Algorithms
Approximation Algorithms Frédéric Giroire FG Simplex 1/11 Motivation Goal: Find good solutions for difficult problems (NP-hard). Be able to quantify the goodness of the given solution. Presentation of
More informationA Dual Variant of. Benson s Outer Approximation Algorithm. for Multiple Objective Linear Programs
A Dual Variant of Benson s Outer Approximation Algorithm for Multiple Objective Linear Programs Matthias Ehrgott 1, Andreas Löhne 2 und Lizhen Shao 3 1,3 University of Auckland, New Zealand 2 Martin-Luther-Universität
More informationEmbracing Imperfection in Enterprise Architecture Models
Embracing Imperfection in Enterprise Architecture Models Hector Florez, Mario Sánchez, and Jorge Villalobos Department of Systems and Computing Engineering, Universidad de los Andes, Bogotá, Colombia {ha.florez39,mar-san1,jvillalo}@uniandes.edu.co
More informationEnhancing cloud energy models for optimizing datacenters efficiency.
Outin, Edouard, et al. "Enhancing cloud energy models for optimizing datacenters efficiency." Cloud and Autonomic Computing (ICCAC), 2015 International Conference on. IEEE, 2015. Reviewed by Cristopher
More informationLeveraging the power of Flash to Enable IT as a Service
Leveraging the power of Flash to Enable IT as a Service Steve Knipple CTO / VP Engineering August 5, 2014 In summary Flash in the datacenter, simply put, solves numerous problems. The challenge is to use
More informationOPTIMAL SERVICE PRICING FOR A CLOUD CACHE
OPTIMAL SERVICE PRICING FOR A CLOUD CACHE ABSTRACT: Cloud applications that offer data management services are emerging. Such clouds support caching of data in order to provide quality query services.
More informationRead: H&L chapters 1-6
Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research Fall 2006 (Oct 16): Midterm Review http://www-scf.usc.edu/~ise330
More informationAn Integrated Design Algorithm for Detailed Layouts Based on the Contour Distance
An Integrated Design Algorithm for Detailed Layouts Based on the Contour Distance Jae-Gon Kim and Marc Goetschalckx School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta,
More informationThe Software Driven Datacenter
The Software Driven Datacenter Three Major Trends are Driving the Evolution of the Datacenter Hardware Costs Innovation in CPU and Memory. 10000 10 µm CPU process technologies $100 DRAM $/GB 1000 1 µm
More informationSolving Linear and Integer Programs
Solving Linear and Integer Programs Robert E. Bixby Gurobi Optimization, Inc. and Rice University Overview Linear Programming: Example and introduction to basic LP, including duality Primal and dual simplex
More information