Sciweavers

936 search results - page 21 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
ADAEUROPE
2008
Springer
13 years 12 months ago
On the Timed Automata-Based Verification of Ravenscar Systems
The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functiona...
Iulian Ober, Nicolas Halbwachs
ECRTS
2007
IEEE
14 years 4 months ago
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors
We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures...
Björn B. Brandenburg, James H. Anderson
PPAM
2005
Springer
14 years 3 months ago
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
Lukasz Masko, Pierre-François Dutot, Gregor...
INFOCOM
2011
IEEE
13 years 1 months ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...
FMSD
2007
97views more  FMSD 2007»
13 years 9 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...