HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

YARTISS: A Tool to Visualize, Test, Compare and Evaluate Real-Time Scheduling Algorithms

Abstract : In this paper, we present a free software written in Java, YARTISS, which is a real-time multiprocessor scheduling simulator. It is aimed at comparing user-customized algorithms with ones from the literature on real-time scheduling. This simulator is designed as an easy-to-use modular tool in which new modules can be added without the need to decompress, edit nor recompile existing parts. It can simulate the execution of a large number of concurrent periodic independent task sets on multiprocessor systems and generate clear visual results of the scheduling process (both schedules and tunable metrics presentations). Other task models are already implemented in the simulator, like graph tasks with precedence constraints and it is easily extensible to other task models. Moreover, YARTISS can simulates task sets in which the energy consumptions is a scheduling parameter in the same manner as the Worst Case Execution Time (WCET).
Document type :
Complete list of metadata

Contributor : Damien Masson Connect in order to contact the contributor
Submitted on : Friday, April 27, 2012 - 5:19:00 PM
Last modification on : Thursday, February 17, 2022 - 10:08:03 AM
Long-term archiving on: : Monday, November 26, 2012 - 3:56:52 PM


Publisher files allowed on an open archive


  • HAL Id : hal-00691985, version 1



Younès Chandarli, Frédéric Fauberteau, Damien Masson, Serge Midonnet, Manar Qamhieh. YARTISS: A Tool to Visualize, Test, Compare and Evaluate Real-Time Scheduling Algorithms. UPE LIGM ESIEE. 2012. ⟨hal-00691985v1⟩



Record views


Files downloads