Capacity planning and scheduling for jobs with uncertainty in resource usage and duration

被引:0
|
作者
Patra, Sunandita [1 ]
Pathan, Mehtab [2 ]
Mahfouz, Mahmoud [3 ]
Zehtabi, Parisa [3 ]
Ouaja, Wided [2 ]
Magazzeni, Daniele [3 ]
Veloso, Manuela [1 ]
机构
[1] JP Morgan, AI Res, New York, NY 10017 USA
[2] JP Morgan, CIB Athena Appl Intelligence, London, England
[3] JP Morgan, AI Res, London, England
来源
JOURNAL OF SUPERCOMPUTING | 2024年 / 80卷 / 15期
关键词
Capacity planning; Stochastic resource usage; Stochastic job durations; Scheduling under uncertainty; Sample average approximation; Constraint programming; Mixed integer linear programming; SAMPLING APPROACH; PROJECT;
D O I
10.1007/s11227-024-06282-8
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Organizations around the world schedule jobs (programs) regularly to perform various tasks dictated by their end users. With the major movement toward using a cloud computing infrastructure, our organization follows a hybrid approach with both cloud and on-prem servers. The objective of this work is to perform capacity planning, i.e., estimate resource requirements, and job scheduling for on-prem grid computing environments. A key contribution of our approach is handling uncertainty in both resource usage and duration of the jobs, a critical aspect in the finance industry where stochastic market conditions significantly influence job characteristics. For capacity planning and scheduling, we simultaneously balance two conflicting objectives: (a) minimize resource usage and (b) provide high quality of service to the end users by completing jobs by their requested deadlines. We propose approximate approaches using deterministic estimators and pair sampling-based constraint programming. Our best approach (pair sampling-based) achieves up to 41.6% estimated peak reduction in resource usage compared to manual scheduling without compromising on the quality of service.
引用
收藏
页码:22428 / 22461
页数:34
相关论文
共 50 条
  • [1] Scheduling jobs to minimize a convex function of resource usage
    Kis, Tamas
    Szoegi, Evelin
    COMPUTERS & OPERATIONS RESEARCH, 2024, 169
  • [2] Scheduling identical jobs with linear resource usage profile to minimize schedule length
    Rozycki, Rafal
    Waligora, Grzegorz
    2019 24TH INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN AUTOMATION AND ROBOTICS (MMAR), 2019, : 170 - 174
  • [3] Scheduling Jobs With Unknown Duration in Clouds
    Maguluri, Siva Theja
    Srikant, R.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (06) : 1938 - 1951
  • [4] Scheduling Jobs with Unknown Duration in Clouds
    Maguluri, Siva Theja
    Srikant, R.
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 1887 - 1895
  • [5] Planning and Scheduling Jobs on Grid Computing
    Pujiyanta, Ardi
    Nugroho, Lukito Edi
    Nugroho
    2018 INTERNATIONAL SYMPOSIUM ON ADVANCED INTELLIGENT INFORMATICS (SAIN), 2018, : 162 - 166
  • [6] Approximability of scheduling problems with resource consuming jobs
    Gyoergyi, Peter
    Kis, Tamas
    ANNALS OF OPERATIONS RESEARCH, 2015, 235 (01) : 319 - 336
  • [7] Resource constrained multi-project scheduling modeling under certainty and uncertainty duration
    Hu, Wen-Bin
    Yue, Yu
    Xu, Long
    Wang, Kai-Kai
    Xia, Chang
    Du, Bo
    Song, Wei
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2012, 18 (11): : 2398 - 2408
  • [8] Cress: Dynamic Scheduling for Resource Constrained Jobs
    Li, Yong
    Han, Jizhong
    Zhou, Wei
    2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), 2014, : 1945 - 1952
  • [9] Resource Aware Scheduling for EDA Regression Jobs
    Nanda, Saurav
    Parthasarathy, Ganapathy
    Choudhary, Parivesh
    Venkatachar, Arun
    EURO-PAR 2019: PARALLEL PROCESSING WORKSHOPS, 2020, 11997 : 639 - 651
  • [10] Approximability of scheduling problems with resource consuming jobs
    Péter Györgyi
    Tamás Kis
    Annals of Operations Research, 2015, 235 : 319 - 336