Prediction-Based Dynamic Load Balancing Using Agent Migration for Multi-agent System

Son, Byung Ha; Lee, Seong Woo; Youn, Hee Yong

doi:10.1109/hpcc.2010.36

Cited by 3 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Grande [11] has described a method to forecast the trends of server load, but the forecast is coarse-grained. Son [12] has proposed a scheme to predict the resource utilization of each agent. But he has assumed that current resource utilization of each agent is known which is difficult to implement in reality.…”

Section: Related Workmentioning

confidence: 99%

A predictive dynamic load balancing algorithm with service differentiation

Jiang

Deng

Xue

2013

2013 15th IEEE International Conference on Communication Technology

View full text Add to dashboard Cite

The existing dynamic load balancing algorithms usually monitor load on servers and allocate requests to the least loaded server. But load between monitoring intervals is unknown because the monitoring is not real-time. And most of them can not differentiate services. This paper proposes a predictive dynamic load balancing algorithm which takes services types into consideration. The scheduler monitors resource utilization and number of active requests in each server. Considering service's preference for different resources, the average resource overhead of each service can be calculated using multiple reverse differentials. During request allocation, the appropriate server node is chosen to achieve optimal load balancing. Moreover, the resource utilization of each server node between monitoring intervals can be real-time predicted. The results demonstrate that the proposed algorithm can achieve shorter response time, fewer failed requests and more balanced load compared with existing dynamic load balancing algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

A predictive dynamic load balancing algorithm with service differentiation

Jiang

Deng

Xue

2013

2013 15th IEEE International Conference on Communication Technology

View full text Add to dashboard Cite

show abstract

Load balancing in distributed multi-agent computing systems

Metawei

Ghoneim

Haggag

et al. 2012

Ain Shams Engineering Journal

View full text Add to dashboard Cite

Rescheduling and checkpointing as strategies to run synchronous parallel programs on P2P desktop grids

Righi

Veith

Rodrigues

et al. 2015

Proceedings of the 30th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Today, BSP (Bulk-Synchronous Parallel) represents one of the most often used models for writing tightly-coupled parallel programs. As resource substrates, commonly clusters and eventually computational grids are used to run BSP applications. In this context, here we investigate the use of collaborative computing and idle resources to execute this kind of demand, so we are proposing a model named BSPonP2P to answer the following question: How can we develop an e cient and viable model to run BSP applications on P2P Desktop Grids? We answer it by providing both process rescheduling and checkpointing to deal with dynamism at application and infrastructure levels and resource heterogeneity. The results concern a prototype that ran over a subset of the Grid5000, showing encouraging results on using collaboration and volatile resources for HPC.

show abstract

Prediction-Based Dynamic Load Balancing Using Agent Migration for Multi-agent System

Cited by 3 publications

References 6 publications

A predictive dynamic load balancing algorithm with service differentiation

A predictive dynamic load balancing algorithm with service differentiation

Load balancing in distributed multi-agent computing systems

Rescheduling and checkpointing as strategies to run synchronous parallel programs on P2P desktop grids

Contact Info

Product

Resources

About