Buscar
Mostrando ítems 1-10 de 342
Teaching real-time with a scheduler simulator
(2001-01-01)
In this paper we describe a scheduler simulator for real-time tasks, RTsim, that can be used as a tool to teach real-time scheduling algorithms. It simulates a variety of preprogrammed scheduling policies for single and ...
Teaching real-time with a scheduler simulator
(2001-01-01)
In this paper we describe a scheduler simulator for real-time tasks, RTsim, that can be used as a tool to teach real-time scheduling algorithms. It simulates a variety of preprogrammed scheduling policies for single and ...
Modeling real-time schedulers for use in simulations through a graphical interface
(2017-01-01)
Simulators of real-time systems are usually oriented to the evaluation of how different schedulers perform under different loads. Existing simulators can be split into two groups, one where scheduling algorithms are native ...
Sufficient Schedulability Tests for EDF-Scheduled Real-Time Systems under Interference of a High Priority Task
(Sociedade Brasileira de Computação, 2013-11)
We provide four new schedulability tests for a scheduling model according to which there is a high priority task concurrently executed with a set of EDF-scheduled tasks. All tests are proved correct and have their performance ...
Operating room scheduling under waiting time constraints: the Chilean GES plan
(Springer, 2020)
In 2000, Chile introduced profound health reforms to achieve a more equitable and fairer system (GES plan). The reforms established a maximum waiting time between diagnosis and treatment for a set of diseases, described ...
A least upper bound on the fault tolerance of real-time systems
(Elsevier Science Inc, 2005-10-01)
This paper presents a method to deal with the reexecution of tasks in a hard real-time system subject to temporary faults. The set of tasks follows the Liu and Layland model: they are periodic, independent and preemptible. ...
Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
(Springer, 2012-11)
Optimal multiprocessor real-time schedulers incur significant overhead for preemptions and migrations. We present RUN, an efficient scheduler that reduces the multiprocessor problem to a series of uniprocessor problems. ...