Research of Load Balancing Scheduling under Grid Computing

Cheng Yu Cai; Yuan Sheng Lou

doi:10.4028/www.scientific.net/AMM.577.935

Paper Titles

Layered Region Based Flow-Sensitive Demand-Driven Alias Analysis
p.917

Non-Uniform Probabilistically Quantized Distributed Consensus Applied on Sensors Network
p.921

Online Sponsored Search Budget Allocation across Search Engines: A Simulation Analysis
p.926

QoS Oriented PSO Algorithm for Cloud Service Composition Modeling
p.931

Research of Load Balancing Scheduling under Grid Computing
p.935

Research on Controlling Data Stream of Production Information Platform for Water Production Facilities Based on Bar Bode Management
p.939

Research on Evaluation System of E-Government Website Group Based on Fuzzy Evaluation
p.943

Research on One Secure Solution for Multiple Factor Ambiguous Pattern Recognition System
p.948

Research on the Communication Base Station’s Thermal Environment Controlling
p.952

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 577Research of Load Balancing Scheduling under Grid...

Research of Load Balancing Scheduling under Grid Computing

Abstract:

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.

You might also be interested in these eBooks

Applied Decisions in Area of Mechanical Engineering and Industrial Manufacturing

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 577)

Pages:

935-938

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.577.935

Citation:

Cite this paper

Online since:

July 2014

Authors:

Cheng Yu Cai*, Yuan Sheng Lou

Keywords:

Load Balance, Max-Int Algorithm, Min-Min Algorithm, Task Scheduling, Time Loss

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Lester A, Tang Y, Gyires T. Prioritized Adaptive Max-Min Fair Residual Bandwidth Allocation for Software-Defined Data Center Networks[C]/ICN 2014, The Thirteenth International Conference on Networks. 2014: 198-203.

Google Scholar

[2] Kaur S, Kaur S. Survey of Resource and Grouping Based Job Scheduling Algorithm in Grid Computing[J]. International Journal of Computer Science and Mobile Computing. IJCSMC, 2013, 2(5): 214-218.

Google Scholar

[3] Mao Y, Chen X, Li X. Max–Min Task Scheduling Algorithm for Load Balance in Cloud Computing[C]/Proceedings of International Conference on Computer Science and Information Technology. Springer India, 2014: 457-465.

DOI: 10.1007/978-81-322-1759-6_53

Google Scholar

[4] You T, Li W, Fang Z, et al. Agent-based Dynamic Adaptive Cluster Load Balancing Model[J]. TELKOMNIKA Indonesian Journal of Electrical Engineering, 2014, 12(3).

DOI: 10.11591/telkomnika.v12i3.4568

Google Scholar

[5] Fang Y, Wang F, Ge J. A task scheduling algorithm based on load balancing in cloud computing[M]/Web Information Systems and Mining. Springer Berlin Heidelberg, 2010: 271-277.

DOI: 10.1007/978-3-642-16515-3_34

Google Scholar