Scheduling opportunities for asymmetrically reliable caches

Sanem Arslan, Haluk Rahmi Topcuoglu, Mahmut Kandemir, Oguz Tosun

Research output: Contribution to journalArticle

Abstract

Modern 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.

Original languageEnglish (US)
Pages (from-to)134-151
Number of pages18
JournalJournal of Parallel and Distributed Computing
Volume126
DOIs
StatePublished - Apr 1 2019

Fingerprint

Cache
Scheduling
System Performance
Scheduling algorithms
Fairness
Scheduling Algorithm
Workload
Soft Error
Fault tolerance
Burst
Fault Tolerance
Thread
Power Consumption
Energy Consumption
Assign
High Energy
Fragment
Electric power utilization
Energy utilization
Trade-offs

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Arslan, Sanem ; Topcuoglu, Haluk Rahmi ; Kandemir, Mahmut ; Tosun, Oguz. / Scheduling opportunities for asymmetrically reliable caches. In: Journal of Parallel and Distributed Computing. 2019 ; Vol. 126. pp. 134-151.
@article{163c3737802d4a9ca6c0fde4869f1b05,
title = "Scheduling opportunities for asymmetrically reliable caches",
abstract = "Modern 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.",
author = "Sanem Arslan and Topcuoglu, {Haluk Rahmi} and Mahmut Kandemir and Oguz Tosun",
year = "2019",
month = "4",
day = "1",
doi = "10.1016/j.jpdc.2019.01.005",
language = "English (US)",
volume = "126",
pages = "134--151",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",

}

Scheduling opportunities for asymmetrically reliable caches. / Arslan, Sanem; Topcuoglu, Haluk Rahmi; Kandemir, Mahmut; Tosun, Oguz.

In: Journal of Parallel and Distributed Computing, Vol. 126, 01.04.2019, p. 134-151.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Scheduling opportunities for asymmetrically reliable caches

AU - Arslan, Sanem

AU - Topcuoglu, Haluk Rahmi

AU - Kandemir, Mahmut

AU - Tosun, Oguz

PY - 2019/4/1

Y1 - 2019/4/1

N2 - Modern 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.

AB - Modern 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.

UR - http://www.scopus.com/inward/record.url?scp=85060194747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85060194747&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2019.01.005

DO - 10.1016/j.jpdc.2019.01.005

M3 - Article

AN - SCOPUS:85060194747

VL - 126

SP - 134

EP - 151

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

ER -