Sciweavers

116 search results - page 21 / 24
» A practical access to the theory of parallel algorithms
Sort
View
PODC
2005
ACM
14 years 29 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
PODC
2004
ACM
14 years 24 days ago
Gradient clock synchronization
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
Rui Fan, Nancy A. Lynch
PPOPP
2009
ACM
14 years 8 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
14 years 8 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn