DeepAI AI Chat
Log In Sign Up

Scheduling to Optimize Sojourn Time of Successful Jobs

by   Yuan Yao, et al.
University of Southern California

Deep neural networks training jobs and other iterative computations frequently include checkpoints where jobs can be canceled based on the current value of monitored metrics. While most of existing results focus on the performance of all jobs (both successfully completed and canceled), in this work we explore scheduling policies that improve the sojourn time of successful jobs, which are typically more valuable to the user. Our model assumes that each job has a known discrete size distribution (e.g., estimated from previous execution logs) where the largest size value indicates a successful completion, while other size values correspond to termination checkpoints. In the single-server case where all jobs are available for scheduling simultaneously, we prove that optimal schedules do not preempt jobs, even when preemption overhead is negligible. Based on this, we develop a scheduling policy that minimizes the sojourn time of successful jobs asymptotically, i.e., when the number of jobs grows to infinity. Through an extensive numerical study, we show that this policy performs better than existing alternatives even when the number of jobs is finite. For more realistic scenarios with multiple servers and dynamic jobs arrivals, we propose an online approach based on our single-server scheduling policy. Through an extensive simulation study, using real-world traces, we demonstrate that this online approach results in better average sojourn time for successful jobs as compared to existing techniques.


SEH: Size Estimate Hedging for Single-Server Queues

For a single server system, Shortest Remaining Processing Time (SRPT) is...

Genie: An Open Box Counterfactual Policy Estimator for Optimizing Sponsored Search Marketplace

In this paper, we propose an offline counterfactual policy estimation fr...

heSRPT: Parallel Scheduling to Minimize Mean Slowdown

Modern data centers serve workloads which are capable of exploiting para...

Characterization of the Gittins index for sequential multistage jobs

The optimal scheduling problem in single-server queueing systems is a cl...

New Recruiter and Jobs: The Largest Enterprise Data Migration at LinkedIn

In August 2019, we introduced to our members and customers the idea of m...

On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems

We study cost-sharing games in real-time scheduling systems where the ac...

Designing for Emergent Security in Heterogeneous Human-Machine Teams

This work seeks to design decisionmaking rules for autonomous agents to ...