MétaCan
← all works

TIAS: Two-level Information-Agnostic Job Scheduling in GPU Clusters

2021· article· en· 2 citations· W4285337568 on OpenAlex· 10.1109/insai54028.2021.00041

Why is this work in the frame?

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

Canadian affiliationAn author listed a Canadian institution. This is the only route the usual frame has.

The three-model screen

all 1,000 screened works →

All three models called this out of scope.

stratum: aff_core · design weight: 5595.24 (the sample is stratified; any rate computed without the weight is wrong)
Claude Opus 4.8OUT
genre: empirical
about Canada: no
confidence: high

GPU cluster job scheduling algorithm for deep learning workloads; a computer systems contribution, not a study of research.

GPT-5.6 (high)OUT
genre: empirical
about Canada: no
confidence: high

The work studies GPU job scheduling for machine-learning workloads, not research as a system or practice.

Grok 4.5OUT
genre: empirical
about Canada: no
confidence: high

Systems paper on GPU-cluster job scheduling for deep learning workloads, not study of research practice.

Abstract

In recent years, deep learning algorithms have shown a trend towards larger models and larger datasets. Centralized training is unable keep up with the training requirements due to limited storage and computing resources, thus distributed learning is becoming an important area of research for improving learning efficiency. There are many studies on using the features of deep learning workload to design a central scheduler for production clusters.While existing work has been focusing on overall completion time and resource efficiency, little attention has been paid to the execution deadlines. To achieve a balance between the goals of deadline and non-deadline jobs, we design a Two-level Information-Agnostic Scheduling strategy(TIAS), which can schedule the two kinds of jobs together without knowing jobs’ training duration. In the first level, we use different priority calculation methods for the two kinds of jobs; in the second level, we design a new indicator "queue urgency" based on three observations to sort deadline jobs within the same queue. Experiments on a trace-driven simulator prove that TIAS can achieve the best trade-off between deadline miss rate and non-deadline jobs’ average job completion time(JCT) compared to existing solutions.

Stored with the screening record, where it is evidence for the labels above.

The record

Venue
Topic
Distributed and Parallel Computing Systems
Field
Computer Science
Canadian institutions
University of Toronto
Funders
Keywords
Computer scienceScheduling (production processes)Processor schedulingParallel computingGPU clusterJob schedulerCUDAOperating systemMathematical optimizationCloud computingMathematics
Has abstract in OpenAlex
yes