936 search results - page 62 / 188 » Task Graph Scheduling Using Timed Automata |
118
click to vote
FORMATS
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We apply three different modeling frameworks -- timed automata (Uppaal), colored Petri nets and synchronous data flow -- to model a challenging industrial case study that...
110
click to vote
STRINGOLOGY
2008
15 years 2 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
100
click to vote
PDP
2009
IEEE
15 years 8 months ago
2009
IEEE
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
100
click to vote
FMSD
2007
15 years 1 months ago
2007
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
131
click to vote
CSREAESA
2003
15 years 2 months ago
2003
: This paper develops a matching and scheduling algorithm that accounts for both the execution time and the power consumption of the application. The power consumption of different...