Agent-based Dynamic Adaptive Cluster Load Balancing Model

You, Tianshu; Li, Wenhui; Fang, Zhiyi; Zhang, Chunfei; Qu, Guannan

doi:10.11591/telkomnika.v12i3.4568

Search citation statements

Order By: Relevance

Paper Sections

Select...

．．．． Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A good task scheduling not only takes time into consideration, but also loads balancing of the whole system. Compared with Min-Min, Max-Min [3] ,load balancing [4,5] has been taken as an index in evaluating algorithm performance. Through the change of the number of the tasks and resources, with a better load balance, smaller time span, a new algorithm T-Max-Int has been proposed in this paper and effective utilization of resources and the comprehensive performance is superior to other two algorithms.…”

Section: ．．．． Introductionmentioning

confidence: 99%

Research of Load Balancing Scheduling under Grid Computing

Cai

Lou

2014

AMM

View full text Add to dashboard Cite

In order to make up for the shortage of Min-Min in load balancing, a new task scheduling algorithm T-Max-Int Under the grid computing has been proposed in this paper. In T-Max-Int, the Loss Degree of Max-Int has been brought into Min-Min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-Max-Int, Max-Min, Min-Min were compared, which proved that T-Max-Min is better than the other two algorithms in aspects of Makespan and load balancing.

show abstract

Section: ．．．． Introductionmentioning

confidence: 99%