Sciweavers

85 search results - page 7 / 17
» Distribution sort with randomized cycling
Sort
View
INFOCOM
2003
IEEE
15 years 2 months ago
Distributed Construction of Random Expander Networks
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
Ching Law, Kai-Yeung Siu
FGCS
2006
87views more  FGCS 2006»
14 years 9 months ago
Task distribution with a random overlay network
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
IPPS
1997
IEEE
15 years 1 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
CCGRID
2003
IEEE
15 years 2 months ago
Creating Services with Hard Guarantees from Cycle-Harvesting Systems
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
Chris Kenyon, Giorgos Cheliotis
88
Voted
RECOMB
2008
Springer
15 years 9 months ago
Hurdles Hardly Have to Be Heeded
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...