PROOF work progress. Progress on PROOF The TCondor class was rewritten. Tested on a condor pool with 44 nodes. Monitoring with Ganglia page. The tests.

Slides:



Advertisements
Similar presentations
CSC 360- Instructor: K. Wu Overview of Operating Systems.
Advertisements

Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.
CPU Scheduling Questions answered in this lecture: What is scheduling vs. allocation? What is preemptive vs. non-preemptive scheduling? What are FCFS,
 Basic Concepts  Scheduling Criteria  Scheduling Algorithms.
Operating Systems Chapter 6
Chapter 3 Operating Systems. Chapter 3 Operating Systems 3.1 The Evolution of Operating Systems 3.1 The Evolution of Operating Systems 3.2 Operating System.
1 Thursday, June 15, 2006 Confucius says: He who play in root, eventually kill tree.
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.
©Brooks/Cole, 2003 Chapter 7 Operating Systems Dr. Barnawi.
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.
Efficiently Sharing Common Data HTCondor Week 2015 Zach Miller Center for High Throughput Computing Department of Computer Sciences.
Site Report US CMS T2 Workshop Samir Cury on behalf of T2_BR_UERJ Team.
Operating Systems: Principles and Practice
Derek Wright Computer Sciences Department, UW-Madison Lawrence Berkeley National Labs (LBNL)
JGI/NERSC New Hardware Training Kirsten Fagnan, Seung-Jin Sul January 10, 2013.
1 Uniprocessor Scheduling Chapter 9. 2 Aim of Scheduling Main Job: Assign processes to be executed by the processor(s) and processes to be loaded in main.
PROOF: the Parallel ROOT Facility Scheduling and Load-balancing ACAT 2007 Jan Iwaszkiewicz ¹ ² Gerardo Ganis ¹ Fons Rademakers ¹ ¹ CERN PH/SFT ² University.
SONA SYSTEM: RESEARCHER GUIDE
December 8 & 9, 2005, Austin, TX SURA Cyberinfrastructure Workshop Series: Grid Technology: The Rough Guide Configuring Resources for the Grid Jerry Perez.
Operating Systems.  Operating System Support Operating System Support  OS As User/Computer Interface OS As User/Computer Interface  OS As Resource.
CS212: OPERATING SYSTEM Lecture 3: Process Scheduling 1.
OPERATING SYSTEMS CPU SCHEDULING.  Introduction to CPU scheduling Introduction to CPU scheduling  Dispatcher Dispatcher  Terms used in CPU scheduling.
The Glidein Service Gideon Juve What are glideins? A technique for creating temporary, user- controlled Condor pools using resources from.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 1 Introduction Read:
Computing and LHCb Raja Nandakumar. The LHCb experiment  Universe is made of matter  Still not clear why  Andrei Sakharov’s theory of cp-violation.
Introduction to the Theory of Constraints (TOC) & Critical Chain Project Management (CCPM) Major Mark McNabb.
Chapter 5 Operating System Support. Outline Operating system - Objective and function - types of OS Scheduling - Long term scheduling - Medium term scheduling.
Win32 Programming Lesson 10: Thread Scheduling and Priorities.
Chapter 101 Multiprocessor and Real- Time Scheduling Chapter 10.
1 Multiprocessor and Real-Time Scheduling Chapter 10 Real-Time scheduling will be covered in SYSC3303.
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 Gursharan Singh Tatla 1-Feb-20111www.eazynotes.com.
Ideas for a virtual analysis facility Stefano Bagnasco, INFN Torino CAF & PROOF Workshop CERN Nov 29-30, 2007.
CPU Scheduling CSCI 444/544 Operating Systems Fall 2008.
1 Scheduling The part of the OS that makes the choice of which process to run next is called the scheduler and the algorithm it uses is called the scheduling.
Testing the dynamic per-query scheduling (with a FIFO queue) Jan Iwaszkiewicz.
Condor Usage at Brookhaven National Lab Alexander Withers (talk given by Tony Chan) RHIC Computing Facility Condor Week - March 15, 2005.
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.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 3: Process-Concept.
ITFN 2601 Introduction to Operating Systems Lecture 4 Scheduling.
Peter Couvares Associate Researcher, Condor Team Computer Sciences Department University of Wisconsin-Madison
Tier3 monitoring. Initial issues. Danila Oleynik. Artem Petrosyan. JINR.
PROOF Benchmark on Different Hardware Configurations 1 11/29/2007 Neng Xu, University of Wisconsin-Madison Mengmeng Chen, Annabelle Leung, Bruce Mellado,
SPI NIGHTLIES Alex Hodgkins. SPI nightlies  Build and test various software projects each night  Provide a nightlies summary page that displays all.
Embedded Computer - Definition When a microcomputer is part of a larger product, it is said to be an embedded computer. The embedded computer retrieves.
T3g software services Outline of the T3g Components R. Yoshida (ANL)
Latest Improvements in the PROOF system Bleeding Edge Physics with Bleeding Edge Computing Fons Rademakers, Gerri Ganis, Jan Iwaszkiewicz CERN.
1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Data Analysis w ith PROOF, PQ2, Condor Data Analysis w ith PROOF, PQ2, Condor Neng Xu, Wen Guan, Sau Lan Wu University of Wisconsin-Madison 30-October-09.
1 Uniprocessor Scheduling Chapter 3. 2 Alternating Sequence of CPU And I/O Bursts.
Lecture 4 Page 1 CS 111 Summer 2013 Scheduling CS 111 Operating Systems Peter Reiher.
Scheduling.
Sona Software Workshop University of Sussex Department of Psychology.
Grid Computing: An Overview and Tutorial Kenny Daily BIT Presentation 22/09/2016.
Valencia Cluster status Valencia Cluster status —— Gang Qin Nov
Virtual Memory.
CPU SCHEDULING.
LCGAA nightlies infrastructure
CPU Scheduling G.Anuradha
Chapter 5: CPU Scheduling
Condor and Multi-core Scheduling
Operating Systems.
Processes and Threads Part III
CPU SCHEDULING.
Chapter 5: CPU Scheduling
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Chapter 3: Processes Process Concept Process Scheduling
Presentation transcript:

