Algorithmic Techniques for GPU Scheduling: A Comprehensive Survey

Kaydedildi:
Detaylı Bibliyografya
Yayımlandı:Algorithms vol. 18, no. 7 (2025), p. 385-437
Yazar: Chab, Robert
Diğer Yazarlar: Li, Fei, Setia Sanjeev
Baskı/Yayın Bilgisi:
MDPI AG
Konular:
Online Erişim:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
Diğer Bilgiler
Özet:In this survey, we provide a comprehensive classification of GPU task scheduling approaches, categorized by their underlying algorithmic techniques and evaluation metrics. We examine traditional methods—including greedy algorithms, dynamic programming, and mathematical programming—alongside advanced machine learning techniques integrated into scheduling policies. We also evaluate the performance of these approaches across diverse applications. This work focuses on understanding the trade-offs among various algorithmic techniques, the architectural and job-level factors influencing scheduling decisions, and the balance between user-level and service-level objectives. The analysis shows that no one paradigm dominates; instead, the highest-performing schedulers blend the predictability of formal methods with the adaptability of learning, often moderated by queueing insights for fairness. We also discuss key challenges in optimizing GPU resource management and suggest potential solutions.
ISSN:1999-4893
DOI:10.3390/a18070385
Kaynak:Engineering Database