93 search results - page 15 / 19 » Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm |
JAVA
2001
Springer
13 years 12 months ago
2001
Springer
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
EURONGI
2006
Springer
13 years 11 months ago
2006
Springer
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
SPAA
2003
ACM
14 years 22 days ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
ISCI
2008
13 years 7 months ago
2008
The recent evolution of wireless sensor networks have yielded a demand to improve energy-efficient scheduling algorithms and energy-efficient medium access protocols. This paper p...
SC
2009
ACM
14 years 2 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...