Predicting resource usage for enhanced job scheduling for opportunistic resources in HEP

被引:0
|
作者
Kuehn, Eileen [1 ]
Fischer, Max [1 ]
Lange, Sven [1 ]
Petzold, Andreas [1 ]
Heiss, Andreas [1 ]
机构
[1] Karlsruhe Inst Technol, Hermann Von Helmholtz Pl 1, D-76344 Eggenstein Leopoldshafen, Germany
关键词
D O I
10.1051/epjconf/202024507039
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
To overcome the computing challenge in High Energy Physics available resources must be utilized as e fficiently as possible. This targets algorithmic challenges in the workflows itself but also the scheduling of jobs to compute resources. To enable the best possible scheduling, job schedulers require accurate information about resource consumption of a job before it is even executed. It is the responsibility of the user to provide an accurate resource estimate required for jobs. However, this is quite a challenge for users as they (i) want to ensure their jobs to run correctly, (ii) must manage to deal with heterogeneous compute resources and (iii) face intransparent library dependencies and frequent updates. Users therefore tend to specify resource requests with an ample bu ffer. This inaccuracy results in ine fficient utilisation by either blocking unused resources or exceeding reserved resources. Especially in the context of opportunistic resource provisioning the inaccuracies have an even broader impact that does not even target utilisation of resources but also composition of the most suitable resources. The contribution of this paper is an analysis of production and end-user workflows in HEP with regards to optimizing the various resources types. We further propose a method to improve user estimates.
引用
收藏
页数:8
相关论文
共 50 条
  • [41] Information and scheduling in a dual resource constrained job shop
    Clemson Univ, Clemson, United States
    Int J Prod Res, 10 (2783-2802):
  • [42] A survey of job scheduling and resource management in grid computing
    Sharma, Raksha
    Soni, Vishnu Kant
    Mishra, Manoj Kumar
    Bhuyan, Prachet
    World Academy of Science, Engineering and Technology, 2010, 64 : 461 - 466
  • [43] Solution Merging in Matheuristics for Resource Constrained Job Scheduling
    Thiruvady, Dhananjay
    Blum, Christian
    Ernst, Andreas T.
    ALGORITHMS, 2020, 13 (10)
  • [44] Optimal Job Scheduling With Resource Packing for Heterogeneous Servers
    Xu, Huanle
    Liu, Yang
    Lau, Wing Cheong
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2021, 29 (04) : 1553 - 1566
  • [45] Resource constraints for preemptive job-shop scheduling
    Pape, Claude L.E.
    Baptiste, Philippe
    Constraints, 1998, 3 (04): : 263 - 287
  • [46] Simultaneous Job Scheduling and Resource Allocation on Parallel Machines
    Zhi-Long Chen
    Annals of Operations Research, 2004, 129 : 135 - 153
  • [47] Resource constraints for preemptive job-shop scheduling
    Pape C.L.E.
    Baptiste P.
    Constraints, 1998, 3 (4) : 263 - 287
  • [48] Information and scheduling in a dual resource constrained job shop
    Fredendall, LD
    Melnyk, SA
    Ragatz, G
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (10) : 2783 - 2802
  • [49] Resource intensity aware job scheduling in a distributed cloud
    Huang Daochao
    Zhu Chunge
    Zhang Hong
    Liu Xinran
    CHINA COMMUNICATIONS, 2014, 11 (02) : 175 - 184
  • [50] Simultaneous job scheduling and resource allocation on parallel machines
    Chen, ZL
    ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 135 - 153