Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage285en_US
dc.citation.issueNumber3en_US
dc.citation.spage271en_US
dc.citation.volumeNumber67en_US
dc.contributor.authorKaya, K.en_US
dc.contributor.authorUçar, B.en_US
dc.contributor.authorAykanat, Cevdeten_US
dc.date.accessioned2016-02-08T10:15:15Z
dc.date.available2016-02-08T10:15:15Z
dc.date.issued2007en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent tasks. The files initially reside on the repositories. The processors and the repositories are connected through a heterogeneous interconnection network. Our aim is to assign the tasks to the processors, to schedule the file transfers from the repositories, and to schedule the executions of tasks on each processor in such a way that the turnaround time is minimized. We propose a heuristic composed of three phases: initial task assignment, task assignment refinement, and execution ordering. We experimentally compare the proposed heuristics with three well-known heuristics on a large number of problem instances. The proposed heuristic runs considerably faster than the existing heuristics and obtains 10-14% better turnaround times than the best of the three existing heuristics. © 2006 Elsevier Inc. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:15:15Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2007en
dc.identifier.doi10.1016/j.jpdc.2006.11.004en_US
dc.identifier.issn0743-7315
dc.identifier.urihttp://hdl.handle.net/11693/23529
dc.language.isoEnglishen_US
dc.publisherAcademic Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.jpdc.2006.11.004en_US
dc.source.titleJournal of Parallel and Distributed Computingen_US
dc.subjectGrid computingen_US
dc.subjectHeterogeneous computing systemsen_US
dc.subjectSchedulingen_US
dc.subjectComputation theoryen_US
dc.subjectData storage equipmenten_US
dc.subjectDistributed computer systemsen_US
dc.subjectProblem solvingen_US
dc.subjectProgram processorsen_US
dc.subjectSchedulingen_US
dc.subjectExecution orderingen_US
dc.subjectHeuristic methodsen_US
dc.titleHeuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositoriesen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories.pdf
Size:
634.23 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering