Publication:
A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention

Simple item page
dc.contributor.authorALKAYA, ALİ FUAT
dc.contributor.authorsAlkaya, Ali Fuat; Topcuoglu, Haluk Rahmi
dc.date.accessioned2022-03-12T17:17:59Z
dc.date.available2022-03-12T17:17:59Z
dc.date.issued2006
dc.description.abstractIn this paper, we present a new task scheduling algorithm, called Contention-Aware Scheduling (CAS) algorithm, with the objective of delivering good quality of schedules in low running-time by considering contention on links of arbitrarily-connected, heterogeneous processors. The CAS algorithm schedules tasks on processors and messages on links by considering the earliest finish time attribute with the virtual cut-through (VCT) or the store- and-forward (SAF) switching. There are three types of CAS algorithm presented in this paper, which differ in ordering the messages from immediate predecessor tasks. As part of the experimental study, the performance of the CAS algorithm is compared with two well-known APN (arbitrary processor network) scheduling algorithms. Experiments on the results of the synthetic benchmarks and the task graphs of the well-known problems clearly show that our CAS algorithm outperforms the related work with respect to performance (given in normalized schedule length) and cost (given in running time) to generate output schedules.
dc.identifier.doi10.1007/s10586-006-0010-7
dc.identifier.eissn1573-7543
dc.identifier.issn1386-7857
dc.identifier.urihttps://hdl.handle.net/11424/227918
dc.identifier.wosWOS:000242007500004
dc.language.isoeng
dc.publisherSPRINGER
dc.relation.ispartofCLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectDAG scheduling
dc.subjecttask graphs
dc.subjectlink contention
dc.subjectheterogeneous systems
dc.subjectGENETIC ALGORITHM
dc.subjectSYSTEMS
dc.subjectPERFORMANCE
dc.titleA task scheduling algorithm for arbitrarily-connected processors with awareness of link contention
dc.typearticle
dspace.entity.typePublication
local.avesis.ida2a164c9-212f-43b1-847f-8ffc4ac9c1ce
local.import.packageSS17
local.indexed.atWOS
local.indexed.atSCOPUS
local.journal.numberofpages15
oaire.citation.endPage431
oaire.citation.issue4
oaire.citation.startPage417
oaire.citation.titleCLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
oaire.citation.volume9
relation.isAuthorOfPublicationd9bd229f-ead0-45d5-9500-628eaf2b6516
relation.isAuthorOfPublication.latestForDiscoveryd9bd229f-ead0-45d5-9500-628eaf2b6516

Files

Collections

Research Outputs