Publication:
Scheduling opportunities for asymmetrically reliable caches

Simple item page
dc.contributor.authorTOPCUOĞLU, HALUK RAHMİ
dc.contributor.authorsArslan, Sanem; Topcuoglu, Haluk Rahmi; Kandemir, Mahmut Taylan; Tosun, Oguz
dc.date.accessioned2022-03-12T22:38:54Z
dc.date.available2022-03-12T22:38:54Z
dc.date.issued2019
dc.description.abstractModern systems become more vulnerable to soft errors with technology scaling. Providing fault tolerance strategies on all structures in a system may lead to high energy consumption. Our framework with asymmetrically reliable caches with at least one protected core and several unprotected cores dynamically assigns the software threads executing critical code fragments to the protected core(s) with the FCFS-based algorithm. The framework can provide good reliability, performance, and power consumption trade-offs compared with the fully protected and unprotected systems. However, FCFS-based scheduling algorithm may degrade the system performance and unfairly slow down applications for some workloads. In this paper, a set of scheduling algorithms is proposed to improve both the system performance and fairness perspectives. Various static priority techniques that require preliminary information about the applications (such as their execution order, cache usage, number of requests sent to the protected core(s), and total burst time spent on the protected core(s)) are implemented and evaluated. On the other hand, dynamic priority techniques that target to equalize the total time spent of applications on the protected core(s) or the progress of the applications' requests are presented. Extensive evaluations using multi application workloads validate significant improvements of our static and dynamic priority scheduling techniques on system performance and fairness over the FCFS algorithm. (C) 2019 Elsevier Inc. All rights reserved.
dc.identifier.doi10.1016/j.jpdc.2019.01.005
dc.identifier.eissn1096-0848
dc.identifier.issn0743-7315
dc.identifier.urihttps://hdl.handle.net/11424/235746
dc.identifier.wosWOS:000459952300009
dc.language.isoeng
dc.publisherACADEMIC PRESS INC ELSEVIER SCIENCE
dc.relation.ispartofJOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectAsymmetric cores
dc.subjectScheduling algorithms
dc.subjectSelective protection
dc.subjectReliability
dc.subjectPerformance evaluation
dc.subjectFairness
dc.subjectBALANCING PERFORMANCE
dc.subjectRELIABILITY
dc.subjectALGORITHM
dc.subjectSYSTEMS
dc.subjectMEMORY
dc.subjectFAIRNESS
dc.subjectSCHEME
dc.subjectTASKS
dc.titleScheduling opportunities for asymmetrically reliable caches
dc.typearticle
dspace.entity.typePublication
local.avesis.id18695641-f364-4ae1-ba89-7b0ee0e3a45b
local.import.packageSS17
local.indexed.atWOS
local.indexed.atSCOPUS
local.journal.numberofpages18
local.journal.quartileQ2
oaire.citation.endPage151
oaire.citation.startPage134
oaire.citation.titleJOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
oaire.citation.volume126
relation.isAuthorOfPublication54c6a927-2146-44b3-90ee-33dac6503317
relation.isAuthorOfPublication.latestForDiscovery54c6a927-2146-44b3-90ee-33dac6503317

Files

Collections

Research Outputs