TY - JOUR
T1 - Supporting concurrent memory access in TCF processor architectures
AU - Forsell, Martti
AU - Roivainen, Jussi
AU - Leppänen, Ville
AU - Träff, Jesper Larsson
N1 - Funding Information:
This work was funded by the Academy of Finland grant 289773 .
Publisher Copyright:
© 2018
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2018/11/1
Y1 - 2018/11/1
N2 - The Thick Control Flow (TCF) model simplifies parallel programming by bundling computations with the same control flow into single flows of variable thickness, and has the prospect of alleviating redundant usage of software and hardware resources. While architectures that can support the TCF model have been proposed, current proposals cannot support concurrent memory accesses that can both simplify programming and speed up many parallel algorithms by a logarithmic factor. In this paper, we extend current TCF architectures to efficiently support concurrent read as well as write memory accesses. The solution is based on bounded size step-caches, and exploit the two-part, hybrid, frontend-backend structure of current TCF processors, and synchronization properties of the TCF model itself. According to our simulation-based evaluation, a concurrent memory access TCF processor with B backends can execute algorithms with substantial concurrent memory accesses up to B times faster than a baseline TCF processor not supporting concurrent memory access. The hardware overhead of the solution is estimated to be modest. We include parallel program code to illustrate the gains by supporting concurrent memory accesses.
AB - The Thick Control Flow (TCF) model simplifies parallel programming by bundling computations with the same control flow into single flows of variable thickness, and has the prospect of alleviating redundant usage of software and hardware resources. While architectures that can support the TCF model have been proposed, current proposals cannot support concurrent memory accesses that can both simplify programming and speed up many parallel algorithms by a logarithmic factor. In this paper, we extend current TCF architectures to efficiently support concurrent read as well as write memory accesses. The solution is based on bounded size step-caches, and exploit the two-part, hybrid, frontend-backend structure of current TCF processors, and synchronization properties of the TCF model itself. According to our simulation-based evaluation, a concurrent memory access TCF processor with B backends can execute algorithms with substantial concurrent memory accesses up to B times faster than a baseline TCF processor not supporting concurrent memory access. The hardware overhead of the solution is estimated to be modest. We include parallel program code to illustrate the gains by supporting concurrent memory accesses.
KW - Concurrent memory access
KW - Parallel computing
KW - Processor architecture
KW - Programming model
KW - TCF
UR - http://www.scopus.com/inward/record.url?scp=85054190193&partnerID=8YFLogxK
U2 - 10.1016/j.micpro.2018.09.013
DO - 10.1016/j.micpro.2018.09.013
M3 - Article
AN - SCOPUS:85054190193
SN - 0141-9331
VL - 63
SP - 226
EP - 236
JO - Microprocessors and Microsystems
JF - Microprocessors and Microsystems
ER -