1758 search results - page 205 / 352 » Schedule processes, not VCPUs |
174
click to vote
RTAS
2005
IEEE
16 years 14 days ago
2005
IEEE
Consider a team of robots equipped with sensors that collaborate with one another to achieve a common goal. Sensors on robots produce periodic updates that must be transmitted to ...
316
click to vote
ICCAD
2003
IEEE
16 years 5 days 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 ...
163
click to vote
ESA
2003
Springer
16 years 3 days 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...
187
click to vote
ESA
2009
Springer
15 years 11 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...
192
click to vote
RTCSA
2000
IEEE
15 years 11 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...