Andy Haas – Columbia D0 Meeting b-ID: ** I'm on my own right now as convener... (might need more time at Fermi in the short term until new help arrives)

Slides:

Advertisements

Similar presentations

Scheduling Criteria CPU utilization – keep the CPU as busy as possible (from 0% to 100%) Throughput – # of processes that complete their execution per.

Advertisements

CS 241 Spring 2007 System Programming 1 Queuing Framework for Process Management Evaluation Lecture 20 Klara Nahrstedt.

 Basic Concepts  Scheduling Criteria  Scheduling Algorithms.

BRING UP B-TAGGING AT DØ Gordon Watts (Seattle/Marseille)

Operating Systems Chapter 6

Operating Systems CPU Scheduling. Agenda for Today What is Scheduler and its types Short-term scheduler Dispatcher Reasons for invoking scheduler Optimization.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.

CS 311 – Lecture 23 Outline Kernel – Process subsystem Process scheduling Scheduling algorithms User mode and kernel mode Lecture 231CS Operating.

Chapter 5-CPU Scheduling

02/11/2004CSCI 315 Operating Systems Design1 CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying.

Sun Grid Engine. Grids Grids are collections of resources made available to customers. Compute grids make cycles available to customers from an access.

Computing and LHCb Raja Nandakumar. The LHCb experiment  Universe is made of matter  Still not clear why  Andrei Sakharov’s theory of cp-violation.

Claudio Grandi INFN Bologna CMS Operations Update Ian Fisk, Claudio Grandi 1.

D0 Farms 1 D0 Run II Farms M. Diesburg, B.Alcorn, J.Bakken, T.Dawson, D.Fagan, J.Fromm, K.Genser, L.Giacchetti, D.Holmgren, T.Jones, T.Levshina, L.Lueking,

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.

Alternating Sequence of CPU And I/O Bursts. Histogram of CPU-burst Times.

CMSC 421 Spring 2004 Section 0202 Part II: Process Management Chapter 6 CPU Scheduling.

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.

Level 3 Trigger Leveling D. Cutts(Brown), A. Garcia-Bellido(UW), A. Haas(Columbia), G. Watts(UW)

DPF2000, 8/9-12/00 p. 1Richard E. Hughes, The Ohio State UniversityHiggs Searches in Run II at CDF Prospects for Higgs Searches at CDF in Run II DPF2000.

Plenary Physics Meeting, 17 June 05 Per Jonsson Imperial College London 1 Higgs Searches with 1 fb -1 Per Jonsson Imperial College London On behalf of.

Why A Software Review? Now have experience of real data and first major analysis results –What have we learned? –How should that change what we do next.

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.

Basic Concepts Maximum CPU utilization obtained with multiprogramming

1 Lecture 5: CPU Scheduling Operating System Fall 2006.

1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.

Search for Standard Model Higgs in ZH  l + l  bb channel at DØ Shaohua Fu Fermilab For the DØ Collaboration DPF 2006, Oct. 29 – Nov. 3 Honolulu, Hawaii.

Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.

Andy Haas – Columbia D0 Meeting b-ID: p17 certification Version 1.0 Had a bug! CSIP input was not being calculated correctly in nn_cert framework -> closure.

Andy Haas D0 Columbia Meeting Slide 1 Top mass, ME, lepton+jets, p17 ● e/mu pt>20, met>20, 4 jets pt>20 ● triangle cuts to remove QCD ● >=1 NN b-tagged.

Andy Haas – Columbia D0 Meeting b-ID: p17 certification version 0: a pre-preliminary version... TRFs and fake rates exist, in btags_cert Has a fairly major.

Tutorial 2: Homework 1 and Project 1

CPU SCHEDULING.

Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.

b-ID: p17 certification Version 1.0

Chapter 5a: CPU Scheduling

b-ID: p17 certification: Version 1.1 seems solid so far

Scheduling (Priority Based)

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling

Process management Information maintained by OS for process management

CPU Scheduling Basic Concepts Scheduling Criteria

CPU Scheduling G.Anuradha

Module 5: CPU Scheduling

Chapter 5: CPU Scheduling

b-ID Four taggers currently being worked on for p13

Operating System Concepts

3: CPU Scheduling Basic Concepts Scheduling Criteria

Chapter5: CPU Scheduling

Chapter 5: CPU Scheduling

Chapter 6: CPU Scheduling

Applying for a TA Position in CSE

Operating System Concepts

Chapter 5: CPU Scheduling

Lecture 2 Part 3 CPU Scheduling

DØ MC and Data Processing on the Grid

General recommendations

Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00

Chapter 6: CPU Scheduling

Module 5: CPU Scheduling

Do Now Complete this on your Daily Organizers:

Tim Scanlon Imperial College, London on behalf of the DØ Collaboration

Chapter 6: CPU Scheduling

CPU Scheduling: Basic Concepts

Module 5: CPU Scheduling

Presentation transcript:

Andy Haas – Columbia D0 Meeting b-ID: ** I'm on my own right now as convener... (might need more time at Fermi in the short term until new help arrives) p17 certification (v1.1): Note is in b-ID group review... (extended until we finish answering comments) p17 v2.0: (an update, for publications) Will be based on the final p17 JES, ready in ~2-3 months. I will work on this, along with Sarah Schlobohm. We've started learning nn_cert. 1) Submitted batch jobs to make nnntuples, data and MC. 2) Can skim the samples, get final nnntuples. 3) Have not run the last step... running the training, certification. Justace making progress with a certified SVT for p17. Yvonne making progress optimizing the SV reconstruction parameters (track pT, chi2, etc.)... -> random grid search in MC. Hwidong making progress with the SLT(mu)NN tagger -> ~5% extra b eff. with minimal extra fake rate. p20 We are generating MC (Z->qq and Z->bb) for a study of how much b-ID should improve due to L0.

Andy Haas – Columbia D0 Meeting Stopped Gluinos: Waiting for Dave's comments. Will bug him soon. I'm shooting now for publication approval by DPF (so the new limits can be shown there). p17 Search for NLLP->bb Stalled... p17 ZH(->mumubb): Working on systematics, analysis note. If time: Apply our fancy NN, and use CLs to set limits. Deadline: must be done for DPF, note to group by end of Sept. di-jet mass (GeV) Z + 2 b-tags

Andy Haas – Columbia D0 Meeting L3: We installed new farm nodes (32, borrowed from CAB) Can now get to ~180e30 before 100% CPU busy (was ~150e30 before) 16 more nodes this week... should get to 190e30 Sunday's store came in at 228e30! 122 new nodes coming, but not until the spring... Idea: try “trigger leveling”... buffer events in the farm nodes at the beginning of the run, and process them later on, when CPU is available. Gordon's simulation: equivalent to farm x 2 ! Have tested a longer buffer (need help from Scott) Have added some extra monitoring to the farm nodes: - queue length - queue latency Adding extra synchronization between the nodes: Routing Master to route each event to the node with the smallest latency (amongst nodes with identical number of free buffers)... Make sure that all events coming out of farm were taken at approximately the same time (+- 1 minute or so). Little impact on the rest of data taking... except examines will now be a little behind! We're discussing ways to bypass / deal with this...