Graph-based Programming Models
Graph-Based Programming Models is a programming paradigm within FPGA design methodologies that represents computation as a directed graph of functional nodes and data dependencies, distinguishing itself by enabling explicit spatial and temporal parallelism through visual and structural abstraction of hardware operations.
32
Publications
1.2K
Citations
80
Authors
41
Institutions
Publications per year
2017–2026
8
Parents
32
From "think like a vertex" to "think like a graph"
Yuanyuan Tian, Andrey Balmin, Severin Andreas Corsten et al. · Proceedings of the VLDB Endowment · 2013 · 351 citations
Detlef Plump · Electronic Proceedings in Theoretical Computer Science · 2012 · 43 citations · Full text
Functional programming with graphs
Martin Erwig · 1997 · 42 citations · Full text
Addressing System-Level Optimization with OpenVX Graphs
Erik Rainey, Jesse Villarreal, Göksel Dedeoǧlu et al. · 2014 · 41 citations
1–5 of 32
80
4
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 80
41

University of York
York, United Kingdom
3 h-index
5 publications
111 citations
The University of Texas at Austin
Austin, United States
3 h-index
4 publications
113 citations
IBM (United States)
Armonk, United States
2 h-index
4 publications
1.1K citations
University of Utah
Salt Lake City, United States
2 h-index
4 publications
54 citations
National University of Singapore
Singapore, Singapore
2 h-index
2 publications
43 citations
FernUniversität in Hagen
Hagen, Germany
2 h-index
2 publications
59 citations
The University of Tokyo
Tokyo, Japan
1 h-index
1 publications
14 citations

University of Essex
Colchester, United Kingdom
1 h-index
1 publications
26 citations
1–8 of 41
Repository · 2 publications · 37 citations
2
h-index
TSE · 2 publications · 55 citations
2
h-index
2 publications · 27 citations
2
h-index
2 publications · 46 citations
2
h-index
2 publications · 56 citations
2
h-index
1–5