2544 search results - page 273 / 509 » Process pipeline scheduling |
299
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
While performance, area, and power constraints have been the driving force in designing current communication-enabled embedded systems, post-fabrication and run-time adaptability ...
145
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
165
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
163
click to vote
RTCSA
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
155
click to vote
AIPS
2007
15 years 8 months ago
2007
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...