936 search results - page 142 / 188 » Task Graph Scheduling Using Timed Automata |
ICCD
2007
IEEE
15 years 5 months ago
2007
IEEE
While Speculative Multithreading (SM) on a Chip Multiprocessor (CMP) has the ability to speed-up hard-toparallelize applications, the power inefficiency of aggressive speculation ...
108
click to vote
CSREAESA
2008
15 years 2 months ago
2008
This paper discusses why the extensive scientific results on predicting embedded systems temporal behavior never, or very seldom, reaches the industrial community. We also point ou...
112
click to vote
CODES
2008
IEEE
15 years 7 months ago
2008
IEEE
To provide Quality of Service (QoS) guarantees in open and unpredictable environments, the utilization control problem is defined to keep the processor utilization at the schedula...
121
click to vote
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
— Existing workflow systems attempt to achieve high performance by intelligently scheduling tasks on resources, sometimes even attempting to move the largest data files on the hi...
119
click to vote
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
Given a set of real-time tasks scheduled using the earliest deadline first (EDF) algorithm, we discuss two techniques for reducing power consumption while meeting all timing requi...