When subgraph isomorphism is really hard, and why this matters for graph databases

C McCreesh, P Prosser, C Solnon, J Trimble - Journal of Artificial …, 2018 - jair.org
The subgraph isomorphism problem involves deciding whether a copy of a pattern graph
occurs inside a larger target graph. The non-induced version allows extra edges in the …

Bind the gap: Compiling real software to hardware FFT accelerators

J Woodruff, J Armengol-Estapé, S Ainsworth… - Proceedings of the 43rd …, 2022 - dl.acm.org
Specialized hardware accelerators continue to be a source of performance improvement.
However, such specialization comes at a programming price. The fundamental issue is that …

Matching linear algebra and tensor code to specialized hardware accelerators

PA Martínez, J Woodruff, J Armengol-Estapé… - Proceedings of the …, 2023 - dl.acm.org
Dedicated tensor accelerators demonstrate the importance of linear algebra in modern
applications. Such accelerators have the potential for impressive performance gains, but …

Instruction selection

GH Blindell - Principles, Methods, and Applications, 2016 - Springer
Like most doctoral students, I started my studies by reviewing the existing, most prominent
approaches in the field. A couple of months later I thought I had acquired a sufficient …

Solving hard subgraph problems in parallel

C McCreesh - 2017 - theses.gla.ac.uk
This thesis improves the state of the art in exact, practical algorithms for finding subgraphs.
We study maximum clique, subgraph isomorphism, and maximum common subgraph …

[PDF][PDF] Bind the Gap: Compiling Real Software to Hardware FFT Accelerators

JWJAE Sam, AMFP O'Boyle - small, 2022 - jacksonwoodruff.com
Specialized hardware accelerators continue to be a source of performance improvement.
However, such specialization comes at a programming price. The fundamental issue is that …

Acceleration for the many, not the few

J Woodruff - 2024 - era.ed.ac.uk
Although specialized hardware promises orders of magnitude performance gains, their
uptake has been limited by how challenging it is to program them. Hardware accelerators …

Universal Instruction Selection

G Hjort Blindell - 2018 - diva-portal.org
In code generation, instruction selection chooses instructions to implement a given program
under compilation, global code motion moves computations from one part of the program to …

[PDF][PDF] ASIP algorithmic/architectural co-exploration based on high level performance estimation

JF Eusse Giraldo - 2020 - publications.rwth-aachen.de
This is probably the hardest part of the writing process, as there is so many important people
that has influenced the journey to the completion of this document, and remembering each …