A4 Vertaisarvioitu artikkeli konferenssijulkaisussa

Supporting Concurrent Memory Access in TCF-aware Processor Architectures




TekijätMartti Forsell, Jussi Roivainen, Ville Leppänen, Jesper Träff

ToimittajaJari Nurmi, Mark Vesterbacka, J. Jacob Wikner, Atila Alvandpour, Martin Nielsen-Lönn, Ivan Ring Nielsen

Konferenssin vakiintunut nimiNordic Circuits and Systems Conference

Julkaisuvuosi2017

Kokoomateoksen nimiProceedings of Nordic Circuits and Systems Conference (NORCAS): NORCHIP and International Symposium of System-on-Chip (SoC)

Aloitussivu1

Lopetussivu6

Sivujen määrä6

ISBN978-1-5386-2845-4

eISBN978-1-5386-2844-7

DOIhttps://doi.org/10.1109/NORCHIP.2017.8124962

Verkko-osoitehttp://ieeexplore.ieee.org/document/8124962/

Rinnakkaistallenteen osoitehttps://research.utu.fi/converis/portal/detail/Publication/290065560


Tiivistelmä

The Thick Control Flow (TCF) model packs together selfsimilar
computations to simplify parallel programming and to eliminate
redundant usage of associated software and hardware resources.
While there are processor architectures supporting native execution
of programs written for the model, none of them support concurrent
memory access that can speed up execution of many algorithms by a
logarithmic factor. In this paper, we propose an architectural solution
implementing concurrent memory access for TCF-aware processors.
The solution is based on bounded size step caches and two-phase
structure of the TCF-aware processors. Step caches capture and hold
the references made during the on-going step of an execution that
are independent by the definition of TCF execution and therefore
avoid coherence problems. The 2-phase structure reduces some concurrent
accesses to a frontend operation followed by broadcast in the
spreading network. According to our evaluation, a concurrent memory
access-aware B-backend unit TCF processor executes certain algorithms
up to B times faster than the baseline TCF processor.


Ladattava julkaisu

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.





Last updated on 2024-26-11 at 21:54