Capacity Planning and Scheduling for Jobs with Uncertainty in Resource Usage and Duration
Sunandita Patra, Mehtab Pathan, Mahmoud Mahfouz, Parisa Zehtabi, Wided Ouaja, Daniele Magazzeni, and Manuela Veloso

TL;DR
This paper presents a novel approach for capacity planning and job scheduling in hybrid cloud and on-prem environments, effectively managing uncertainty in resource usage and duration to optimize resource use and meet deadlines.
Contribution
It introduces a pair sampling-based constraint programming method that handles uncertainty and balances resource efficiency with quality-of-service in scheduling.
Findings
Pair sampling-based approach reduces peak resource usage significantly.
Method maintains high quality-of-service by meeting job deadlines.
Approximate deterministic estimators provide effective scheduling solutions.
Abstract
Organizations around the world schedule jobs (programs) regularly to perform various tasks dictated by their end users. With the major movement towards 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
