1 Efficient Application Placement in a Dynamic Hosting Platform Zakaria Al-Qudah – CWRU Hussein Alzoubi – CWRU Mark Allman – ICSI Michael Rabinovich –

Slides:



Advertisements
Similar presentations
Why Have The OSGi Specifications Been Based On Java Technology ? By Peter Kriens, CEO aQute OSGi Technology Officer
Advertisements

Express5800/ft series servers Product Information Fault-Tolerant General Purpose Servers.
An Improved TCP for transaction communications on Sensor Networks Tao Yu Tsinghua University 2/8/
1 Building a Fast, Virtualized Data Plane with Programmable Hardware Bilal Anwer Nick Feamster.
1 of 18 Information Dissemination New Digital Opportunities IMARK Investing in Information for Development Information Dissemination New Digital Opportunities.
REQ Drop from Demand Response Programs Process Flow Retail Customer Demand Response Service Provider (DRSP) Distribution Company 1 Drop Request.
1 Virtual Resource Management (VRM) in Cloud Environment draft-Junsheng-Cloud-VRM-00 Friday 21 Jan 2011 B. Khasnabish, Chu JunSheng, Meng Yu.
17 Copyright © 2005, Oracle. All rights reserved. Deploying Applications by Using Java Web Start.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
List and Search Grants Chapter 2. List and Search Grants 2-2 Objectives Understand the option My Grants List Grant Screen Viewing a Grant Understand the.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
So far Binary numbers Logic gates Digital circuits process data using gates – Half and full adder Data storage – Electronic memory – Magnetic memory –
All rights reserved © 2005, Alcatel Grid services over IP Multimedia Subsystem  Antoine Pichot, Olivier Audouin, Alcatel  GridNets ’06.
Debugging operating systems with time-traveling virtual machines Sam King George Dunlap Peter Chen CoVirt Project, University of Michigan.
1 VIRTUAL MACHINES By: Sai Siddharth Kumar Dantu.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v MPLS TE Overview Configuring MPLS TE on Cisco IOS Platforms.
Chapter 4 Memory Management Basic memory management Swapping
Page Replacement Algorithms
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Virtual Memory.
Module 10: Virtual Memory
Virtual Memory II Chapter 8.
Paging: Design Issues. Readings r Silbershatz et al: ,
Source: IEEE Pervasive Computing, Vol. 8, Issue.4, Oct.2009, pp. 14 – 23 Author: Satyanarayanan, M., Bahl, P., Caceres, R., Davies, N. Adviser: Chia-Nian.
1 Capacity Management Capacity has a cost, whether it is used or not.
Windows® Deployment Services
O X Click on Number next to person for a question.
© S Haughton more than 3?
Virtual Switching Without a Hypervisor for a More Secure Cloud Xin Jin Princeton University Joint work with Eric Keller(UPenn) and Jennifer Rexford(Princeton)
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Processes Management.
2  Industry trends and challenges  Windows Server 2012: Modern workstyle, enabled  Access from virtually anywhere, any device  Full Windows experience.
2  Industry trends and challenges  Windows Server 2012: Beyond virtualization  Complete virtualization platform  Improved scalability and performance.
Executional Architecture
UNIX System Programming Installing OpenSolaris. 2/86 Contents How to setup a virtual machine guest How to install OpenSolaris as a guest How to update.
KAIST Computer Architecture Lab. The Effect of Multi-core on HPC Applications in Virtualized Systems Jaeung Han¹, Jeongseob Ahn¹, Changdae Kim¹, Youngjin.
1 Chapter 11: Data Centre Administration Objectives Data Centre Structure Data Centre Structure Data Centre Administration Data Centre Administration Data.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
We will resume in: 25 Minutes.
O X Click on Number next to person for a question.
Difference Engine: Harnessing Memory Redundancy in Virtual Machines by Diwaker Gupta et al. presented by Jonathan Berkhahn.
OnCall: Defeating Spikes with Dynamic Application Clusters Keith Coleman and James Norris Stanford University June 3, 2003.
Operating Systems.
CSE598C Virtual Machines and Their Applications Operating System Support for Virtual Machines Coauthored by Samuel T. King, George W. Dunlap and Peter.
Memory Management ◦ Operating Systems ◦ CS550. Paging and Segmentation  Non-contiguous memory allocation  Fragmentation is a serious problem with contiguous.
Dual Stack Virtualization: Consolidating HPC and commodity workloads in the cloud Brian Kocoloski, Jiannan Ouyang, Jack Lange University of Pittsburgh.
Review of Memory Management, Virtual Memory CS448.
Virtualization. Virtualization  In computing, virtualization is a broad term that refers to the abstraction of computer resources  It is "a technique.
Efficient Application Placement in a Dynamic Hosting Platform Zakaria Al-Qudah, Hussein A. Alzoubi, Mark Allman, Michael Rabinovich, Vincenzo Liberatore.
High Performance Computing on Virtualized Environments Ganesh Thiagarajan Fall 2014 Instructor: Yuzhe(Richard) Tang Syracuse University.
Swap Space and Other Memory Management Issues Operating Systems: Internals and Design Principles.
Processes and Virtual Memory
1 Agility in Virtualized Utility Computing Hangwei Qian, Elliot Miller, Wei Zhang Michael Rabinovich, Craig E. Wills {EECS Department, Case Western Reserve.
Memory Management OS Fazal Rehman Shamil. swapping Swapping concept comes in terms of process scheduling. Swapping is basically implemented by Medium.
William Stallings Computer Organization and Architecture
1. 2 VIRTUAL MACHINES By: Satya Prasanna Mallick Reg.No
Lecture 28: Virtual Memory-Address Translation
O.S Lecture 13 Virtual Memory.
A workload-aware energy model for VM migration
Presentation transcript:

1 Efficient Application Placement in a Dynamic Hosting Platform Zakaria Al-Qudah – CWRU Hussein Alzoubi – CWRU Mark Allman – ICSI Michael Rabinovich – CWRU Vincenzo Liberatore - CWRU

2 Target Environment: Dynamic Hosting General components App servers Local controllers Central controller Request router Measurement modules

3 Our Problem: Enactment of resource allocation decisions Starting applications is slow and resource- intensive Causes loss in system responsiveness Limits flexibility of resource allocation

4 Option 1: Run Everywhere Run an instance of every application on every machine Send requests only to those intended to be active Intuition: idle application instances should not consume resources

5 Run-Everywhere Results Conclusion: Run-everywhere is impractical

6 Option 2: Explicit Suspend/Resume What was the problem of run-everywhere? OS couldnt tell active applications from idle ones due to the periodic application maintenance Solution: explicitly convey this information to the OS Suspend idle applications with SIGSTOP Resume to activate with SIGCONT

7 Still inefficiencies: 1.On-demand page-in OS brings a page to memory only when its referenced context switching 2.On-demand page-out Full memory at the time of page-in resumption waits for page-out 3.On-demand eviction of memory pages to disk Piecemeal eviction process state spreads over many disjoined locations on disk Much better!

8 Enhanced Suspend/Resume Prefetching/prepurging = ancient swapping! 1.Bring all the process pages at once from disk to memory (prefetching) 2. Whenever an application is suspended, evict it out of memory at once (pre-purging) This keeps process state in few contiguous places on disk …but only for application placement

9 Performance Evaluation: Startup time

10 Performance Evaluation: Resource consumption

11 Prefetching overhead

12 Performance Evaluation: Contributing factors

13 End-to-end responsiveness: Experiment setup

14 End-to-end responsiveness - results

15 End-to-end responsiveness (contd)

16 Limitations of Suspend-Resume Consequences of bad programming practices are more pronounced Less useful for clustered applications Re-joining the cluster takes long time (regardless of how applications are started)

Future work: Virtualization Various technologies OS-level (e.g., OpenVZ) Hardware-level (e.g., VMware) Vary in performance overhead and offered features (arguably!) Degree of performance/fault/security isolation Ability to run heterogeneous OSes on the same hardware Similar suspend-resume issues might apply Bulk prepurging Bulk prefetching 17

18 Summary Most existing work on dynamic hosting focuses on resource allocation decisions We focus on efficient enactment of these decisions Examined several alternatives for application placement Deployment from scratch Run-everywhere Suspend-resume Enhanced suspend-resume Swapping for application placement Normal paging for active tasks Enhanced suspend-resume is significantly more efficient