| KEYWORD |
FPGA-based acceleration of subgraph isomorphism
Parole chiave FPGA ACCELERATION, GRAPHS, HIGH-LEVEL SYNTHESIS
Riferimenti LUCIANO LAVAGNO
Riferimenti esterni Roberto Bosio
Gruppi di ricerca Microelectronics
Tipo tesi RESEARCH
Descrizione Graph processing has become an integral part of various areas, such as machine learning, medical applications, and social network analysis.
In instances like web or social networks, graphs can reach trillions of edges, presenting a significant challenge due to their vast scale and non-uniform nature.
Field Programmable Gate Arrays (FPGAs) can be an energy-efficient solution to deliver specialized hardware for graph processing.
The thesis aims to address the computational challenges associated with graph algorithms acceleration, specifically the subgraph isomorphism problem, a fundamental problem in graph theory.
The accelerator aims to enhance the performance of an existent subgraph isomorphism solver, by optimizing the data movement from/to memory for dedicated data center FPGAs.
Conoscenze richieste - FPGA design
- C/C++ coding
- high-level synthesis is desireable but not mandatory
Scadenza validita proposta 16/01/2025
PROPONI LA TUA CANDIDATURA