Sciweavers

4 search results - page 1 / 1
» Load balancing and orientability thresholds for random hyper...
Sort
View
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 8 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
CORR
2012
Springer
173views Education» more  CORR 2012»
12 years 3 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge
RSA
1998
93views more  RSA 1998»
13 years 7 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
GLOBECOM
2007
IEEE
14 years 2 months ago
Improving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks
— Static replicas have been proven useful in providing fault tolerance and load balancing, but they may not provide enough assurance on the continuous availability of missioncrit...
Chin-Tser Huang, Prasanth Kalakota, Alexander B. A...