4642 search results - page 748 / 929 » Distributed algorithm and reversible network |
157
Voted
HPDC
2005
IEEE
15 years 8 months ago
2005
IEEE
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
124
Voted
HPDC
2010
IEEE
15 years 3 months ago
2010
IEEE
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...
122
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
91
Voted
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
134
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...