Sciweavers

334 search results - page 43 / 67
» Fundamentals of Fault-Tolerant Distributed Computing in Asyn...
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
15 years 6 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 1 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
IPPS
2006
IEEE
15 years 7 months ago
Babylon v2.0: middleware for distributed, parallel, and mobile Java applications
Babylon v2.0 is a collection of tools and services that provide a 100% Java compatible environment for developing, running and managing parallel, distributed and mobile Java appli...
Willem van Heiningen, Tim Brecht, Steve MacDonald
WWW
2011
ACM
14 years 8 months ago
Choreography conformance via synchronizability
Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distrib...
Samik Basu, Tevfik Bultan
PODC
2011
ACM
14 years 4 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...