Decoupling Computation and Result Write-Back for Thread-Level Parallelization

Decoupling Computation and Result Write-Back for Thread-Level Parallelization

Hiroaki Hirata, Atsushi Nunome
Copyright: © 2020 |Pages: 16
DOI: 10.4018/IJSI.2020070102
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Thread-level speculation (TLS) is an approach to enhance the opportunity of parallelization of programs. A TLS system enables multiple threads to begin the execution of tasks in parallel even if there may be the dependency between tasks. When any dependency violation is detected, the TLS system enforces the violating thread to abort and re-execute the task. So, the frequency of aborts is one of the factors that damage the performance of the speculative execution. This article proposes a new technique named the code shelving, which enables threads not to need to abort. It is available not only for TLS but also as a flexible synchronization technique in conventional and non-speculatively parallel execution. The authors implemented the code shelving on their parallel execution system called Speculative Memory (SM) and verified the effectiveness of the code shelving.
Article Preview
Top

Background

Many techniques for parallelizing sequentially-coded programs have been developed (Zima, 1990). Most of them, which are intended to be used by parallelizing compilers, analyze the dependencies among iterations of a loop in a program and execute iterations only if it is assured that they have no dependencies on each other. When any one of the iterations may depend on other iterations—even if many other iterations are independent—however, no compiler can parallelize the loop.

Complete Article List

Search this Journal:
Reset
Volume 12: 1 Issue (2024)
Volume 11: 1 Issue (2023)
Volume 10: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 9: 4 Issues (2021)
Volume 8: 4 Issues (2020)
Volume 7: 4 Issues (2019)
Volume 6: 4 Issues (2018)
Volume 5: 4 Issues (2017)
Volume 4: 4 Issues (2016)
Volume 3: 4 Issues (2015)
Volume 2: 4 Issues (2014)
Volume 1: 4 Issues (2013)
View Complete Journal Contents Listing