Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla,

Slides:



Advertisements
Similar presentations
Introduction Why do we need Mobile OGSI.NET? Drawbacks:
Advertisements

Hadi Goudarzi and Massoud Pedram
SLA-Oriented Resource Provisioning for Cloud Computing
A Cyber-Physical Systems Approach to Energy Management in Data Centers Presented by Chen He Adopted form the paper authors.
Green Cloud Computing Hadi Salimi Distributed Systems Lab, School of Computer Engineering, Iran University of Science and Technology,
Scalable Content-aware Request Distribution in Cluster-based Network Servers Jianbin Wei 10/4/2001.
Applying Genetic Algorithms to Decision Making in Autonomic Computing Systems Authors: Andres J. Ramirez, David B. Knoester, Betty H.C. Cheng, Philip K.
Technical Architectures
GridFlow: Workflow Management for Grid Computing Kavita Shinde.
A Grid Resource Broker Supporting Advance Reservations and Benchmark- Based Resource Selection Erik Elmroth and Johan Tordsson Reporter : S.Y.Chen.
Tians Scheduling: Using Partial Processing in Best-Effort Applications Yuxiong He *, Sameh Elnikety *, Hongyang Sun + * Microsoft Research + Nanyang Technological.
Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
© 2008 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Automated Workload Management in.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
By- Jaideep Moses, Ravi Iyer , Ramesh Illikkal and
Cluster Scheduler Reference: Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center NSDI’2011 Multi-agent Cluster Scheduling for Scalability.
Adaptive Server Farms for the Data Center Contact: Ron Sheen Fujitsu Siemens Computers, Inc Sever Blade Summit, Getting the.
Exploiting Virtualization for Delivering Cloud based IPTV Services Speaker : 吳靖緯 MA0G IEEE Conference on Computer Communications Workshops.
Ajou University, South Korea ICSOC 2003 “Disconnected Operation Service in Mobile Grid Computing” Disconnected Operation Service in Mobile Grid Computing.
Naixue GSU Slide 1 ICVCI’09 Oct. 22, 2009 A Multi-Cloud Computing Scheme for Sharing Computing Resources to Satisfy Local Cloud User Requirements.
Adaptive Control of Virtualized Resources in Utility Computing Environments HP Labs: Xiaoyun Zhu, Mustafa Uysal, Zhikui Wang, Sharad Singhal University.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
A Dynamic MapReduce Scheduler for Heterogeneous Workloads Chao Tian, Haojie Zhou, Yongqiang He,Li Zha 簡報人:碩資工一甲 董耀文.
1 An SLA-Oriented Capacity Planning Tool for Streaming Media Services Lucy Cherkasova, Wenting Tang, and Sharad Singhal HPLabs,USA.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
Network Aware Resource Allocation in Distributed Clouds.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Active Monitoring in GRID environments using Mobile Agent technology Orazio Tomarchio Andrea Calvagna Dipartimento di Ingegneria Informatica e delle Telecomunicazioni.
An Integration Framework for Sensor Networks and Data Stream Management Systems.
Storage Management in Virtualized Cloud Environments Sankaran Sivathanu, Ling Liu, Mei Yiduo and Xing Pu Student Workshop on Frontiers of Cloud Computing,
Fall 2000M.B. Ibáñez Lecture 01 Introduction What is an Operating System? The Evolution of Operating Systems Course Outline.
Young Suk Moon Chair: Dr. Hans-Peter Bischof Reader: Dr. Gregor von Laszewski Observer: Dr. Minseok Kwon 1.
Introduction  Client/Server technology is seen by many as the solution to the difficulty of linking together the various departments of corporation.
GRID’2012 Dubna July 19, 2012 Dependable Job-flow Dispatching and Scheduling in Virtual Organizations of Distributed Computing Environments Victor Toporkov.
임규찬. 1. Abstract 2. Introduction 3. Design Goals 4. Sample-Based Scheduling for Parallel Jobs 5. Implements.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
BOF: Megajobs Gracie: Grid Resource Virtualization and Customization Infrastructure How to execute hundreds of thousands tasks concurrently on distributed.
Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes Published in: High Performance Computing and Simulation (HPCS), 2013 International.
A dynamic optimization model for power and performance management of virtualized clusters Vinicius Petrucci, Orlando Loques Univ. Federal Fluminense Niteroi,
Data Replication and Power Consumption in Data Grids Susan V. Vrbsky, Ming Lei, Karl Smith and Jeff Byrd Department of Computer Science The University.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems with Multi-programming Chapter 4.
A Utility-based Approach to Scheduling Multimedia Streams in P2P Systems Fang Chen Computer Science Dept. University of California, Riverside
Chapter 3 System Performance and Models Introduction A system is the part of the real world under study. Composed of a set of entities interacting.
Supporting Load Balancing for Distributed Data-Intensive Applications Leonid Glimcher, Vignesh Ravi, and Gagan Agrawal Department of ComputerScience and.
A Grid-enabled Multi-server Network Game Architecture Tianqi Wang, Cho-Li Wang, Francis C.M.Lau Department of Computer Science and Information Systems.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
The IEEE International Conference on Cluster Computing 2010
1 Adaptive Parallelism for Web Search Myeongjae Jeon Rice University In collaboration with Yuxiong He (MSR), Sameh Elnikety (MSR), Alan L. Cox (Rice),
Scheduling MPI Workflow Applications on Computing Grids Juemin Zhang, Waleed Meleis, and David Kaeli Electrical and Computer Engineering Department, Northeastern.
6 march Building the INFN Grid Proposal outline a.ghiselli,l.luminari,m.sgaravatto,c.vistoli INFN Grid meeting, milano.
Author Utility-Based Scheduling for Bulk Data Transfers between Distributed Computing Facilities Xin Wang, Wei Tang, Raj Kettimuthu,
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
Ensieea Rizwani An energy-efficient management mechanism for large-scale server clusters By: Zhenghua Xue, Dong, Ma, Fan, Mei 1.
Zeta: Scheduling Interactive Services with Partial Execution Yuxiong He, Sameh Elnikety, James Larus, Chenyu Yan Microsoft Research and Microsoft Bing.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Resource Provision for Batch and Interactive Workloads in Data Centers Ting-Wei Chang, Pangfeng Liu Department of Computer Science and Information Engineering,
Optimizing Distributed Actor Systems for Dynamic Interactive Services
CPU SCHEDULING.
Hydra: Leveraging Functional Slicing for Efficient Distributed SDN Controllers Yiyang Chang, Ashkan Rezaei, Balajee Vamanan, Jahangir Hasan, Sanjay Rao.
2016 Citrix presentation.
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Cloud-Assisted VR.
Adaptive Cloud Computing Based Services for Mobile Users
CPU Scheduling G.Anuradha
CPU SCHEDULING.
Chapter 5: CPU Scheduling
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Process Management -Compiled for CSIT
Presentation transcript:

