Abstract

CRAB3 is a workload management tool used by CMS physicists to analyze data acquired by the Compact Muon Solenoid (CMS) detector at the CERN Large Hadron Collider (LHC). Research in high energy physics often requires the analysis of large collections of files, referred to as datasets. The task is divided into jobs that are distributed among a large collection of worker nodes throughout the Worldwide LHC Computing Grid (WLCG).Splitting a large analysis task into optimally sized jobs is critical to efficient use of distributed computing resources. Jobs that are too big will have excessive runtimes and will not distribute the work across all of the available nodes. However, splitting the project into a large number of very small jobs is also inefficient, as each job creates additional overhead which increases load on infrastructure resources.Currently this splitting is done manually, using parameters provided by the user. However the resources needed for each job are difficult to predict because of frequent variations in the performance of the user code and the content of the input dataset. As a result, dividing a task into jobs by hand is difficult and often suboptimal.In this work we present a new feature called “automatic splitting” which removes the need for users to manually specify job splitting parameters. We discuss how HTCondor DAGMan can be used to build dynamic Directed Acyclic Graphs (DAGs) to optimize the performance of large CMS analysis jobs on the Grid.We use DAGMan to dynamically generate interconnected DAGs that estimate the processing time the user code will require to analyze each event. This is used to calculate an estimate of the total processing time per job, and a set of analysis jobs are run using this estimate as a specified time limit. Some jobs may not finish within the alloted time; they are terminated at the time limit, and the unfinished data is regrouped into smaller jobs and resubmitted.

Highlights

  • - Key developments of the Ganga taskmanagement framework I A Dzhunov, M J Kenyon, J Moscicki et al

  • Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence

  • A7 TQ+2bbBM; DQ# 2t+22/b i?Bb HBKBi- Bi Bb i2`KBMi2/ M/ i?2 TQbi@DQ# b+`BTi2imMb i?2 +QKTH2i2/ `2bmHib M/ `2TQib i?2 mM+QKTH2i2/ BMTmiX h?2 bTHBiiBM; H;QBi?K BbmM QM i?Bb BMTmi M/ bKHH2` iBH DQ#b2 `2bm#KBii2/ i?i miBHBx2 KQ2 Q7 i?2 pBH#H2 rQF2` MQ/2b M/ KBMBKBx2 i?2 iBK2 iQ +QKTH2iBQM Q7 i?2 7mHH ibF- b b?QrM BM 6B;m2 8X

Read more

Summary

Introduction

- Key developments of the Ganga taskmanagement framework I A Dzhunov, M J Kenyon, J Moscicki et al. ATHBiiBM; H;2 MHvbBb ibF BMiQ QTiBKHHv bBx2/ DQ#b Bb +`BiB+H iQ 2{+B2Mi mb2 Q7 /BbiB#mi2/ +QKTmiBM; `2bQm+2bX CQ#b i?i2 iQQ #B; rBHH ?p2 2t+2bbBp2 `mMiBK2b M/ rBHH MQi /BbiB#mi2 i?2 rQF +`Qbb HH Q7 i?2 pBH#H2 MQ/2bX >Qr2p2`- bTHBiiBM; i?2 TQD2+i BMiQ H;2 MmK#2` Q7 p2`v bKHH DQ#b Bb HbQ BM2{+B2Mi- b 2+?

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call