Sciweavers

1119 search results - page 48 / 224
» Computing in the Presence of Timing Failures
Sort
View
SC
2009
ACM
16 years 16 days ago
Kestrel: an XMPP-based framework for many task computing applications
This paper presents a new distributed computing framework for Many Task Computing (MTC) applications, based on the Extensible Messaging and Presence Protocol (XMPP). A lightweight...
Lance Stout, Michael A. Murphy, Sebastien Goasguen
ICDCS
2005
IEEE
15 years 11 months ago
The Impossibility of Boosting Distributed Service Resilience
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
Paul C. Attie, Rachid Guerraoui, Petr Kouznetsov, ...
IPPS
2002
IEEE
15 years 10 months ago
Reliable Communication in Faulty Star Networks
‘ We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in...
Khaled Day, Abdel Elah Al-Ayyoub
IPSN
2005
Springer
15 years 11 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
ICDCS
1994
IEEE
15 years 9 months ago
Implementation of Process Migration in Amoeba
The design of a process migration mechanism for the Amoeba distributed operating system is described. The primary motivation for this implementation is to carry out experimental a...
Chris Steketee, Weiping Zhu, Philip Moseley