Reliability aware throughput management of chip multi-processor architecture via thread migration

Pouyan, Fatemeh; Azarpeyvand, Ali; Safari, Saeed; Fakhraie, S.M.

doi:10.1007/s11227-016-1665-3

Cited by 6 publications

(8 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Full redundancy methods have overheads in terms of performance loss and energy consumption [27,57,43,56,15,33]; therefore, a set of partial redundant multithreading approaches is proposed to reduce these drawbacks [54,37,42,16,39,40,47]. Sundaramoorthy et al [54] proposed a slipstream processor, in which the unnecessary instructions of the redundant stream are eliminated by monitoring the active stream to support partial threading.…”

Section: Partial-rmt Techniquesmentioning

confidence: 99%

“…AVF [8] is a time-varying metric that measures the vulnerability of a hardware component to a fault as a kind of soft error evaluation. The mapping of threads is changed in another study to improve throughput of the system [40]. Siddiqua and Gurumurthi [47] proposed changing redundant execution mode of a thread based on temperature analysis of on-chip structures.…”

Section: Partial-rmt Techniquesmentioning

confidence: 99%

“…The redundancy techniques provide a reliable execution environment; however, they have several overheads in terms of hardware cost, additional memory usage, performance loss, and power consumption. To decrease such overheads, partial redundancy techniques have been proposed which enable partial replication of a system component or a thread [54,37,42,16,39,40,47]. These techniques do not provide full coverage from faults; however, they present low performance overhead.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient selective replication of critical code regions for SDC mitigation leveraging redundant multithreading

Arslan

Ünsal

2021

J Supercomput

View full text Add to dashboard Cite

Redundant multithreading (RMT) is an effective reliability solution that provides thread-level replication; however, it imposes additional overheads in terms of performance loss or energy consumption. Partial-RMT is an alternative solution that provides partial redundancy of an executing thread to reduce such overheads while trading off full coverage from faults. In this study, we propose a software-level RMT approach that offers lightweight replication of partial code regions within the same application process. Our software-level RMT approach is particularly suitable for applications with varying code criticality, where we determine the critical code regions by performing a fault injection campaign in addition to execution time profile analysis. Using the results of the previous step, the application programmer annotates the source code to indicate the specific code regions that should be executed redundantly without re-implementing the application program from scratch. Our lightweight software-level RMT tool improves the average silent data corruption (SDC) rate of 30 applications of the PolyBench benchmark suite by around 7.6× with average performance and energy consumption overheads of 22% and 37%, respectively, compared to the original version of the program.

show abstract

Section: Partial-rmt Techniquesmentioning

confidence: 99%

Section: Partial-rmt Techniquesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient selective replication of critical code regions for SDC mitigation leveraging redundant multithreading

Arslan

Ünsal

2021

J Supercomput

View full text Add to dashboard Cite

show abstract

“…There are several studies that improve the performance of RMT techniques by efficient scheduling of threads on manycore architectures. 12,[15][16][17][18][19] The studies in the literature differentiate the priorities of redundant threads since there is information flow from leaders to trailers in hardware-level RMT techniques. Kalayappan and Sarangi 12 prioritized the leaders over the trailers and pinned them onto the dedicated cores.…”

Section: Related Workmentioning

confidence: 99%

“…On the other hand, trailer threads can be migrated to the remaining cores at each scheduling point. Pouyan et al 16 force the execution of the trailer threads on different cores than the leader threads by considering load balancing and system throughput. In a couple of studies, redundant task mapping approaches are applied to heterogeneous cores that stem from process variation or hardware aging 17‐19 .…”

Section: Related Workmentioning

confidence: 99%

Efficient thread‐to‐core mapping alternatives for application‐level redundant multithreading

Arslan

Ünsal

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryRedundant multithreading (RMT) is an effective thread‐level replication method to improve the reliability requirements of applications. Although it significantly improves the robustness of applications, it comes with additional performance overhead since the redundant threads might share the same core resources. In our previous study [Efficient selective replication of critical code regions for SDC mitigation leveraging redundant multithreading. J Supercomput 2021;77:14130‐14160], we presented an efficient software‐level RMT approach, where we execute the most critical code regions with three threads to correct errors. In this study, we focus on further improving the performance of our software‐level RMT method by presenting a set of different thread‐to‐core mapping alternatives. We provide different static mapping methods, which require preliminary information about the applications, such as execution time, instruction‐per‐cycle (IPC), or cache usage patterns, and a set of dynamic mapping methods, which map threads to cores dynamically at runtime without requiring any additional information. The dynamic mapping methods decide which threads are mapped to which cores at each scheduling point based on the IPC, cache miss rate, or cache access values of each thread as well as each core. Experimental results show that the dynamic mapping method, which maps threads to cores based on IPC values, outperforms all other static and dynamic methods. It also outperforms our baseline model, where the operating system handles the thread‐to‐core mappings by 8%, 7%, and 20% based on average speedup, harmonic speedup, and mean slowdown metrics.

show abstract

A Fast Global AVF Calculation Methodology for Multi-core Reliability Assessment

Jiao

Han

2019

Parallel and Distributed Computing, Applications and Technologies

View full text Add to dashboard Cite

Reliability aware throughput management of chip multi-processor architecture via thread migration

Cited by 6 publications

References 29 publications

Efficient selective replication of critical code regions for SDC mitigation leveraging redundant multithreading

Efficient selective replication of critical code regions for SDC mitigation leveraging redundant multithreading

Efficient thread‐to‐core mapping alternatives for application‐level redundant multithreading

A Fast Global AVF Calculation Methodology for Multi-core Reliability Assessment

Contact Info

Product

Resources

About