arrow
Return

A load balance oriented cost efficient scheduling method for parallel tasks

delete2017-03-01
delete22
PRE
AI
Y
Yu Xin *
Z
Zhiqiang Xie
杨
杨静 (Jing Yang)
DOI:10.1016/j.jnca.2016.12.032delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
With the development of Internet technology, distributed task processing has become the key to solve the problems in big data computing, cloud computing, and collaborative computing. At the aspect of distributed task scheduling optimization, it is needed to establish the scheduling architecture with multiple schedulers, to meet the requirement of minimizing the cost of large scale parallel tasks. However the schedulers would give rise to the issue of high device load, intensive resource competition, and the inefficient collaboration. For this, we proposed the CESM (Cost Efficient Scheduling Method) method, which utilizes the weighted random schedule policy to assign the devices to the tasks, to reduce the competition of the task on the efficient low-cost devices. The weights in the random schedule process dependent on the scheduling environment, such as communication time, the busy state, the execution time and the cost. The efficient low-cost device tends to get a higher weight, implying it has a higher possibility to be assigned. That makes the scheduling results have a better rationality on execution time and cost. For this reason, we designed the weight model based on the communication time, the busy state, the execution time and the cost, and adopted the experimental method to analyze the values of the parameters. Finally, we gave four experiments on the arrival time test, device dependence test, task structure test, device set test, respectively, to verify the effectiveness and rationality of the proposed CESM.
Keywords:
Load balance
Scheduling method
Multiple schedulers
Execution cost
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Network and Computer Applications cover
Journal of Network and Computer Applications
IF:
8
Papers:
3.6K
Citations:
1.1W

Organization

H
Harbin Engineering University
Scholars:
1.9W
Papers: 1.3W
Citations: 1.3W
Cited Papers

Cited Papers

Clear, crashing, turbid and back – long‐term changes in macrophyte assemblages in a shallow lake
err2013-06-20
err0
errOAAI
errSabine Hilt; Jan Köhler; Rita Adrian; Michael T. Monaghan; Carl D. Sayer
errShare
errSave
errShare
errSave
Multi-cost job routing and scheduling in Grid networks
err2009-09-01
err22
PREAI
errStevens, T.; De Leenheer, M.; Develder, C.; Dhoedt, B.; Christodoulopoulos, K.; Kokkinos, P.; Varvarigos, E.
errShare
errSave
errShare
errSave
Shwachman's syndrome and leukaemia
err1979-12-01
err0
PREAI
errJ. Caselitz; G. Kl�ppel; G. Delling; R. Gr�ttner; U. Holdhoff; M. Stern
errShare
errSave
Galidesivir, a Direct-Acting Antiviral Drug, Abrogates Viremia in Rhesus Macaques Challenged with Zika Virus
err2017-10-04
err0
errOAAI
errSo-Yon Lim; Christa Osuna; Jessica Lakritz; Elsa Chen; Gyeol Yoon; Ray Taylor; Steve MacLennan; Michael Leonard; Enzo Giuliano; Amanda Mathis; Elliot Berger; Ys Babu; William Sheridan; James Whitney
errShare
errSave
researcher View more