Sciweavers

1941 search results - page 345 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
NOSSDAV
2005
Springer
15 years 3 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
MIDDLEWARE
2004
Springer
15 years 3 months ago
Application partitioning and hierarchical management in grid environments
Several works on grid computing have been proposed in the last years. However, most of them, including available software, can not deal properly with some issues related to contro...
Patrícia Kayser Vargas, Inês de Castr...
DSN
2003
IEEE
15 years 3 months ago
Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to ana...
Péter Urbán, Ilya Shnayderman, Andr&...
DSN
2002
IEEE
15 years 2 months ago
Generic Timing Fault Tolerance using a Timely Computing Base
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...
Antonio Casimiro, Paulo Veríssimo
CLUSTER
2000
IEEE
15 years 2 months ago
Contention-free Complete Exchange Algorithm on Clusters
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
Anthony T. C. Tam, Cho-Li Wang