Architecture for Resource Allocation Services Supporting Interactive Remote Desktop Sessions in Utility Grids Vanish Talwar, HP Labs Bikash Agarwalla, Georgia Tech Sujoy Basu, HP Labs Raj Kumar, HP Labs Klara Nahrstedt, UIUC

2 MGC 2004 Utility Grids Consolidated data centers Blade Servers host all applications Data is accessed and stored at consolidated storage systems Multiple application domains Traditional batch jobs Interactive Remote Desktop Sessions eg. Microsoft Terminal Servers, Citrix, VNC Data Center Thin Clients Data Center UTILITY GRID Interactive Remote Desktop Sessions Batch Jobs Blade Server Storage Servers Data Center Blade Server Blade Server

3 MGC 2004 Utility Grids (contd.) Key Characteristics On-demand allocation of blade servers Sharing of blade servers among multiple users Heterogeneity of resources Scale of resources, users, applications Advantages Ease of manageability Reduced costs Applications of interest Batch: Technical applications Interactive sessions: CAD/CAM, financial, office applications

4 MGC 2004 The Problem Design a Resource Allocation Service for Utility Grids so as to satisfy QoS performance needs of interactive remote desktop sessions allow for sharing of resources across both batch and interactive sessions while maintaining a high overall throughput of the system minimizing the wait time for the user requests

5 MGC 2004 Outline Introduction Proposed Solution Key Research Contributions Proposed Framework Solution to Key Research Questions Simulation Related Work Conclusions and Future Work

6 MGC 2004 Key Research Contributions (Summary) Architectural Guidelines for a resource allocation service supporting interactive remote desktop sessions Simulation Studies for mixed workloads in Utility Grids

7 MGC 2004 RESOURCE MANAGEMENT SERVER COMPUTE NODE COMPUTE NODE COMPUTE NODE SITE User’s Request and Interaction with the System 1.Top level requests for remote desktop sessions 2. Allocate a compute node for the requested remote desktop session 3. Dispatch request Remote desktop session 4. Middle level requests for starting applications within a remote desktop session Application 5. Application specific workload consisting of the users’ interaction with a particular executing application

8 MGC 2004 Proposed Framework STANDARDINTERFACESTANDARDINTERFACE REPOSITORY Input Queue Pending Queue Generate Remote Desktop Session Performance Model Site Admission Control Resource Assignment 1.Resource Model 2.Application Performance Models 3. Real Time Utilization data from compute nodes RESOURCE MANAGEMENT SERVER

9 MGC 2004 Performance Models Application Performance Model captures the resource consumption requirement per application Profile vector for an application Ai represented by Ai = {Ci, Ni, Si, L Ni, L Si } Ci – CPU utilization requirement Ni – Network bandwidth requirement (between allocated blade server and thin client) Si – Storage bandwidth requirement (between allocated blade server and remote storage servers) L Ni – Network latency requirement (between allocated blade server and thin client) L Si – Storage latency requirement (between allocated blade server and remote storage servers)

10 MGC 2004 Performance Models (contd.) Remote desktop session performance model Generated dynamically for the set of applications requested within a remote desktop session Function of individual resource requirements of the requested applications Multiple possible execution models A1 A3 A2 A1 A3 A2 t1 t3 t2 A1 A3 A2 t1 t3 t2 t1 t3 t2 Simultaneous – Resource requirement taken as sum of individual application requirements Sequential – Resource requirement taken as max of individual application requirements Mixed – Resource requirement taken in between the 2 extremes of simultaneous and sequential execution

11 MGC 2004 Site Admission Control Problem Determine the set of blade servers that can admit the requested remote desktop session Input Profile for the requested remote desktop session Current utilization of the available blade servers Policies Admission Criterion Does the available resource utilization on the blade satisfy the requested resource utilization values for the remote desktop session without violating existing allocations?

12 MGC 2004 Resource Assignment System Multi Variable Best Fit Algorithm Tight Bin Packing to avoid fragmentation so that time to wait in pending queue reduces Weighted Best fit algorithm along dimensions of CPU, network, storage utilization 1. Determine available CPU cycles, N/W BW, Storage BW 2. Determine delta values between available resources and the desired resources for the requested remote desktop session 3. Determine, Wc = f(Cdelta, Compute Intensiveness) WN = f(Ndelta, Average expected display data size) WS = f(Sdelta, Data intensiveness) WNL = f(NLdelta, Interactiveness) WSL = f(NSdelta, Data intensiveness) 4. Weffective = Wc + WN + WS + WNL + WSL

13 MGC 2004 Session Admission Control Exists at the compute node for every executing remote desktop session Problem: Determine if the remote desktop session can admit the requested application Input Resources allocated to the remote desktop session Profiles for the currently executing applications Profile for the requested application Admission Criterion Does the available resource utilization for the remote desktop session satisfy the requested resource utilization values for the application without violating existing allocations?

14 MGC 2004 Outline Introduction Proposed Solution Key Research Contributions Proposed Framework Solution to Key Research Questions Simulation Related Work Conclusions and Future Work

15 MGC 2004 Simulation Setup Request classification Heavy and Light Interactive Sessions Heavy and Light Batch Jobs Request description Day Time Experiment Heavy Interactive Session, Light Batch Job Night Time Experiment Heavy Batch Job, Light Interactive Session

16 Results 100 batch jobs only 200 batch jobs only 500 interactive sessions Throughput (mins) Max Waiting Time (mins) 000 No Resource Sharing among mixed workloads (100 dedicated nodes) Day Time experiment Heavy Interactive Session, Light Batch job 100 batch jobs, 500 interactive sessions 200 batch jobs, 500 interactive sessions Throughput (mins) 728 (batch jobs) 722 (interactive sessions) 730 (batch jobs) 724 (interactive sessions) Max Waiting Time (mins) 611 Complete Resource Sharing among mixed workloads (100 shared nodes)

17 Results (contd.) 30 interactive sessions 200 interactive sessions 500 batch jobs Throughput (mins) No Resource Sharing among mixed workloads (100 dedicated nodes) Night Time experiment Light Interactive Session, Heavy Batch job 30 interactive sessions, 500 batch jobs 200 interactive sessions, 500 batch jobs Throughput (mins) 65 (interactive sessions) 660 (batch jobs) 779 (interactive sessions) 688 (batch jobs) Complete Resource Sharing among mixed workloads (100 shared nodes)

18 MGC 2004 Outline Introduction Proposed Solution Key Research Contributions Proposed Framework Solution to Key Research Questions Simulation Related Work Conclusions and Future Work

19 MGC 2004 Related Work Resource Allocation for different application domains Batch jobs 3-tier applications Thin Client Systems Citrix HP CCI Clearcube

20 MGC 2004 Summary Presented a resource allocation architecture supports interactive remote desktop sessions considers QoS requirements of applications and remote desktop sessions Simulation studies Mixed batch jobs and interactive sessions Studied effect on throughput and wait time

21 MGC 2004 Future Work More simulation studies Different resource sharing strategies Evaluating tradeoffs among various weight assignments Evaluation of overall system utilization under various workloads and different resource sharing strategies Architectural enhancements Admission Control strategies Resource Assignment strategies

22 MGC 2004 Questions? Thank You ! Bikash Agarwalla