MAUI / TORQUE Torque: Job manager Accept and dispatch the job Provide the job status on batch system Maui:Make the decision concerning job execution. Work.

Slides:



Advertisements
Similar presentations
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Advertisements

HepSysMan 1 St /2 nd July 2004 Maui. HepSysMan 1 St /2 nd July 2004 Batch System Batch Server (pbsserver) Execution host (pbsmom Execution host (pbsmom)
Chapter 9 Uniprocessor Scheduling
Scheduling CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han.
CHAPTER 2 PROCESSOR SCHEDULING PART I By U ğ ur HALICI.
Operating Systems Process Scheduling (Ch 3.2, )
1 Uniprocessor Scheduling Types of scheduling –The aim of processor scheduling is to assign processes to be executed by the processor so as to optimize.
Chapter 9 Uniprocessor Scheduling
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008,
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008,
Enabling Grids for E-sciencE TORQUE and MAUI Tutorial WLCG Workshop January 2007 Steve Traylen, CERN,
WELCOME TO THETOPPERSWAY.COM
Operating System Process Scheduling (Ch 4.2, )
CPU Scheduling CS 416: Operating Systems Design, Spring 2001
Operating System I Process Scheduling. Schedulers F Short-Term –“Which process gets the CPU?” –Fast, since once per 100 ms F Long-Term (batch) –“Which.
Dr Mohamed Menacer College of Computer Science and Engineering Taibah University CS-334: Computer.
Scheduling. Unix Scheduling Allocating CPU to a Process The amount of time that a process is allocated the CPU is called a time quantum Processes are.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling The key to multiprogramming is scheduling Scheduling is done to meet the goals of –Response time.
Cs238 CPU Scheduling Dr. Alan R. Davis. CPU Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU.
5: CPU-Scheduling1 Jerry Breecher OPERATING SYSTEMS SCHEDULING.
Computer Organization and Architecture
1 Uniprocessor Scheduling Chapter 9. 2 Aims of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency.
Informationsteknologi Tuesday, October 9, 2007Computer Systems/Operating Systems - Class 141 Today’s class Scheduling.
Operating Systems Process Scheduling (Ch 4.2, )
Operating Systems (CSCI2413) Lecture 3 Processes phones off (please)
Operating System Process Scheduling (Ch 4.2, )
CS364 CH08 Operating System Support TECH Computer Science Operating System Overview Scheduling Memory Management Pentium II and PowerPC Memory Management.
Layers and Views of a Computer System Operating System Services Program creation Program execution Access to I/O devices Controlled access to files System.
CPU Scheduling Chapter 6 Chapter 6.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Lecture 5 Operating Systems.
Lecture 5: Uniprocessor Scheduling
OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.
Chapter 9 Uniprocessor Scheduling Spring, 2011 School of Computer Science & Engineering Chung-Ang University.
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Chapter 9 Uniprocessor Scheduling Seventh Edition By William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Operating Systems: Internals.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 3: Operating Systems Computer Science: An Overview Tenth Edition.
Chapter 5 Operating System Support. Outline Operating system - Objective and function - types of OS Scheduling - Long term scheduling - Medium term scheduling.
Yeti Operations INTRODUCTION AND DAY 1 SETTINGS. Rob Lane HPC Support Research Computing Services CUIT
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.
Operating System Chapter 9. Uniprocessor Scheduling
The Owner Share scheduler for a distributed system 2009 International Conference on Parallel Processing Workshops Reporter: 李長霖.
CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling Minimize response time Maximize throughput Maximize processor efficiency.
Lecture 8: 9/19/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
1 Uniprocessor Scheduling Chapter 9. 2 Aim of Scheduling Response time Throughput Processor efficiency.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling Response time Throughput Processor efficiency.
Uniprocessor Scheduling
CIS250 OPERATING SYSTEMS Chapter 6 - CPU Scheduling Basic Concepts The objective of multi-programming is have a program running at all times Maximize.
Uniprocessor Scheduling Chapter 9. Aim of Scheduling Assign processes to be executed by the processor or processors: –Response time –Throughput –Processor.
CPU Scheduling CSCI Introduction By switching the CPU among processes, the O.S. can make the system more productive –Some process is running at.
Chapter 9 Uniprocessor Scheduling Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008,
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.
1 Uniprocessor Scheduling Chapter 9. 2 Aim of Scheduling Assign processes to be executed by the processor(s) Response time Throughput Processor efficiency.
Uniprocessor Scheduling Chapter 9 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Memory Management.
OpenPBS – Distributed Workload Management System
Day 23 Virtual Memory.
Day 24 Virtual Memory.
Lecture 8: Dispatch Rules
Uniprocessor Scheduling
CPU SCHEDULING.
Process Scheduling Decide which process should run and for how long
Uniprocessor Process Management & Process Scheduling
Concurrency and Threading: CPU Scheduling
Uniprocessor Scheduling
Uniprocessor Scheduling
Uniprocessor Process Management & Process Scheduling
Presentation transcript:

MAUI / TORQUE Torque: Job manager Accept and dispatch the job Provide the job status on batch system Maui:Make the decision concerning job execution. Work by iteration or on demand ( end of job, new job incoming). Torque is a « black box » to push the job, and Maui is the brain who decide what job have to be push first.

MAUI JOB STATUS AND PRIORITY Three levels of job status are available from MAUI Active: Job are running Idle: Priority of the job is calculated from the scheduling rules but the job is not running. Idle job list is a view of the job already scheduled. Blocked : Scheduling rules are not apply to the job because a hard rules is apply on this job. Job priority is define from 6 components Credential, Fairshare, Resources, Services, Target, Usage Priority = Credential + Faishare +Resources +…..

MAUI PRIORITY Credential Priority = CREDWEIGHT * ( USERWEIGHT *PriorityU + GROUPWEIGHT *PriorityG + ACCOUNTWEIGHT*PriorityA + QOSWEIGHT*PriorityQ + CLASSWEIGHT*PriorityC) Resource Priority = RESWEIGHT * ( NODEWEIGHT *TotalNodesReq + proc, mem, swap, disk,… Service A set of subcomponent to specifies which services metrics are greatest value QUEUETIME : FIFO order priority XFACTOR : Increase the short jobs priority ……

MAUI PRIORITY Fairshare Priority = FSWEIGHT * ( FSUSERWEIGHT *DeltaU + FSGROUPWEIGHT *DeltaG + FSACCOUNTWEIGHT*DelatA + FSQOSWEIGHT*DeltaQ + FSCLASSWEIGHT*DeltaC) DeltaX = Fairshare target – Fairshare usage or 1 – (Fairshare usage/ Fairshare target) ( depending of FSPOLICY value) Fairshare usage define from « processor dedicated » or « processor consumed » depending of the FSPOLICY value Fairshare usage are based on historical usage FSINTERVAL duration of each fairshare window FSDEPTH number of fairshare windows factored into current fairshare utilization FSDECAY decay factor applied to weighting the contribution of each fairshare window

MAUI PRIORITY Use a limited number of component ( credentiel and/or fairshare should be enough). Try to use a minimal set of element ( user, group, class,…) to build priority rules. Have a look to be sure that no one jobs fall on a « black hole ». Have a look to be sure that the reality of the scheduling is close to expected scheduling ( Maui now can run on simulate mode). Example : fairshare of 80% for ATLAS production job.