936 search results - page 68 / 188 » Task Graph Scheduling Using Timed Automata |
140
click to vote
ECRTS
2009
IEEE
14 years 11 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
110
click to vote
HPCN
2000
Springer
15 years 5 months ago
2000
Springer
Data futures in a metacomputing system refer to data products that have not yet been created but which can be uniquely named and manipulated. We employ data flow mechanisms expres...
132
click to vote
ENTCS
2006
15 years 1 months ago
2006
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
115
click to vote
IOR
2007
15 years 1 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
111
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...