A trail-based approach for job scheduling in distributed systems with workflows

© 2014 IEEE. At the present, the amount of data need to be gathered, collected and processed in computing systems are increased significantly, their infrastructures may have to be improved or even redesigned. Distributed computing platforms is the one the most important approaches which can absorb l...

Full description

Saved in:
Bibliographic Details
Main Authors: Nasi Tantitharanukul, Juggapong Natwichai, Pruet Boonma
Format: Conference Proceeding
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84930459392&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/53395
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-53395
record_format dspace
spelling th-cmuir.6653943832-533952018-09-04T09:49:21Z A trail-based approach for job scheduling in distributed systems with workflows Nasi Tantitharanukul Juggapong Natwichai Pruet Boonma Computer Science Decision Sciences © 2014 IEEE. At the present, the amount of data need to be gathered, collected and processed in computing systems are increased significantly, their infrastructures may have to be improved or even redesigned. Distributed computing platforms is the one the most important approaches which can absorb large amount of data and also handle a higher computing workload efficiently. Job scheduling in such distributed systems is not a trivial issue. It can be even more complex when dealing with workflow-based composite jobs, i.e., each job has multiple tasks with dependencies between them. As the job scheduling problem has been proven an NP-hard, in this paper we propose a trail-based algorithm, Large Trail First (LTF), an effective heuristic approach for scheduling problem in the distributed systems when the workflows exist. The 'trail' of each task is the number of remaining tasks in each workflow. The idea of the algorithm is that, for each workflow job, the task with larger size of the trail will be executed earliest. The experimental results are presented to show that the proposed approach is more effective and efficient than the other well-known approaches. 2018-09-04T09:48:39Z 2018-09-04T09:48:39Z 2014-01-01 Conference Proceeding 2-s2.0-84930459392 10.1109/ICDIM.2014.6991414 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84930459392&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53395
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Computer Science
Decision Sciences
spellingShingle Computer Science
Decision Sciences
Nasi Tantitharanukul
Juggapong Natwichai
Pruet Boonma
A trail-based approach for job scheduling in distributed systems with workflows
description © 2014 IEEE. At the present, the amount of data need to be gathered, collected and processed in computing systems are increased significantly, their infrastructures may have to be improved or even redesigned. Distributed computing platforms is the one the most important approaches which can absorb large amount of data and also handle a higher computing workload efficiently. Job scheduling in such distributed systems is not a trivial issue. It can be even more complex when dealing with workflow-based composite jobs, i.e., each job has multiple tasks with dependencies between them. As the job scheduling problem has been proven an NP-hard, in this paper we propose a trail-based algorithm, Large Trail First (LTF), an effective heuristic approach for scheduling problem in the distributed systems when the workflows exist. The 'trail' of each task is the number of remaining tasks in each workflow. The idea of the algorithm is that, for each workflow job, the task with larger size of the trail will be executed earliest. The experimental results are presented to show that the proposed approach is more effective and efficient than the other well-known approaches.
format Conference Proceeding
author Nasi Tantitharanukul
Juggapong Natwichai
Pruet Boonma
author_facet Nasi Tantitharanukul
Juggapong Natwichai
Pruet Boonma
author_sort Nasi Tantitharanukul
title A trail-based approach for job scheduling in distributed systems with workflows
title_short A trail-based approach for job scheduling in distributed systems with workflows
title_full A trail-based approach for job scheduling in distributed systems with workflows
title_fullStr A trail-based approach for job scheduling in distributed systems with workflows
title_full_unstemmed A trail-based approach for job scheduling in distributed systems with workflows
title_sort trail-based approach for job scheduling in distributed systems with workflows
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84930459392&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/53395
_version_ 1681424127212126208