UPM Institutional Repository

Multi-objective method for divisible load scheduling in multi-level tree network


Citation

Ghanbari, Shamsollah and Othman, Mohamed and Abu Bakar, Mohd Rizam and Leong, Wah June (2016) Multi-objective method for divisible load scheduling in multi-level tree network. Future Generation Computer Systems, 54. pp. 132-143. ISSN 0167-739X; ESSN: 1872-7115

Abstract

There is extensive literature concerning the divisible load theory. Based on the divisible load theory (DLT) the load can be divided into some arbitrary independent parts, in which each part can be processed independently by a processor. The divisible load theory has also been examined on the processors that cheat the algorithm, i.e., the processors do not report their true computation rates. According to the literature, if the processors do not report their true computation rates, the divisible load scheduling model fails to achieve its optimal performance. This paper focuses on the divisible load scheduling, where the processors cheat the algorithm. In this paper, a multi-objective method for divisible load scheduling is proposed. The goal is to improve the performance of the divisible load scheduling when the processors cheat the algorithm. The proposed method has been examined on several function approximation problems. The experimental results indicate the proposed method has approximately 66% decrease in finish time in the best case.


Download File

[img]
Preview
PDF
Multi-objective method for divisible load scheduling in multi-level tree network.pdf

Download (5kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Institute for Mathematical Research
DOI Number: https://doi.org/10.1016/j.future.2015.03.015
Publisher: Elsevier BV
Keywords: Divisible load theory; Multi-objective method; Multi-level tree network; Divisible load scheduling
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 19 Oct 2017 10:11
Last Modified: 19 Oct 2017 10:11
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.future.2015.03.015
URI: http://psasir.upm.edu.my/id/eprint/53349
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item