Communication Dans Un Congrès Année : 2022

Exploring scheduling algorithms for parallel task graphs: a modern game engine case study

Résumé

Game engines are at the heart of the design of modern video games. One of their functions is to keep a high frame rate by scheduling the tasks required to generate each frame (image). These tasks are organized in a soft real-time, parallel task graph, which is a scenario very few works have focused on, or adapted scheduling algorithms to. In this paper, we study the scheduling problem of game engines. We model the tasks and the scheduling problem by proling a commercial game engine, adapt and compare dierent scheduling algorithms, and propose two additional scheduling optimizations.

Fichier principal
Vignette du fichier
main.pdf (448.47 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
DOI

Cite 10.5281/zenodo.6532251 Jeu de données Regragui, M., Coye, B., Pilla, L. L., Namyst, R., & Barthou, D. (2022). Performance results of different scheduling algorithms used in the simulation of a modern game engine (Version 1.0) [Data set]. Zenodo. https://doi.org/10.5281/ZENODO.6532251

Dates et versions

hal-03580775 , version 1 (18-02-2022)

Licence

Identifiants

Citer

Mustapha Regragui, Baptiste Coye, Laércio Lima Pilla, Raymond Namyst, Denis Barthou. Exploring scheduling algorithms for parallel task graphs: a modern game engine case study. International European Conference on Parallel and Distributed Computing (Euro-Par), Aug 2022, Glasgow, United Kingdom. pp.103-118, ⟨10.1007/978-3-031-12597-3_7⟩. ⟨hal-03580775⟩
718 Consultations
1672 Téléchargements

Altmetric

Partager

  • More