Scientific Computing Division Juli Rew CISL User Forum May 19, 2005 Scheduler Basics.

Slides:



Advertisements
Similar presentations
CPU Scheduling.
Advertisements

Maninder Kaur OPERATING SYSTEM Maninder Kaur 11 Oct 2010.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 17 Scheduling III.
Operating Systems Chapter 6
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
A Grid Resource Broker Supporting Advance Reservations and Benchmark- Based Resource Selection Erik Elmroth and Johan Tordsson Reporter : S.Y.Chen.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
1 Pertemuan 8 Penjadwalan (lanjutan) Matakuliah: T0316/sistem Operasi Tahun: 2005 Versi/Revisi: 5.
Understanding Operating Systems 1 Overview Introduction Operating System Components Machine Hardware Types of Operating Systems Brief History of Operating.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Chapter 5-CPU Scheduling
Wk 2 – Scheduling 1 CS502 Spring 2006 Scheduling The art and science of allocating the CPU and other resources to processes.
December 8 & 9, 2005, Austin, TX SURA Cyberinfrastructure Workshop Series: Grid Technology: The Rough Guide Configuring Resources for the Grid Jerry Perez.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Basic Concepts Maximum CPU utilization.
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.
Bigben Pittsburgh Supercomputing Center J. Ray Scott
Grid Resource Allocation and Management (GRAM) Execution management Execution management –Deployment, scheduling and monitoring Community Scheduler Framework.
Recall: Three I/O Methods Synchronous: Wait for I/O operation to complete. Asynchronous: Post I/O request and switch to other work. DMA (Direct Memory.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Scheduling. Alternating Sequence of CPU And I/O Bursts.
Memory Thrashing Protection in Multi-Programming Environment Xiaodong Zhang Ohio State University College of William and Mary In collaborations with Song.
Operating Systems Process Management.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Operating Systems Scheduling. Bursts of CPU usage alternate with periods of waiting for I/O. (a) A CPU-bound process. (b) An I/O-bound process. Scheduling.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.
Chapter 5: Process Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Basic Concepts Maximum CPU utilization can be obtained.
Resource Management Task Report Thomas Röblitz 19th June 2002.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 5: CPU Scheduling Basic.
Faucets Queuing System Presented by, Sameer Kumar.
Peter Couvares Associate Researcher, Condor Team Computer Sciences Department University of Wisconsin-Madison
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.
6.1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
2004 Queue Scheduling and Advance Reservations with COSY Junwei Cao Falk Zimmermann C&C Research Laboratories NEC Europe Ltd.
1 Module 5: Scheduling CPU Scheduling Scheduling Algorithms Reading: Chapter
Basic Concepts Maximum CPU utilization obtained with multiprogramming
Operating System Concepts with Java – 7 th Edition, Nov 15, 2006 Silberschatz, Galvin and Gagne ©2007 Chapter 0: Historical Overview.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
OAR : a batch scheduler Grenoble University LIG (Mescal Team)
CPU SCHEDULING.
CS 425 / ECE 428 Distributed Systems Fall 2016 Nov 10, 2016
Practical aspects of multi-core job submission at CERN
QoS in the Tier1 batch system(LSF)
CS 425 / ECE 428 Distributed Systems Fall 2017 Nov 16, 2017
Chapter 6: CPU Scheduling
CPU Scheduling Basic Concepts Scheduling Criteria
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
Chapter 5: CPU Scheduling
Operating System Concepts
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter5: CPU Scheduling
Chapter 5: CPU Scheduling
Chapter 6: CPU Scheduling
CPU SCHEDULING.
Outline Scheduling algorithms Multi-processor scheduling
Chapter 5: CPU Scheduling
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Shortest-Job-First (SJR) Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
CPU Scheduling: Basic Concepts
Module 5: CPU Scheduling
Presentation transcript:

Scientific Computing Division Juli Rew CISL User Forum May 19, 2005 Scheduler Basics

Scientific Computing Division Overview IBM Scheduling Life of a Job Submit Filter Batch Priority Scheduler Factors Affecting BPS Job Scheduling LoadLeveler Load Sharing Facility Scheduling LSF Scheduling on Linux Systems Differences from IBM Scheduling

Scientific Computing Division IBM Scheduling: Life of a Job llsubmit job llsubmit job Submit Filter Requirements Processing Submit Filter Requirements Processing BPS Job Ordering BPS Job Ordering Requirements Problem Staff Rejects Job Requirements Problem Staff Rejects Job Build Ordered List of Jobs Build Ordered List of Jobs LoadLeveler Job Execution LoadLeveler Job Execution Job Starts Job Completes Requirements Not Met Reject Job Requirements Not Met Reject Job Done

Scientific Computing Division Submit Filter Features Checks the LoadLeveler job script for: - valid parameters - valid queue name - consistent combinations of features, eg., shared/not_shared, tasks_per_node/node options Moves jobs with allocation holds to hold queues Moves jobs with cutoff projects to standby queue

Scientific Computing Division Batch Priority Job Scheduler Features Written at NCAR Orders jobs based on policy Creates separate facilities (Community, Climate System Laboratory) Further separates jobs into proposal groups (NCAR/UNIV, CCSM/oCSL) Hands the final order list to LoadLeveler Allows for backfilling of jobs to avoid idle resources

Scientific Computing Division Bluesky Queue Priorities all_spec all_sp32 all_sp8 CSL NCAR UNIV csl_sp32 csl_pr32.. csl_sb32 COM NCAR UNIV com_sp32 com_pr32.. com_sb32 CSL CCSM oCSL csl_sp8 csl_pr8.. csl_sb8 COM CCSM oCSL com_sp8 com_pr8.. com_sb8 interactive, debug, share, test

Scientific Computing Division Prioritization of Jobs by BPS all_spec jobs run with the highest priority and can access all nodes Below that, all com and csl jobs divided equally Round Robin by Group/User all_spec com csl \ / top job 50-50% split not hard

Scientific Computing Division Other Factors Affecting Job Scheduling Backfilling - Jobs that will not interfere with start of highest priority job allowed to slip in - Sweet spot: < 3 hours and small node count Allocation Holds - Job flagged if a project/division exceeds its 30-day or 90-day allocation thresholds - H1 and H2 jobs reordered at a priority above standby but below non-flagged jobs Special Initiatives - Nodes reserved for real-time or other special runs

Scientific Computing Division Documentation and Utilities batchview command gives snapshot of current ordering Basic information on scheduling given at html

Scientific Computing Division LoadLeveler IBM's batch control job system Allows jobs to be started, stopped, or cancelled Controls allocation of resources (CPU, memory) Allows custom scheduler plug-in (e.g., BPS) Two mutually-exclusive options: LoadLeveler scheduler or custom scheduler.

Scientific Computing Division Load Sharing Facility Commercial product from Platform Computing Currently being used on major Linux platforms Also available for IBM, but still in evaluation Ability to do Hierarchical Fair-Share Scheduling with Backfill, based on same facility scheme used in BPS Community/CSL facility division implemented implicitly within the scheduler rather than explicitly by queue name Can schedule among multiple platforms - "Grid”

Scientific Computing Division Questions?