PROOF work progress

Progress on PROOF The TCondor class was rewritten. Tested on a condor pool with 44 nodes. Monitoring with Ganglia page. The tests we have done: Single user with multi-sessions. Multiple users with single session. Multiple users with multiple sessions. Various scheduling parameters tests.

The Developing PROOF+COD Model Normal Production Condor jobs PROOF jobs Condor Master PROOF Master Condor + Xrootd + PROOF pool COD requests PROOF requests 3 The local storage on each machine Neng Xu, University of Wisconsin-Madison 11/29/2007

New Batch PROOF+COD Model Normal Production Condor jobs Interactitive PROOF jobs Condor Master PROOF Master Condor + Xrootd + PROOF pool COD requests PROOF requests 4 The local storage on each machine Neng Xu, University of Wisconsin-Madison 11/29/2007 Batch PROOF jobs Condor Scheduler for PROOF

Advantages of Batch PROOF system Users don’t really need always “watch” the PROOF session. Recent PROOF scheduling system doesn’t remember the historical usage of users. This can be done with Monaliza plug-in but it’s complicated to setup. Batch PROOF jobs can be schedule by Condor scheduling system. Condor will release the jobs to PROOF master based on the users’ priority. Condor also can control how many session can be released by setting up the job slots on the Scheduler. Interactive PROOF jobs still get the highest priority because they directly talk to PROOF Master. (Here we suggest users only use interactive jobs for example testing.)

Problems of Batch PROOF system Condor still can not fully control the PROOF session. Job resume problem.(If Scheduler crashed, job will still run. Condor resume the job but it can not fine the old one.) Interactive jobs don’t affect the users’ priority. No preemption and suspension at this point. High priority jobs need to wait until the running jobs to finish.

Multi-user scheduling for PROOF Control of the number of workers assigned each session: Roundrobin: every session gets same amount of workers. This is good for Batch PROOF jobs because Condor scheduler controls number of sessions. The system won’t be over loaded. Random: Session get random number of workers but each worker only be assigned once. Load based: taking account of the load. Based on following parameters. Fraction: Optwkr: Minforquery: