Sciweavers

Share
JSSPP
2007
Springer

QBETS: Queue Bounds Estimation from Time Series

9 years 12 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are typically “spaceshared,” each job must wait in a queue until sufficient processor resources become available to service it. In production computing settings, the queuing delay (experienced by users as the time between when the job is submitted and when it begins execution) is highly variable. Users often find this variability a drag on productivity as it makes planning difficult and intellectual continuity hard to maintain. In this work, we introduce an on-line system for predicting batch-queue delay and show that it generates correct and accurate bounds for queuing delay for batch jobs from 11 machines over a 9-year period. Our system comprises 4 novel and interacting components: a predictor based on nonparametric inference; an automated change-point detector; machinelearned, model-based clustering of ...
Daniel Nurmi, John Brevik, Richard Wolski
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where JSSPP
Authors Daniel Nurmi, John Brevik, Richard Wolski
Comments (0)
books