Filters








140,890 Hits in 6.0 sec

On the Analysis of Randomized Load Balancing Schemes

M. Mitzenmacher
1999 Theory of Computing Systems  
Our work extends a previous analysis of the supermarket model, a model that abstracts a simple, efficient load balancing scheme in the setting where jobs arrive at a large system of parallel processors  ...  It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems.  ...  Both Eager et al. and Zhou suggest that simple randomized load balancing schemes, based on choosing from a small subset of processors, perform extremely well.  ... 
doi:10.1007/s002240000122 fatcat:jlia6dojmzcyvjfw3pf6sljnru

On the analysis of randomized load balancing schemes

Michael Mitzenmacher
1997 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97  
It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems.  ...  In this paper we provide new analyses for several such dynamic randomized load balancing schemes.  ... 
doi:10.1145/258492.258521 dblp:conf/spaa/Mitzenmacher97 fatcat:rkbdqdgsunhuhiu2mhlymnghky

Dynamic and Decentralized Storage Load Balancing with Analogy to Thermal Diffusion for P2P File Sharing

Masato UCHIDA, Kei OHNISHI, Kento ICHIKAWA, Masato TSURU, Yuji OIE
2010 IEICE transactions on communications  
First, we show through theoretical analysis that the statistical behavior of the storage load balancing controlled by the proposed scheme has an analogy with the thermal diffusion phenomenon.  ...  We then show through simulation that the proposed scheme not only has superior performance with respect to balancing the storage load among peers (the primary objective of the present proposal) but also  ...  Acknowledgments This work was partly supported by the National Institute of Information and Communications Technology, and the Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research  ... 
doi:10.1587/transcom.e93.b.525 fatcat:ykzs54x6kzcuzole45kgvyy5ym

Design and analysis of a replicated server architecture for supporting IP-Host mobility

Jason P. Jue, Dipak Ghosal
1998 ACM SIGMOBILE Mobile Computing and Communications Review  
In order to minimize the delay across the home agents, one of the key aspects is the design of load balancing schemes in which a home agent may transfer the control of a mobile host to another home agent  ...  In this paper, we design a protocol that forms the building block for implementing such load balancing schemes, and we then study the performance characteristics of three selection schemes, namely, random  ...  The equal partition scheme is a static load balancing scheme, while the random partition scheme approximates a static random scheme.  ... 
doi:10.1145/1321387.1321388 fatcat:7yskmlni7vfedmykfjiolbbf7u

Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems

David R. Karger, Matthias Ruhl
2006 Theory of Computing Systems  
To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).  ...  This is useful when the distribution of items in the address space cannot be randomized-for example, if we wish to support range-searches on "ordered" keys.  ...  Acknowledgments We would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/s00224-006-1246-6 fatcat:lk4t5wyb6zcdpaon6zhupjvzma

Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems [chapter]

David R. Karger, Matthias Ruhl
2005 Lecture Notes in Computer Science  
To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).  ...  This is useful when the distribution of items in the address space cannot be randomized-for example, if we wish to support range-searches on "ordered" keys.  ...  Acknowledgments We would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-540-30183-7_13 fatcat:iloqcwrabzfxrpn25sxbtg2jte

Simple efficient load balancing algorithms for peer-to-peer systems

David R. Karger, Matthias Ruhl
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
To our knowledge, this yields the first P2P scheme simultaneously achieving O(log n) degree, O(log n) look-up cost, and constant-factor load balance (previous schemes settled for any two of the three).  ...  This is useful when the distribution of items in the address space cannot be randomized-for example, if we wish to support range-searches on "ordered" keys.  ...  Acknowledgments We would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/1007912.1007919 dblp:conf/spaa/KargerR04 fatcat:y76excynpjhgrbz4a7bd4faeke

A Client Proximity Based Load Balance Algorithm in Web Sever Cluster

Pei-rui JIANG, Li-min MENG, Yu-zhou SHANG, Yang-tian-xiu HU
2018 DEStech Transactions on Computer Science and Engineering  
In order to guarantee the QoE of clients, load balance scheme is necessary during the servers of the web server cluster.  ...  We compare the Client Proximity Based Load Balancing algorithm (PBLB) with the Round Robin (RR) scheme and the Modified Random Allocation (MRA) scheme.  ...  Acknowledgement This work was supported by the National Natural Science Foundation of China (61372087).  ... 
doi:10.12783/dtcse/wcne2017/19877 fatcat:roba4z2fyfdpfgfgdnmzzyolza

