Sciweavers

1119 search results - page 59 / 224
» Computing in the Presence of Timing Failures
Sort
View
PPOPP
2006
ACM
14 years 3 months ago
Fast and transparent recovery for continuous availability of cluster-based servers
Recently there has been renewed interest in building reliable servers that support continuous application operation. Besides maintaining system state consistent after a failure, o...
Rosalia Christodoulopoulou, Kaloian Manassiev, Ang...
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
14 years 1 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
SAC
1999
ACM
14 years 1 months ago
Transaction Processing in PRO-MOTION
To provide data consistency in the presence of failures and concurrency, database methods will continue to be important to the processing of shared information in a mobile computi...
Gary D. Walborn, Panos K. Chrysanthis
JAVA
2001
Springer
14 years 1 months ago
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, e...
Peter R. Cappello, Dimitros Mourloukos
IPPS
2010
IEEE
13 years 7 months ago
Supporting fault tolerance in a data-intensive computing middleware
Over the last 2-3 years, the importance of data-intensive computing has increasingly been recognized, closely coupled with the emergence and popularity of map-reduce for developin...
Tekin Bicer, Wei Jiang, Gagan Agrawal