A ON Dynamic Load Distribution Algorithm Using Anti-Tasks and Load State Vectors

Lu, Qin; Leung, K. C.; Lau, Sau-Ming

doi:10.1023/b:clus.0000003943.34384.93

Cited by 2 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [18], Lu et al proposed a load-balancing algorithm based on load-state vectors, which uses 'anti-tasks' messages to pair up task senders and receivers. The load-state vector is very similar to our information vector and holds timed load information about every node in the system.…”

Section: Related Previous Workmentioning

confidence: 99%

“…Our proposed information vector is similar to the load-state vector held by each node in [18] and the trajectory component of an anti-task resembles the content of our information window. One difference is that our window is bounded in size (<n) whereas the trajectory component is of size n. Another difference is that in [18], pre-computed travel sets are used, which might not function well in the presence of node failures; the randomized, on-the-fly nature of our gossip protocol overcomes this problem.…”

Section: Related Previous Workmentioning

confidence: 99%

“…One difference is that our window is bounded in size (<n) whereas the trajectory component is of size n. Another difference is that in [18], pre-computed travel sets are used, which might not function well in the presence of node failures; the randomized, on-the-fly nature of our gossip protocol overcomes this problem.…”

Section: Related Previous Workmentioning

confidence: 99%

See 2 more Smart Citations

Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties

Amar

Barak

Drezner

et al. 2009

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYScalable computer systems, including clusters and multi-cluster grids, require routine exchange of information about the state of system-wide resources among their nodes. Gossip-based algorithms are popular for providing such information services due to their simplicity, fault tolerance and low communication overhead. This paper presents a randomized gossip algorithm for maintaining a distributed bulletin board among the nodes of a scalable computer system. In this algorithm each node routinely disseminates its most recently acquired information while maintaining a snapshot of the other nodes' states. The paper provides analytical approximations for the expected average age, the age distribution and the expected maximal age for the acquired information at each node. We confirm our results by measurements of the performance of the algorithm on a multi-cluster campus grid with 256 nodes and by simulations of configurations with up to 2048 nodes. The paper then presents practical enhancements of the algorithm, which makes it more suitable for a real system. Such enhancements include using fixed-size messages, reducing the number of messages sent to inactive nodes and supporting urgent information. The enhanced algorithm guarantees the age properties of the information at each node in the configurations with an arbitrary number of inactive nodes. It is being used in our campus grid for resource discovery, for dynamic assignment of processes to the best available nodes, for load-balancing and for on-line monitoring.

show abstract

Section: Related Previous Workmentioning

confidence: 99%

Section: Related Previous Workmentioning

confidence: 99%