1257 search results - page 64 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
114
click to vote
ECRTS
2010
IEEE
15 years 15 hour ago
2010
IEEE
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
SC
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
HPDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...