936 search results - page 101 / 188 » Task Graph Scheduling Using Timed Automata |
123
click to vote
CODES
2003
IEEE
15 years 6 months ago
2003
IEEE
the level of abstraction in system design promises to enable faster exploration of the design space at early stages. While scheduling decision for embedded software has great impa...
104
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
121
click to vote
ITCC
2003
IEEE
15 years 6 months ago
2003
IEEE
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
103
click to vote
APCSAC
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
123
click to vote
ECAI
1998
Springer
15 years 5 months ago
1998
Springer
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...