936 search results - page 14 / 188 » Task Graph Scheduling Using Timed Automata |
ICCD
2006
IEEE
14 years 6 months ago
2006
IEEE
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
RTAS
2008
IEEE
14 years 4 months ago
2008
IEEE
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
ESTIMEDIA
2007
Springer
14 years 4 months ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...