Filters








1,476 Hits in 8.8 sec

A Load Balancing Algorithm Using the Circulation of A Single Message Token [chapter]

Jun Hwang, Woong J. Lee, Byong G. Lee, Young S. Kim
2002 Lecture Notes in Computer Science  
Using the proposed algorithm, information gathering for decision-making is possible with less number of messages than the one using existing load balancing algorithm.  ...  We present an efficient load balancing algorithm which simplifies the system status information through the use of an information message (VISITOR) in distributed system.  ...  In this paper, proposed is an algorithm that performs the global information retrieval and load balancing through a single information message by simplifying the way of acquiring the global information  ... 
doi:10.1007/3-540-47789-6_114 fatcat:z4aqqqbmajbzjjntytbg2igm24

Cluster-Based Load Balancing Algorithms for Grids [article]

Resat Umit Payli, Kayhan Erciyes, Orhan Dagdeviren
2011 arXiv   pre-print
We analyze the correctness, performance and scalability of the proposed protocol and show from the simulation results that our algorithm balances the load by decreasing the number of high loaded nodes  ...  The load distribution in a grid may vary leading to the bottlenecks and overloaded sites. We describe a hierarchical dynamic load balancing protocol for Grids.  ...  This research was supported in part by the Indiana METACyt Initiative. The Indiana METACyt Initiative of Indiana University is supported in part by Lilly Endowment, Inc.  ... 
arXiv:1110.1991v1 fatcat:qdiy7qc7dbervdchctdui4qcn4

Dynamic Load Balancing of Unbalanced Computations Using Message Passing

James Dinan, Stephen Olivier, Gerald Sabin, Jan Prins, P. Sadayappan, Chau-Wen Tseng
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
Experiments indicate that in addition to a parameter defining the granularity of load balancing, message-passing paradigms require additional parameters such as polling intervals to manage runtime overhead  ...  This paper examines MPI's ability to support continuous, dynamic load balancing for unbalanced parallel applications.  ...  In this algorithm, a colored token is circulated around the processors in a ring in order to reach a consensus. In our implementation the token can be any of three colors: white, black, or red.  ... 
doi:10.1109/ipdps.2007.370581 dblp:conf/ipps/DinanOSPST07 fatcat:yzzogag6yfefrlc2opxn3qsseq

Authority Ring Periodically Load Collection for Load Balancing of Cluster System

Sharada Santosh Patil
2013 American Journal of Networks and Communications  
The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its compute nodes.  ...  Though the load balancing algorithm distributing load among the compute nodes of the clusters, it needs parallel programming, hence MPI library plays very important role to build new load balancing algorithm  ...  Acknowledgment We sincerely express our thanks to laboratory research cell of SIBAR-MCA and SKNCOE for their full support.  ... 
doi:10.11648/j.ajnc.20130205.13 fatcat:rwfg6ioafnezxotqmevf6f3dyq

Load Balancing Parallel Explicit State Model Checking

Rahul Kumar, Eric G. Mercer
2005 Electronical Notes in Theoretical Computer Science  
a pair of processors on IBM 1350 Cluster.number of messages sent in the load balanced version is fewer than the messages exchanged in the traditional algorithm.  ...  that takes place when using the load balancing algorithm.  ...  Appendix A State Cache Another technique to improve performance of distributed model checkers is the use of state caching to reduce the number of messages and hash lookups.  ... 
doi:10.1016/j.entcs.2004.10.016 fatcat:g4ggowcjazhsvoeldb3ijfojse

A Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

Kayhan Erciyes
2012 International Journal of Computer Networks & Communications  
The modified version of the Ricart-Agrawala Algorithm on top of this topology provides analytically and experimentally an order of decrease in message complexity with respect to the original algorithm.  ...  We propose a distributed mutual exclusion algorithm for mobile ad hoc networks. This algorithm requires a ring of cluster coordinators as the underlying topology.  ...  When BFA is used on top of a balanced clustering algorithm like MCA, a robust infrastructure is constructed for upper layers by supporting load balancing and reducing routing delay.  ... 
doi:10.5121/ijcnc.2012.4209 fatcat:3x3xtynggrcttd7vkfzxlmfrly

Maintaining a dynamic set of processors in a distributed system [chapter]

Satoshi Fujita, Masafumi Yamashita
1996 Lecture Notes in Computer Science  
C_{\mathit{0}\gamma\}}\epsilon ider$ a distributed system consisting of a set $V$ of processors, $\mathit{0}71daSS$ urne $t\tau_{1_{\beta}a}t$ evpry pair of processors can directly comm unicate with each  ...  A simple scheme $i_{\mathrm{t}}\mathrm{s}$ proposed,  ...  We create a single token to show the "anchor" node, and let it circulate along the circular list. Local register (flag) $t_{\tau}$ , is used to memorize if $v$ has the token.  ... 
doi:10.1007/3-540-61769-8_15 fatcat:t74ffbedcbaohc4aewstr6xmiy

The Optimal Resource Discovery and Allocation Algorithm for One hop Using Anonymous Arbitrary Topology

