357 search results - page 49 / 72 » Scheduling optional computations in fault-tolerant real-time... |
191
Voted
Publication
In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processo...
197
Voted
Presentation
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore process...
105
Voted
CCGRID
2001
IEEE
15 years 4 months ago
2001
IEEE
Global Computing achieves high throughput computing by harvesting a very large number of unused computing resources connected to the Internet. This parallel computing model target...
107
click to vote
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...
133
Voted
HPDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Long running High Performance Computing (HPC) applications at scale must be able to tolerate inevitable faults if they are to harness current and future HPC systems. Message Passi...