Iterative-improvement-based heuristics for adaptive scheduling of tasks sharing files on heterogeneous master-slave environments

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage896en_US
dc.citation.issueNumber8en_US
dc.citation.spage883en_US
dc.citation.volumeNumber17en_US
dc.contributor.authorKaya, K.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:18:38Z
dc.date.available2016-02-08T10:18:38Z
dc.date.issued2006en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractThe scheduling of independent but file-sharing tasks on heterogeneous master-slave platforms has recently found important applications in Grid environments. The scheduling heuristics recently proposed for this problem are all constructive in nature and based on a common greedy criterion which depends on the momentary completion time values of the tasks. We show that this greedy decision criterion has shortcomings in exploiting the file-sharing interaction among tasks since completion time values are inadequate to extract the global view of this interaction. We propose a three-phase scheduling approach which involves initial task assignment, refinement, and execution ordering phases. For the refinement phase, we model the target application as a hypergraph and, with an elegant hypergraph-partitioning-like formulation, we propose using iterative-improvement-based heuristics for refining the task assignments according to two novel objective functions. Unlike the turnaround time, which is the actual schedule cost, the smoothness of proposed objective functions enables the use of iterative-improvement-based heuristics successfully since their effectiveness and efficiency depend on the smoothness of the objective function. Experimental results on a wide range of synthetically generated heterogeneous master-slave frameworks show that the proposed three-phase scheduling approach performs much better than the greedy constructive approach. © 2006 IEEE.en_US
dc.identifier.doi10.1109/TPDS.2006.105en_US
dc.identifier.issn1045-9219
dc.identifier.urihttp://hdl.handle.net/11693/23753
dc.language.isoEnglishen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TPDS.2006.105en_US
dc.source.titleIEEE Transactions on Parallel and Distributed Systemsen_US
dc.subjectFile-sharing tasksen_US
dc.subjectGrid computingen_US
dc.subjectHeterogenous master-slave platformen_US
dc.subjectIterative improvementen_US
dc.subjectSchedulingen_US
dc.subjectAdaptive systemsen_US
dc.subjectIterative methodsen_US
dc.subjectGrid computingen_US
dc.subjectIterative improvementen_US
dc.subjectMaster-slave platformen_US
dc.subjectHeuristic programmingen_US
dc.titleIterative-improvement-based heuristics for adaptive scheduling of tasks sharing files on heterogeneous master-slave environmentsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Iterative-improvement-based heuristics for adaptive scheduling of tasks sharing files on heterogeneous master-slave environments.pdf
Size:
4.24 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Computer Engineering