A simple load balancing scheme for task allocation in parallel machines

Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal
1991 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91  
Moreover, the load balancing scheme adapts to the current load on the system.  ...  One of the weaknesses of the scheme is that the load- balancing tasks are executed with the same frequency whether the system is balanced or not.  ... 
doi:10.1145/113379.113401 dblp:conf/spaa/RudolphSU91 fatcat:l7azfiifjnc67hzdk736c2tsvu

Weighted randomized algorithms for efficient load balancing in distributed computing environments

Maniza Hijab, Avula Damodaram
2020 Materials Today: Proceedings  
The simulation results using standard workload format datasets reveal that the proposed algorithm outperforms existing solutions in average resource utilization by 8% to 12% while improving on load balance  ...  This can effectively improve resource utilization but can create a load imbalance naturally due to the randomness of its input space.  ...  The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.  ... 
doi:10.1016/j.matpr.2020.06.216 fatcat:tpi5p537azf6pbltubc33du3fe

Optimal Load Balancing in Publish/Subscribe Broker Networks Using Active Workload Management

H. Zhang, S. Ganguly, S. Bhatnagar, R. Izmailov, A. Sharma
2008 2008 IEEE International Conference on Communications  
Shuffle leverages its traffic randomization scheme and Chord, a DHT substrate, to build overlay trees for active workload aggregation and distribution, and we show the optimality property of the load balancing  ...  In this paper we present the framework design of a middleware , called Shuffle, to achieve optimal load balancing in a pub/sub broker network.  ...  In Shuffle, the replicating-holding scheme is applied recursively on each active node for load balancing on events. 3) Load Balancing Scheduling Scheme: We propose a simple scheme for scheduling the load  ... 
doi:10.1109/icc.2008.1101 dblp:conf/icc/ZhangGBIS08 fatcat:muu7w5b6vjcalknxygpxwc4wzy

Dynamic Load Balancing in Distributed Hash Tables [chapter]

Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
2005 Lecture Notes in Computer Science  
The topology of the network, the communication load and the amount of data a server stores depend heavily on the length of its interval.  ...  We propose a simple fully distributed scheme which works in a constant number of rounds and achieves optimal balance with high probability.  ...  The smoothness is a parameter which informs about two aspects of load balance: the first one is the storage load of a server; the longer the interval is, the more data has to be stored in the server.  ... 
doi:10.1007/11558989_20 fatcat:fjbrpelqqze7ngurlpqkrgl7m4

Power balanced coverage-time optimization for clustered wireless sensor networks

Tao Shu, Marwan Krunz, Sarma Vrudhula
2005 Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '05  
Numerical examples and simulations are used to validate our analysis and study the performance of the proposed schemes.  ...  We study the maximization of coverage time by balancing the power consumption of different CHs.  ...  Any opinions, findings, conclusions, and recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF.  ... 
doi:10.1145/1062689.1062705 dblp:conf/mobihoc/ShuKV05 fatcat:7fwbhuzqvvhhnk4iqqkzmbjj6m

Randomized Data Allocation in Scalable Streaming Architectures [chapter]

Kun Fu, Roger Zimmermann
2005 Lecture Notes in Computer Science  
We quantify the exact performance trade-off between PLR approach and the traditional block level randomization (BLR) technique through both theoretical analysis and extensive simulation.  ...  Our results show that the PLR technique can achieve much better load balancing in scalable streaming architectures by using more memory space.  ...  First, the mean values of D BLR and D P LR are the same, which confirms that both the BLR and PLR schemes achieve the same level of load balancing in the long run as expected.  ... 
doi:10.1007/11408079_42 fatcat:xwguuntlsbg7hmdvdibsiucpzm

Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks [chapter]

Robert Elsässer, Burkhard Monien, Stefan Schamberger
2004 Lecture Notes in Computer Science  
However, if the load is not divisible arbitrarily but consists of indivisible unit size tokens, diffusion schemes are not able to balance the load properly.  ...  Diffusion based schemes, which belong to the class of nearest neighbor load balancing algorithms, are a popular way to address this problem.  ...  Conclusion The presented randomized algorithm balances unit-size tokens in general heterogeneous and dynamic networks without global knowledge.  ... 
doi:10.1007/978-3-540-30140-0_57 fatcat:f5pjsmku5ndspniwbwk4bjo22u
« Previous Showing results 1 — 15 out of 140,890 results