Sciweavers

10 search results - page 2 / 2
» Near-perfect load balancing by randomized rounding
Sort
View
GCC
2003
Springer
13 years 10 months ago
A Load Balancing Algorithm for Web Based Server Grids
Load balance is a critical issue in distributed systems, such as server grids. In this paper, we propose a Balanced Load Queue (BLQ) model, which combines the queuing theory and hy...
Shui Yu, John Casey, Wanlei Zhou
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 7 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 6 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
INFOCOM
2006
IEEE
13 years 11 months ago
RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
Jin Liang, Klara Nahrstedt
JEA
1998
133views more  JEA 1998»
13 years 4 months ago
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...
David R. Helman, Joseph JáJá, David ...