Matthew Naylor

Matthew Naylor

Auto-generated profile, based on publicly available information

Matthew Naylor

University of Cambridge, Cambridge, United Kingdom

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 March 2023 in IEEE Design & Test
Verified
Journal Article
Closed access
AJAlexandre Joannou
Alexandre Joannou
PRPeter Rugg
Peter Rugg
JWJonathan Woodruff
Jonathan Woodruff
FFFranz A. Fuchs
Franz A. Fuchs
MMMarno van der Maas
Marno van der Maas
SMSimon W. Moore
Simon W. Moore
TestRIG (Testing with Random Instruction Generation) is a testing framework for RISC-V implementations. The RISC-V community has standardized a formal model of the architecture in the Sail language 1 , giving a human-readable specification that can also be used for simulation and verification. The Sail language is designed for this purpose by allowing instruction semantics to be described conveniently (for example, by supporting variable bit-widths). Ideally, a RISC-V implementor could formally prove equivalence between their implementation and the Sail model, but proof tools are not yet sufficiently automated to be routinely used on the whole-processor level. They instead focus on equivalence between combinational logic functions, with verification of a full out-of-order microarchitecture remaining an open problem. As a pragmatic compromise, we use TestRIG to check equivalence between the model and an implementation by generating random instruction sequences, executing the same sequences on the model and the implementation under test, and comparing execution traces (tandem execution). This approach does not prove equivalence but can demonstrate divergence, and is usable in all stages of development.

20 June 2025
Verified
Conference Paper
Open access
JCJianyi Cheng
Jianyi Cheng
AMA. Theodore Markettos
A. Theodore Markettos
AJAlexandre Joannou
Alexandre Joannou
PMPaul Metzger
Paul Metzger
MNMatthew Naylor
Matthew Naylor
TJTimothy M. Jones
Timothy M. Jones

1 March 2021
Verified
Conference Paper
Open access
MNMatthew Naylor
Matthew Naylor
SMSimon W. Moore
Simon W. Moore
DTDavid Thomas
David Thomas
JBJonathan R. Beaumont
Jonathan R. Beaumont
SFShane Fleming
Shane Fleming
ABAndrew Brown
Andrew Brown
Manycore architectures are increasingly favouring message-passing or partitioned global address spaces (PGAS) over cache coherency for reasons of power efficiency and scalability. However, in the absence of cache coherency, there can be a lack of hardware support for one-to-many communication patterns, which are prevalent in some application domains. To address this, we present new hardware primitives for multicast communication in rack-scale manycore systems. These primitives guarantee delivery to both colocated and distributed destinations, and can capture large unstructured communication patterns precisely. As a result, reliable multicast transfers among any number of software tasks, connected in any topology, can be fully offloaded to hardware. We implement the new primitives in a research platform consisting of 50K RISC-V threads distributed over 48 FPGAs, and demonstrate significant performance benefits on a range of applications expressed using a high-level vertex-centric programming model.

20 June 2023 in ACM Transactions on Parallel Computing
Verified
Journal Article
Open access
ABAndrew D. Brown
Andrew D. Brown
JBJonathan R. Beaumont
Jonathan R. Beaumont
DTDavid B. Thomas
David B. Thomas
JSJulian C. Shillcock
Julian C. Shillcock
MNMatthew F. Naylor
Matthew F. Naylor
SFShane T. Fleming
Shane T. Fleming
HPC clusters have become ever more expensive, both in terms of capital cost and energy consumption; some estimates suggest that competitive installations at the end of the next decade will require their own power station. One way around this looming problem is to design bespoke computing engines, but while the performance benefits are good, the design costs are huge and cannot easily be amortized. Partially Ordered Event Triggered System (POETS)—the focus of this article—seeks to exploit a middle way: The architecture is tuned to a specific algorithmic pattern but, within that constraint, is fully programmable. POETS software is quasi-imperative: The user defines a set of sequential event handlers, defines the topology of a (typically large) concurrent ensemble of these, and lets them interact. The “solution” may be exfiltrated from the emergent behaviour of the ensemble. In this article, we describe (briefly) the architecture, and an example computational chemistry application, dissipative particle dynamics (DPD). The DPD algorithm is traditionally implemented using parallel computational techniques, but we re-cast it as a concurrent compute problem that is then ideally suited to POETS. Our prototype system is realised on a cluster of 48 FPGAs providing 50K concurrent hardware threads, and we report performance speedups of over two orders of magnitude better than a single thread baseline comparator and scaling behaviour that is almost constant. The results are validated against a “conventional” implementation.

1 March 2022 in IET Computers & Digital Techniques
Verified
Journal Article
Open access
ARAshur Rafiev
Ashur Rafiev
Alex YakovlevAlex Yakovlev
Alex Yakovlev
GTGhaith Tarawneh
Ghaith Tarawneh
MNMatthew F. Naylor
Matthew F. Naylor
SMSimon W. Moore
Simon W. Moore
ABAndrew D. Brown
Andrew D. Brown
One of the key problems in designing and implementing graph analysis algorithms for distributed platforms is to find an optimal way of managing communication flows in the massively parallel processing network. Message‐passing and global synchronization are powerful abstractions in this regard, especially when used in combination. This paper studies the use of a hardware‐implemented refutable global barrier as a design optimization technique aimed at unifying these abstractions at the API level. The paper explores the trade‐offs between the related overheads and performance factors on a message‐passing prototype machine with 49,152 RISC‐V threads distributed over 48 FPGAs (called the Partially Ordered Event‐Triggered Systems platform). Our experiments show that some graph applications favour synchronized communication, but the effect is hard to predict in general because of the interplay between multiple hardware and software factors. A classifier model is therefore proposed and implemented to perform such a prediction based on the application graph topology parameters: graph diameter, degree of connectivity, and reconvergence metric. The presented experimental results demonstrate that the correct choice of communication mode, granted by the new model‐driven approach, helps to achieve 3.22 times faster computation time on average compared to the baseline platform operation.

20 April 2022
Verified
Book Chapter
Closed access
PDF file
ARAshur Rafiev
Ashur Rafiev
JMJordan Peter Morris
Jordan Peter Morris
FXFei Xia
Fei Xia
Alex YakovlevAlex Yakovlev
Alex Yakovlev
MNMatthew Naylor
Matthew Naylor
ABAndrew Brown
Andrew Brown