Sciweavers

2924 search results - page 428 / 585
» Lower Bounds in Distributed Computing
Sort
View
COR
2004
111views more  COR 2004»
15 years 4 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
ICCSA
2005
Springer
15 years 10 months ago
Implementing Immersive Clustering with VR Juggler
Abstract. The last advances in commodity hardware have allowed users of immersive visualization to create high-performance systems using a set of interconnected computers. These sy...
Aron Bierbaum, Patrick Hartling, Pedro Morillo, Ca...
162
Voted
ICDCS
2000
IEEE
15 years 8 months ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
IPPS
2010
IEEE
15 years 2 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb
ICDCS
2008
IEEE
15 years 11 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao