Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/7581
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhatti, Muhammad Khurram-
dc.contributor.authorÖz, Işıl-
dc.contributor.authorAmin, Sarah-
dc.contributor.authorMushtaq, Maria-
dc.contributor.authorFarooq, Umer-
dc.contributor.authorPopov, Konstantin-
dc.contributor.authorBrorsson, Mats-
dc.date.accessioned2020-01-15T07:04:53Z
dc.date.available2020-01-15T07:04:53Z
dc.date.issued2018-06en_US
dc.identifier.citationBhatti, M. K., Öz, I., Amin, S., Mushtaq, M., Farooq, U., Popov, K., and Brorsson, M. (2018). Locality-aware task scheduling for homogeneous parallel computing systems. Computing, 100(6), 557-595. doi:10.1007/s00607-017-0581-6en_US
dc.identifier.issn0010-485X
dc.identifier.issn0010-485X-
dc.identifier.urihttps://doi.org/10.1007/s00607-017-0581-6
dc.identifier.urihttps://hdl.handle.net/11147/7581
dc.description.abstractIn systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost.en_US
dc.language.isoenen_US
dc.publisherSpringer Verlagen_US
dc.relation.ispartofComputingen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectDirected acyclic graphen_US
dc.subjectEmbedded systemsen_US
dc.subjectHomogeneous systemsen_US
dc.subjectMulticore schedulingen_US
dc.subjectParallel computingen_US
dc.titleLocality-aware task scheduling for homogeneous parallel computing systemsen_US
dc.typeArticleen_US
dc.authorid0000-0002-8310-1143en_US
dc.institutionauthorÖz, Işıl-
dc.departmentIzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.volume100en_US
dc.identifier.issue6en_US
dc.identifier.startpage557en_US
dc.identifier.endpage595en_US
dc.identifier.wosWOS:000432601500001
dc.identifier.scopusSCOPUS:2-s2.0-85032798462
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1007/s00607-017-0581-6-
dc.relation.doi10.1007/s00607-017-0581-6en_US
dc.coverage.doi10.1007/s00607-017-0581-6en_US
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.languageiso639-1en-
item.cerifentitytypePublications-
crisitem.author.deptDepartment of Computer Engineering-
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Files in This Item:
File Description SizeFormat 
7581.pdfMakale (Article)9.15 MBAdobe PDFThumbnail
View/Open
Show simple item record

CORE Recommender

SCOPUSTM   
Citations

5
checked on Nov 27, 2021

WEB OF SCIENCETM
Citations

5
checked on Nov 27, 2021

Page view(s)

44
checked on Nov 27, 2021

Download(s)

34
checked on Nov 27, 2021

Google ScholarTM

Check

Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.