Sciweavers

93 search results - page 18 / 19
» Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
Sort
View
EUROPAR
2005
Springer
13 years 11 months ago
A Grid Information Service Based on Peer-to-Peer
Abstract. Information Services are fundamental blocks of the Grid infrastructure. They are responsible for collecting and distributing information about resource availability and s...
Diego Puppin, Stefano Moncelli, Ranieri Baraglia, ...
CCGRID
2001
IEEE
13 years 9 months ago
XtremWeb: A Generic Global Computing System
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...
Gilles Fedak, Cécile Germain, Vincent N&eac...
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
13 years 5 months ago
CX: A scalable, robust network for parallel computing
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...
Peter R. Cappello, Dimitros Mourloukos
CODES
2007
IEEE
13 years 12 months ago
Scheduling and voltage scaling for energy/reliability trade-offs in fault-tolerant time-triggered embedded systems
In this paper we present an approach to the scheduling and voltage scaling of low-power fault-tolerant hard real-time applications mapped on distributed heterogeneous embedded sys...
Paul Pop, Kåre Harbo Poulsen, Viacheslav Izo...
PPAM
2005
Springer
13 years 11 months ago
A Web Computing Environment for Parallel Algorithms in Java
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer ...