Sciweavers

5 search results - page 1 / 1
» Maximizing the Fault Tolerance Capability of Fixed Priority ...
Sort
View
RTCSA
2008
IEEE
13 years 11 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
ECRTS
2000
IEEE
13 years 9 months ago
Tolerating faults while maximizing reward
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
TPDS
2008
169views more  TPDS 2008»
13 years 4 months ago
Dynamic Resource Management in Energy Constrained Heterogeneous Computing Systems Using Voltage Scaling
An ad hoc grid is a wireless heterogeneous computing environment without a fixed infrastructure. This study considers wireless devices that have different capabilities, have limite...
Jong-Kook Kim, Howard Jay Siegel, Anthony A. Macie...
HPDC
2010
IEEE
13 years 4 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 4 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...