Srinivasan Nagaraj, K.Koteswara Rao, G Appa Rao, Dr GSVP. Raju, TV Madhasudanarao
2010 International Journal of Computer Applications  
Sequence number of the request is the unique ID of sender node. We proposed a heuristic to distribute resources over anonymous arbitrary topology by passing a token .  ...  Load is not infinitely divisible. We are focusing our attention only to determine how much of the request of each resource -deficient node will be satisfied.  ...  Algorithms for load balancing have to heavily rely on the assumption that the information available at each node is quite accurate, in order to prevent processes from being endlessly circulated about the  ... 
doi:10.5120/496-809 fatcat:x2l2idimdffahn74aurnicnwda

Interactive volume rendering on a multicomputer

Ulrich Neumann
1992 Proceedings of the 1992 symposium on Interactive 3D graphics - SI3D '92  
This algorithm addresses the issues of distributed rendering, data set distribution, load balancing, and contention for the routing network.  ...  This paper describes a volume rendering algorithm for MIMD message passing multicomputers.  ...  Since the system resynchronizes every slice due to the token passing, each slice has it's own load balance.  ... 
doi:10.1145/147156.147170 dblp:conf/si3d/Neumann92 fatcat:jrtpih2lofh7lnggkjivnssccy

Token Account Algorithms: The Best of the Proactive and Reactive Worlds

Gabor Danner, Mark Jelasity
2018 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)  
of messages circulating in the system becomes too low.  ...  Here, we propose a novel family of adaptive protocols that apply rate limiting inspired by the token bucket algorithm to prevent bursts, but they also include proactive communication to prevent starvation  ...  Acknowledgments This research was supported by the Hungarian Government and the European Regional Development Fund under the grant number GINOP-2.3.2-15-2016-00037 ("Internet of Living Things").  ... 
doi:10.1109/icdcs.2018.00090 dblp:conf/icdcs/DannerJ18 fatcat:7hcshnzm6jgang2tq3spqbswq4

Parallel and Distributed Simulation: Methodologies and Techniques

Hussam M. Soliman
1998 Journal of King Saud University: Computer and Information Sciences  
A review of the recently developed hybrid and adaptive PADS techniques is also given. Sample perfonnance results of some PADS techniques are presented using a network of workstations.  ...  An introduction to the field of Parallel and Distributed Simulation (PADS) is given. The capabilities and limitations of currently used PADS techniques are discussed.  ...  Token-based GVT algorithms Token-passing GVT algorithms have also been used . A tolcen-based algorithm was proposed by Preiss [431 which imposes a ring topology for passing the token.  ... 
doi:10.1016/s1319-1578(98)80003-7 fatcat:dmhp2qkg5vhqhjwbs6ycjvtycq

Locality-Preserving Clustering and Discovery of Resources in Wide-Area Distributed Computational Grids

Haiying Shen, Kai Hwang
2012 IEEE transactions on computers  
We further develop dynamism-resilient resource management algorithm, cluster-token forwarding algorithm and deadline-driven resource management algorithms.  ...  The advantage of the proposed scheme lies in low overhead, fast and dynamism-resilient multi-resource discovery.  ...  Since this is not the focus of this paper, we do not present the details of the load balancing algorithm.  ... 
doi:10.1109/tc.2011.62 fatcat:zvpr5bkttne5pliuwkzvl26fs4

On Self-coordination in Wireless Community Networks [chapter]

Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
2006 Lecture Notes in Computer Science  
In this paper we propose a distributed algorithm and protocol for self-coordination of access points from different domains based solely on knowledge about the immediate neighborhood.  ...  Co-channel interference and contention at shared medium access may significantly degrade the performance of a CSMA/CA-based wireless LAN.  ...  The two token-based approaches differ in that the first approach starts with a single token that circulates the network, while in the second all APs initially hold a token.  ... 
doi:10.1007/11872153_22 fatcat:uewehh2lqzbiflofdcy5vldgde

Comparing Distributed Termination Detection Algorithms for Modern HPC Platforms

George Bosilca, Aurélien Bouteiller, Thomas Herault, Valentin Le Fèvre, Yves Robert, Jack Dongarra
2022 International Journal of Networking and Computing  
We analyze the behavior of each algorithm for some simplified task-based kernels and show the superiority of CDA in terms of the number of control messages.  ...  We then compare the implementation of these algorithms over a task-based runtime system, PaRSEC and show the advantages and limitations of each approach in a real implementation.  ...  Acknowledgements This research used resources of the Argonne Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC02-06CH11357.  ... 
doi:10.15803/ijnc.12.1_26 fatcat:qwzgbf2vbjaariomw35tps37bi

QoS customization in distributed object systems

Jun He, Matti A. Hiltunen, Mohan Rajagopalan, Richard D. Schlichting
2003 Software, Practice & Experience  
Experimental results are given for a test application executing on a Linux cluster using Cactus/J, the Java implementation of Cactus.  ...  The CQoS architecture and the interfaces between the different components are described, together with implementations of QoS attributes using Cactus and interceptors for CORBA and Java RMI.  ...  Townsend implemented the Cactus/J system used as the basis for this work. Also, R. Gruber and A. Puder  ... 
doi:10.1002/spe.509 fatcat:ybh3wy3u4vhxraiy4bbzqduscy
« Previous Showing results 1 — 15 out of 1,476 results