Sciweavers

936 search results - page 24 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
ETFA
2006
IEEE
14 years 3 months ago
Memory-Aware Feedback Scheduling of Control Tasks
This paper presents the incorporation of an auto-tuning real-time garbage collector into a feedback-based on-line scheduling system. The studied feedback scheduler is designed to ...
Sven Gestegard Robertz, Dan Henriksson, Anton Cerv...
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
14 years 2 months ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
FORMATS
2006
Springer
14 years 1 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
IJFCS
2006
110views more  IJFCS 2006»
13 years 9 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 4 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini