Sciweavers

40 search results - page 5 / 8
» Robust Aperiodic Scheduling Under Dynamic Priority Systems
Sort
View
CIRA
2007
IEEE
182views Robotics» more  CIRA 2007»
15 years 4 months ago
Communication-Efficient Dynamic Task Scheduling for Heterogeneous Multi-Robot Systems
— In this paper, a communication-efficient dynamic task scheduling algorithm for a heterogeneous multi-robot system is proposed. To make this task scheduling algorithm to be scal...
Kashyap Shah, Yan Meng
RTS
2010
175views more  RTS 2010»
14 years 4 months ago
Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
Safety-critical real-time standards define several criticality levels for the tasks (e.g., DO-178B - Software Considerations in Airborne Systems and Equipment Certification). Clas...
François Dorin, Pascal Richard, Michaë...
ECRTS
2010
IEEE
14 years 10 months ago
The Multiprocessor Bandwidth Inheritance Protocol
Abstract--In this paper, the Multiprocessor Bandwidth Inheritance (M-BWI) protocol is presented, which constitutes an extension of the Bandwidth Inheritance (BWI) protocol to symme...
Dario Faggioli, Giuseppe Lipari, Tommaso Cucinotta
RTSS
2002
IEEE
15 years 2 months ago
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
Enrico Bini, Giorgio C. Buttazzo
CEE
2007
107views more  CEE 2007»
14 years 9 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl