Towards providing reliable job completion time predictions using PCS
- URL: http://arxiv.org/abs/2401.10354v1
- Date: Thu, 18 Jan 2024 19:46:24 GMT
- Title: Towards providing reliable job completion time predictions using PCS
- Authors: Abdullah Bin Faisal and Noah Martin and Hafiz Mohsin Bashir and
Swaminathan Lamelas and Fahad R. Dogar
- Abstract summary: PCS is a new scheduling framework that aims to provide predictability while balancing other traditional objectives.
PCS can provide accurate completion time estimates while marginally compromising on performance and fairness.
- Score: 0.874967598360817
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper we build a case for providing job completion time predictions
to cloud users, similar to the delivery date of a package or arrival time of a
booked ride. Our analysis reveals that providing predictability can come at the
expense of performance and fairness. Existing cloud scheduling systems optimize
for extreme points in the trade-off space, making them either extremely
unpredictable or impractical.
To address this challenge, we present PCS, a new scheduling framework that
aims to provide predictability while balancing other traditional objectives.
The key idea behind PCS is to use Weighted-Fair-Queueing (WFQ) and find a
suitable configuration of different WFQ parameters (e.g., class weights) that
meets specific goals for predictability. It uses a simulation-aided search
strategy, to efficiently discover WFQ configurations that lie on the Pareto
front of the trade-off space between these objectives. We implement and
evaluate PCS in the context of DNN job scheduling on GPUs. Our evaluation, on a
small scale GPU testbed and larger-scale simulations, shows that PCS can
provide accurate completion time estimates while marginally compromising on
performance and fairness.
Related papers
- Conditional Quantile Estimation for Uncertain Watch Time in Short-Video Recommendation [2.3166433227657186]
We introduce a novel estimation technique -- Conditional Quantile Estimation (CQE)
CQE utilizes quantile regression to capture the nuanced distribution of watch time.
We also design several strategies to enhance the quantile prediction including conditional expectation, conservative estimation, and dynamic quantile combination.
arXiv Detail & Related papers (2024-07-17T00:25:35Z) - Probabilistic Weather Forecasting with Hierarchical Graph Neural Networks [17.64833210797824]
We propose a probabilistic weather forecasting model called Graph-EFM.
The model combines a flexible latent-variable formulation with the successful graph-based forecasting framework.
Ensemble forecasts from Graph-EFM achieve equivalent or lower errors than comparable deterministic models.
arXiv Detail & Related papers (2024-06-07T09:01:25Z) - Contract Scheduling with Distributional and Multiple Advice [37.64065953072774]
Previous work has showed that a prediction on the interruption time can help improve the performance of contract-based systems.
We introduce and study more general and realistic learning-augmented settings in which the prediction is in the form of a probability distribution.
We show that the resulting system is robust to prediction errors in the distributional setting.
arXiv Detail & Related papers (2024-04-18T19:58:11Z) - Enhancing Mean-Reverting Time Series Prediction with Gaussian Processes:
Functional and Augmented Data Structures in Financial Forecasting [0.0]
We explore the application of Gaussian Processes (GPs) for predicting mean-reverting time series with an underlying structure.
GPs offer the potential to forecast not just the average prediction but the entire probability distribution over a future trajectory.
This is particularly beneficial in financial contexts, where accurate predictions alone may not suffice if incorrect volatility assessments lead to capital losses.
arXiv Detail & Related papers (2024-02-23T06:09:45Z) - SMURF-THP: Score Matching-based UnceRtainty quantiFication for
Transformer Hawkes Process [76.98721879039559]
We propose SMURF-THP, a score-based method for learning Transformer Hawkes process and quantifying prediction uncertainty.
Specifically, SMURF-THP learns the score function of events' arrival time based on a score-matching objective.
We conduct extensive experiments in both event type prediction and uncertainty quantification of arrival time.
arXiv Detail & Related papers (2023-10-25T03:33:45Z) - Score Matching-based Pseudolikelihood Estimation of Neural Marked
Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification.
Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching.
The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
arXiv Detail & Related papers (2023-10-25T02:37:51Z) - Performative Time-Series Forecasting [71.18553214204978]
We formalize performative time-series forecasting (PeTS) from a machine-learning perspective.
We propose a novel approach, Feature Performative-Shifting (FPS), which leverages the concept of delayed response to anticipate distribution shifts.
We conduct comprehensive experiments using multiple time-series models on COVID-19 and traffic forecasting tasks.
arXiv Detail & Related papers (2023-10-09T18:34:29Z) - QBSD: Quartile-Based Seasonality Decomposition for Cost-Effective Time
Series Forecasting [0.21756081703275998]
We introduce QBSD, a live forecasting approach tailored to optimize the trade-off between accuracy and computational complexity.
We have evaluated the performance of QBSD against state-of-the-art forecasting approaches on publicly available datasets.
arXiv Detail & Related papers (2023-06-09T15:59:27Z) - Towards More Fine-grained and Reliable NLP Performance Prediction [85.78131503006193]
We make two contributions to improving performance prediction for NLP tasks.
First, we examine performance predictors for holistic measures of accuracy like F1 or BLEU.
Second, we propose methods to understand the reliability of a performance prediction model from two angles: confidence intervals and calibration.
arXiv Detail & Related papers (2021-02-10T15:23:20Z) - Probabilistic electric load forecasting through Bayesian Mixture Density
Networks [70.50488907591463]
Probabilistic load forecasting (PLF) is a key component in the extended tool-chain required for efficient management of smart energy grids.
We propose a novel PLF approach, framed on Bayesian Mixture Density Networks.
To achieve reliable and computationally scalable estimators of the posterior distributions, both Mean Field variational inference and deep ensembles are integrated.
arXiv Detail & Related papers (2020-12-23T16:21:34Z) - AutoCP: Automated Pipelines for Accurate Prediction Intervals [84.16181066107984]
This paper proposes an AutoML framework called Automatic Machine Learning for Conformal Prediction (AutoCP)
Unlike the familiar AutoML frameworks that attempt to select the best prediction model, AutoCP constructs prediction intervals that achieve the user-specified target coverage rate.
We tested AutoCP on a variety of datasets and found that it significantly outperforms benchmark algorithms.
arXiv Detail & Related papers (2020-06-24T23:13:11Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.