Sciweavers

176 search results - page 27 / 36
» Task distribution with a random overlay network
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Heterogenous dating service with application to rumor spreading
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
Olivier Beaumont, Philippe Duchon, Miroslaw Korzen...
CN
2008
100views more  CN 2008»
13 years 7 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
ICPP
2005
IEEE
14 years 1 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
IPPS
1997
IEEE
13 years 11 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
CSCW
2012
ACM
12 years 3 months ago
Towards self-optimizing collaborative systems
Two important performance metrics in collaborative systems are local and remote response times. Previous analytical and simulation work has shown that these response times depend ...
Sasa Junuzovic, Prasun Dewan