The Owner Share scheduler for a distributed system 2009 International Conference on Parallel Processing Workshops Reporter:1098308111 李長霖.

Slides:



Advertisements
Similar presentations
Pricing for Utility-driven Resource Management and Allocation in Clusters Chee Shin Yeo and Rajkumar Buyya Grid Computing and Distributed Systems (GRIDS)
Advertisements

Current methods for negotiating firewalls for the Condor ® system Bruce Beckles (University of Cambridge Computing Service) Se-Chang Son (University of.
Evaluating the Cost-Benefit of Using Cloud Computing to Extend the Capacity of Clusters Presenter: Xiaoyu Sun.
Dynamic Thread Assignment on Heterogeneous Multiprocessor Architectures Pree Thiengburanathum Advanced computer architecture Oct 24,
SLA-Oriented Resource Provisioning for Cloud Computing
CPU Scheduling Questions answered in this lecture: What is scheduling vs. allocation? What is preemptive vs. non-preemptive scheduling? What are FCFS,
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
Institute of Networking and Multimedia, National Taiwan University, Jun-14, 2014.
CS444/CS544 Operating Systems Introduction to Synchronization 2/07/2007 Prof. Searleman
CoreGRID Workpackage 5 Virtual Institute on Grid Information and Monitoring Services Authorizing Grid Resource Access and Consumption Erik Elmroth, Michał.
A Parallel Computational Model for Heterogeneous Clusters Jose Luis Bosque, Luis Pastor, IEEE TRASACTION ON PARALLEL AND DISTRIBUTED SYSTEM, VOL. 17, NO.
Preemptive Behavior Analysis and Improvement of Priority Scheduling Algorithms Xiaoying Wang Northeastern University China.
02/04/2008CSCI 315 Operating Systems Design1 CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying.
5: CPU-Scheduling1 Jerry Breecher OPERATING SYSTEMS SCHEDULING.
Workload Management Massimo Sgaravatto INFN Padova.
Wk 2 – Scheduling 1 CS502 Spring 2006 Scheduling The art and science of allocating the CPU and other resources to processes.
A. Frank - P. Weisberg Operating Systems CPU Scheduling.
Jim Basney Computer Sciences Department University of Wisconsin-Madison Managing Network Resources in.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Lecture 5 Operating Systems.
OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
Location-aware MapReduce in Virtual Cloud 2011 IEEE computer society International Conference on Parallel Processing Yifeng Geng1,2, Shimin Chen3, YongWei.
Resource Provisioning based on Lease Preemption in InterGrid Mohsen Amini Salehi, Bahman Javadi, Rajkumar Buyya Cloud Computing and Distributed Systems.
1 Distributed Process Scheduling: A System Performance Model Vijay Jain CSc 8320, Spring 2007.
Young Suk Moon Chair: Dr. Hans-Peter Bischof Reader: Dr. Gregor von Laszewski Observer: Dr. Minseok Kwon 1.
William Easton. Introduction  Mobile Environments  Locking and Data Starvation  Mobile DB Architecture  Timing Mechanisms  Static Timer  Dynamic.
Y. Kotani · F. Ino · K. Hagihara Springer Science + Business Media B.V Reporter: 李長霖.
Semantic Interoperability Berlin, 25 March 2008 Semantically Enhanced Resource Allocator Marc de Palol Jorge Ejarque, Iñigo Goiri, Ferran Julià, Jordi.
1 RTOS Design Some of the content of this set of slides is taken from the documentation existing on the FreeRTOS website
1 University of Maryland Linger-Longer: Fine-Grain Cycle Stealing in Networks of Workstations Kyung Dong Ryu © Copyright 2000, Kyung Dong Ryu, All Rights.
CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.
BOF: Megajobs Gracie: Grid Resource Virtualization and Customization Infrastructure How to execute hundreds of thousands tasks concurrently on distributed.
Chapter 5 CPU Scheduling Bernard Chen Spring 2007.
VIPIN VIJAYAN 11/11/03 A Performance Analysis of Two Distributed Computing Abstractions.
Printed by Definition of Grid Resource Scheduling Scheduling diverse applications on heterogeneous, distributed, dynamic grid computing.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Scheduling in HPC Resource Management System: Queuing vs. Planning Matthias Hovestadt, Odej Kao, Alex Keller, and Achim Streit 2003 Job Scheduling Strategies.
Peter Couvares Associate Researcher, Condor Team Computer Sciences Department University of Wisconsin-Madison
Design Issues of Prefetching Strategies for Heterogeneous Software DSM Author :Ssu-Hsuan Lu, Chien-Lung Chou, Kuang-Jui Wang, Hsiao-Hsi Wang, and Kuan-Ching.
Static Process Scheduling
1 Adaptive Parallelism for Web Search Myeongjae Jeon Rice University In collaboration with Yuxiong He (MSR), Sameh Elnikety (MSR), Alan L. Cox (Rice),
A System Performance Model Distributed Process Scheduling.
Condor on WAN D. Bortolotti - INFN Bologna T. Ferrari - INFN Cnaf A.Ghiselli - INFN Cnaf P.Mazzanti - INFN Bologna F. Prelz - INFN Milano F.Semeria - INFN.
DIRAC Pilot Jobs A. Casajus, R. Graciani, A. Tsaregorodtsev for the LHCb DIRAC team Pilot Framework and the DIRAC WMS DIRAC Workload Management System.
Ensieea Rizwani An energy-efficient management mechanism for large-scale server clusters By: Zhenghua Xue, Dong, Ma, Fan, Mei 1.
1.  System Characteristics  Features of Real-Time Systems  Implementing Real-Time Operating Systems  Real-Time CPU Scheduling  An Example: VxWorks5.x.
Lecture 4 CPU scheduling. Basic Concepts Single Process  one process at a time Maximum CPU utilization obtained with multiprogramming CPU idle :waiting.
CPU scheduling.  Single Process  one process at a time  Maximum CPU utilization obtained with multiprogramming  CPU idle :waiting time is wasted 2.
lecture 5: CPU Scheduling
OpenPBS – Distributed Workload Management System
Scheduling and Fairness
Measurement-based Design
Chapter 5a: CPU Scheduling
Memory Thrashing Protection in Multi-Programming Environment
Condor – A Hunter of Idle Workstation
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
CS 143A - Principles of Operating Systems
Cluster Resource Management: A Scalable Approach
Lecture 21: Introduction to Process Scheduling
Moab® Automation Intelligence Overview
Basic Grid Projects – Condor (Part I)
CPU SCHEDULING.
Chapter 5: CPU Scheduling
Wide Area Workload Management Work Package DATAGRID project
GRUBER: A Grid Resource Usage SLA Broker
Lecture 21: Introduction to Process Scheduling
CPU SCHEDULING SIMULATION
Chapter 5: CPU Scheduling
Experiences in Running Workloads over OSG/Grid3
Kajornsak Piyoungkorn,
Presentation transcript:

The Owner Share scheduler for a distributed system 2009 International Conference on Parallel Processing Workshops Reporter: 李長霖

Outline Introduction Related Work The Owner-Share Enforcement Policy Performance Metrics Tests and Results Conclusion

INTRODUCTION Resource sharing represents a good method to make use of the processing capacity and data storage of a computational system. An important requirement in this situation is that resource owners must be able to access their share of the resources whenever they want to.

Owner Share Enforcement Policy (OSEP) Implement in Condor, which supports job preemption. OSEP dynamically adjusts the amount of allocated resources for users according to the amount of resources they provide.

Related Work Fair-Share policies try to distribute resources proportionally among users based on historical usage. From its definition, jobs already running are not preempted and users that are postponed are compensated with heavier use at a later moment.

THE OWNER-SHARE ENFORCEMENT POLICY In order to implement OSEP, the scheduling algorithm is divided in two main parts: Dynamic Algorithm is responsible for its dynamic behavior. Decision Algorithm is responsible for analyzing the user information about allocated resources and making preemption decisions according to OSEP.

Dynamic Algorithm The Owner-Share enforcement system needs updated data about resource usage in order to make the appropriate decisions. With this mechanism jobs can effectively state their requirements and preferences and, similarly, machines can specify requirements and preferences about the jobs they are willing to run. Use Condor’s ClassAds to provide the data needed by OSEP.

Decision Algorithm

PERFORMANCE METRICS Ideal case for OSEP available nodes. 2. Two users, u1 and u2, with the same owner share of resources, The first user has 10 active jobs and no idle jobs at time t0, and at t1 the user u2 submits 10 jobs.

A. Policy Violation Policy Violation (PV) measures the latency introduced by the real system when compared to the ideal situation.

B. Loss of Capacity Loss of Capacity (LC) defines the amount of the system utilization that was lost due to the actions of the enforcement algorithm.

C. Policy cost The policy cost (PC) measures the overhead caused by OSEP in the system or the waste of CPU cycles by job reprocessing. It is an important metric to evaluate the impact of checkpointing in OSEP application.

D. User satisfaction It is better for the user to wait and get more resources later than to get all the share of resources at the moment, depending on the system workload.

TESTS AND RESULTS A. Evaluating the impact of environment variations User 1 and user 2 have the same share of resources (50% for each one). User 1 submits jobs that execute for 3600 seconds each at t1 = 0s. User 2 submits jobs that execute only for 600 seconds each at moment t2 = 300s.

B. Evaluating the impact of several users and different shares System with 20 resources; Different Shares: user 1 with 30%, user 2 with 40% and user 3 and 4 with 15% each; 15 jobs per user, job size ranging from 600 to 3600 seconds each; t1 =0s, t2 =100s, t3 =200s e t4 =210s, where tx is the moment when user x submits his/her jobs;

CONCLUSION This paper presented a scheduling infrastructure for the Owner Share scheduler based on the distributed ownership concept. The results showed that the OSEP policy aims to provide a user satisfaction proportional to the user’s share of resources.