Fetching the paper…
Reading the bibliography…
Simple graph algorithms such as PageRank have been the target of numerous hardware accelerators.
O jistém problému minimálním
Otakar Boruvka. 1926 · 1926
Earlier work this paper cites.
k-Degenerate Graphs
Don R. Lick and Arthur T. White. 1970 · 1970
Earlier work this paper cites.
Algorithm 457: finding all cliques of an undirected graph
Coen Bron and Joep Kerbosch. 1973 · 1973
Earlier work this paper cites.
Clustering using a similarity measure based on shared near neighbors
Raymond Austin Jarvis and Edward A Patrick. 1973 · 1973
Earlier work this paper cites.
An introduction to the set theoretical language SETL
K Kennedy and J Schwartz. 1975 · 1975
Earlier work this paper cites.
An algorithm for subgraph isomorphism
Julian R Ullmann. 1976 · 1976
Earlier work this paper cites.
An O (log n) parallel connectivity algorithm
Yossi Shiloach and Uzi Vishkin. 1980 · 1980
Earlier work this paper cites.
An O (logn) parallel connectivity algorithm
Yossi Shiloach and Uzi Vishkin. 1982 · 1982
Earlier work this paper cites.
Smallest-last ordering and clustering and graph coloring algorithms
David W Matula and Leland L Beck. 1983 · 1983
Earlier work this paper cites.
Parallel graph algorithms
Michael J Quinn and Narsingh Deo. 1984 · 1984
Earlier work this paper cites.
Arboricity and subgraph listing algorithms
Norishige Chiba and Takao Nishizeki. 1985a · 1985
Earlier work this paper cites.
Arboricity and Subgraph Listing Algorithms
Norishige Chiba and Takao Nishizeki. 1985b · 1985
Earlier work this paper cites.
Computational complexity of inferring phylogenies by compatibility
William HE Day and David Sankoff. 1986 · 1986
Earlier work this paper cites.
Dijkstra’s algorithm
S Skiena. 1990 · 1990
Earlier work this paper cites.
Fast algorithms for mining association rules. In Proc. 20th int. conf. very large data bases, VLDB , Vol. 1215. Citeseer, 487–499
Rakesh Agrawal, Ramakrishnan Srikant, et al · 1994
Earlier work this paper cites.
Social network analysis: Methods and applications . Vol. 8
Stanley Wasserman and Katherine Faust. 1994 · 1994
Earlier work this paper cites.
ISETL: A programming language for learning mathematics
Ed Dubinsky. 1995 · 1995
Earlier work this paper cites.
Solving graph problems with dynamic computation structures. In High-Speed Computing, Digital Signal Processing, and Filtering Using Reconfigurable Logic , Vol. 2914. International Society for Optics and Photonics, 225–237
Jonathan W Babb, Matthew Frank, and Anant Agarwal. 1996 · 1996
Earlier work this paper cites.
Emergence of Scaling in Random Networks
Albert-László Barabási and Réka Albert. 1999 · 1999
Earlier work this paper cites.
Domain specific mapping for solving graph problems on reconfigurable devices. In International Parallel Processing Symposium . Springer, 652–660
Andreas Dandalis, Alessandro Mei, and Viktor K Prasanna. 1999 · 1999
Earlier work this paper cites.
Edge-Coloring and f-Coloring for Various Classes of Graphs
Xiao Zhou and Takao Nishizeki. 1999 · 1999
Earlier work this paper cites.
A faster algorithm for betweenness centrality
Ulrik Brandes. 2001 · 2001
Earlier work this paper cites.
Parallel programming in OpenMP
Rohit Chandra, Leo Dagum, David Kohr, Ramesh Menon, Dror Maydan, and Jeff McDonald. 2001 · 2001
Earlier work this paper cites.
Frequent subgraph discovery. In Proceedings 2001 IEEE international conference on data mining . IEEE, 313–320
Michihiro Kuramochi and George Karypis. 2001 · 2001
Earlier work this paper cites.
Dijkstra’s shortest path routing algorithm in reconfigurable hardware. In International Conference on Field Programmable Logic and Applications . Springer, 653–657
Matti Tommiska and Jorma Skyttä. 2001 · 2001
Earlier work this paper cites.
CLAIRE: Combining sets, search and rules to better express algorithms
Yves Caseau, François-Xavier Josset, and François Laburthe. 2002 · 2002
Earlier work this paper cites.
HAGAR: Efficient multi-context graph processors. In International Conference on Field Programmable Logic and Applications . Springer, 915–924
Oskar Mencer, Zhining Huang, and Lorenz Huelsbergen. 2002 · 2002
Earlier work this paper cites.
Δ \Delta -stepping: a parallelizable shortest path algorithm
Ulrich Meyer and Peter Sanders. 2003 · 2003
Earlier work this paper cites.
CLIP: similarity searching of 3D databases using clique detection
Nicholas Rhodes, Peter Willett, Alain Calvet, James B Dunbar, and Christine Humblet. 2003 · 2003
Earlier work this paper cites.
Protein complexes and functional modules in molecular networks
Victor Spirin and Leonid A Mirny. 2003 · 2003
Earlier work this paper cites.
State of the art of graph-based data mining
Takashi Washio and Hiroshi Motoda. 2003 · 2003
Earlier work this paper cites.
A (sub) graph isomorphism algorithm for matching large graphs
Luigi P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004 · 2004
Earlier work this paper cites.
Cyclic pattern kernels for predictive graph mining. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 158–167
Tamás Horváth, Thomas Gärtner, and Stefan Wrobel. 2004 · 2004
Earlier work this paper cites.
An efficient algorithm for discovering frequent subgraphs
Michihiro Kuramochi and George Karypis. 2004 · 2004
Earlier work this paper cites.
Link prediction in relational data. In Advances in neural information processing systems . 659–666
Ben Taskar, Ming-Fai Wong, Pieter Abbeel, and Daphne Koller. 2004 · 2004
Earlier work this paper cites.
Linux device drivers
Jonathan Corbet, Alessandro Rubini, and Greg Kroah-Hartman. 2005 · 2005
Earlier work this paper cites.
Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st international conference on Very large data bases . 721–732
David Gibson, Ravi Kumar, and Andrew Tomkins. 2005 · 2005
Earlier work this paper cites.
AMIOT: induced ordered tree mining in tree-structured databases. In Fifth IEEE International Conference on Data Mining (ICDM’05) . IEEE, 8–pp
Shohei Hido and Hiroyuki Kawano. 2005 · 2005
Earlier work this paper cites.
Pin: building customized program analysis tools with dynamic instrumentation
Chi-Keung Luk, Robert Cohn, Robert Muth, Harish Patil, Artur Klauser, Geoff Lowney, Steven Wallace, Vijay Janapa Reddi, and Kim Hazelwood. 2005 · 2005
Earlier work this paper cites.
A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In Proceedings of the 2005 ACM/IEEE conference on Supercomputing . IEEE Computer Society, 25
Andy Yoo, Edmond Chow, Keith Henderson, William McLendon, Bruce Hendrickson, and Umit Catalyurek. 2005 · 2005
Earlier work this paper cites.
Genome-scale computational approaches to memory-intensive applications in systems biology. In SC’05: Proceedings of the 2005 ACM/IEEE Conference on Supercomputing . IEEE, 12–12
Yun Zhang, Faisal N Abu-Khzam, Nicole E Baldwin, Elissa J Chesler, Michael A Langston, and Nagiza F Samatova. 2005 · 2005
Earlier work this paper cites.
Link prediction using supervised learning. In SDM06: workshop on link analysis, counter-terrorism and security
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, and Mohammed Zaki. 2006 · 2006
Earlier work this paper cites.
Parallel FPGA-based all-pairs shortest-paths in a directed graph. In Proceedings 20th IEEE International Parallel Distributed Processing Symposium . 10 pp.–
U. Bondhugula, A. Devulapalli, J. Fernando, P. Wyckoff, and P. Sadayappan. 2006 · 2006
Earlier work this paper cites.
Graph mining: Laws, generators, and algorithms
Deepayan Chakrabarti and Christos Faloutsos. 2006 · 2006
Earlier work this paper cites.
Mining graph data
Diane J Cook and Lawrence B Holder. 2006 · 2006
Earlier work this paper cites.
Matching Structure and Semantics: A Survey on Graph-Based Pattern Matching.. In AAAI Fall Symposium: Capturing and Using Patterns for Evidence Detection . 45–53
Brian Gallagher. 2006 · 2006
Earlier work this paper cites.
Data Mining Concepts and Techniques (A. Stephan, Ed.), 2nd edn., vol. 40
J Han and M Kamber. 2006 · 2006
Earlier work this paper cites.
GraphStep: A system architecture for sparse-graph algorithms. In Field-Programmable Custom Computing Machines, 2006. FCCM’06. 14th Annual IEEE Symposium on . IEEE, 143–151
Nachiket Kapre, Nikil Mehta, Dominic Rizzo, Ian Eslick, Raphael Rubin, Tomas E Uribe, F Thomas Jr, and Andre DeHon. 2006 · 2006
Earlier work this paper cites.
Vertex similarity in networks
Elizabeth A Leicht, Petter Holme, and Mark EJ Newman. 2006 · 2006
Earlier work this paper cites.
The worst-case time complexity for generating all maximal cliques and computational experiments
Etsuji Tomita, Akira Tanaka, and Haruhisa Takahashi. 2006 · 2006
Earlier work this paper cites.
The link-prediction problem for social networks
David Liben-Nowell and Jon Kleinberg. 2007 · 2007
Earlier work this paper cites.
Challenges in Parallel Graph Processing
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickson, and Jonathan W. Berry. 2007 · 2007
Earlier work this paper cites.
Graph clustering
Satu Elisa Schaeffer. 2007 · 2007
Earlier work this paper cites.
Algorithmic aspects of triangle-based network analysis
Thomas Schank. 2007 · 2007
Earlier work this paper cites.
A note on the problem of reporting maximal cliques
Frédéric Cazals and Chinmay Karande. 2008 · 2008
Earlier work this paper cites.
Fast graph pattern matching. In 2008 IEEE 24th International Conference on Data Engineering . IEEE, 913–922
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, S Yu Philip, and Haixun Wang. 2008 · 2008
Earlier work this paper cites.
3D-stacked memory architectures for multi-core processors. In ACM SIGARCH computer architecture news , Vol. 36. IEEE Computer Society, 453–464
Gabriel H Loh. 2008 · 2008
Earlier work this paper cites.
Introduction to algorithms
Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009 · 2009
Earlier work this paper cites.
Mining frequent cross-graph quasi-cliques
Daxin Jiang and Jian Pei. 2009 · 2009
Earlier work this paper cites.
Hardware architecture for finding shortest paths. In TENCON 2009-2009 IEEE Region 10 Conference . IEEE, 1–5
K Sridharan, TK Priya, and P Rajesh Kumar. 2009 · 2009
Earlier work this paper cites.
Managing and mining graph data . Vol. 40
Charu C Aggarwal and Haixun Wang. 2010 · 2010
Earlier work this paper cites.
Parallel Algorithms (2 ed.)
Guy E. Blelloch and Bruce M. Maggs. 2010 · 2010
Earlier work this paper cites.
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I . 403–414
David Eppstein, Maarten Löffler, and Darren Strash. 2010 · 2010
Earlier work this paper cites.
A survey of algorithms for dense subgraph discovery
Victor E Lee, Ning Ruan, Ruoming Jin, and Charu Aggarwal. 2010 · 2010
Earlier work this paper cites.
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures . ACM, 303–314
Charles E Leiserson and Tao B Schardl. 2010 · 2010
Earlier work this paper cites.
Kronecker graphs: An approach to modeling networks
Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010 · 2010
Earlier work this paper cites.
Graphlab: A new framework for parallel machine learning
Yucheng Low et al · 2010
Earlier work this paper cites.
Pregel: a system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data . ACM, 135–146
Grzegorz Malewicz, Matthew H Austern, Aart JC Bik, James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010 · 2010
Earlier work this paper cites.
Introducing the graph 500
Richard C Murphy et al · 2010
Earlier work this paper cites.
Graph mining applications to social network analysis
Lei Tang and Huan Liu. 2010 · 2010
Earlier work this paper cites.
A message-passing multi-softcore architecture on FPGA for breadth-first search. In Field-Programmable Technology (FPT), 2010 International Conference on . IEEE, 70–77
Qingbo Wang, Weirong Jiang, Yinglong Xia, and Viktor Prasanna. 2010 · 2010
Earlier work this paper cites.
A survey of link prediction in social networks
Mohammad Al Hasan and Mohammed J Zaki. 2011 · 2011
Earlier work this paper cites.
A framework for FPGA acceleration of large graph problems: Graphlet counting case study. In Field-Programmable Technology (FPT), 2011 International Conference on . IEEE, 1–8
Brahim Betkaoui, David B Thomas, Wayne Luk, and Natasa Przulj. 2011 · 2011
Earlier work this paper cites.
Parallel breadth-first search on distributed memory systems. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis . ACM, 65
Aydin Buluç and Kamesh Madduri. 2011 · 2011
Earlier work this paper cites.
Field programmable gate array-based acceleration of shortest-path computation
George Rosario Jagadeesh, Thambipillai Srikanthan, and CM Lim. 2011 · 2011
Earlier work this paper cites.
Link prediction in complex networks: A survey
Linyuan Lü and Tao Zhou. 2011 · 2011
Earlier work this paper cites.
The tao of parallelism in algorithms. In ACM Sigplan Notices , Vol. 46. ACM, 12–25
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, and Mario Méndez-Lojo. 2011 · 2011
Earlier work this paper cites.
Cluster Analysis for Anomaly Detection in Accounting Data: An Audit Approach
Sutapat Thiprungsri and Miklos A Vasarhelyi. 2011 · 2011
Earlier work this paper cites.
The risc-v instruction set manual, volume i: Base user-level isa
Andrew Waterman, Yunsup Lee, David A Patterson, and Krste Asanovic. 2011 · 2011
Earlier work this paper cites.
Parallel FPGA-based all pairs shortest paths for sparse networks: A human brain connectome case study. In 22nd International Conference on Field Programmable Logic and Applications (FPL) . 99–104
B. Betkaoui, Y. Wang, D. B. Thomas, and W. Luk. 2012a · 2012
Earlier work this paper cites.
A reconfigurable computing approach for efficient and scalable parallel graph exploration. In Application-Specific Systems, Architectures and Processors (ASAP), 2012 IEEE 23rd International Conference on . IEEE, 8–15
Brahim Betkaoui, Yu Wang, David B Thomas, and Wayne Luk. 2012b · 2012
Earlier work this paper cites.
Fast algorithms for maximal clique enumeration with limited memory. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining . 1240–1248
James Cheng, Linhong Zhu, Yiping Ke, and Shumo Chu. 2012 · 2012
Earlier work this paper cites.
The maximum clique enumeration problem: algorithms, applications, and implementations. In BMC bioinformatics , Vol. 13. Springer, S5
John D Eblen, Charles A Phillips, Gary L Rogers, and Michael A Langston. 2012 · 2012
Earlier work this paper cites.
Powergraph: distributed graph-parallel computation on natural graphs.. In OSDI , Vol. 12. 2
Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012 · 2012
Earlier work this paper cites.
Sniper: Scalable and accurate parallel multi-core simulation. In 8th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems (ACACES-2012) . High-Performance and Embedded Architecture and Compilation Network of …, 91–94
Wim Heirman, Trevor Carlson, and Lieven Eeckhout. 2012 · 2012
Earlier work this paper cites.
Hybrid memory cube new DRAM architecture increases density and performance. In VLSI Technology (VLSIT), 2012 Symposium on . IEEE, 87–88
Joe Jeddeloh and Brent Keeth. 2012 · 2012
Earlier work this paper cites.
Graph mining: A survey of graph mining techniques. In Seventh International Conference on Digital Information Management (ICDIM 2012) . IEEE, 88–92
Saif Ur Rehman, Asmat Ullah Khan, and Simon Fong. 2012 · 2012
Earlier work this paper cites.
Programming with sets: An introduction to SETL
Jacob T Schwartz, Robert BK Dewar, Edward Dubinsky, and Edith Schonberg. 2012 · 2012
Earlier work this paper cites.
Direction-optimizing breadth-first search
Scott Beamer, Krste Asanović, and David Patterson. 2013a · 2013
Earlier work this paper cites.
Distributed memory breadth-first search revisited: Enabling bottom-up search. In 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum . IEEE, 1618–1627
Scott Beamer, Aydin Buluc, Krste Asanovic, and David Patterson. 2013b · 2013
Earlier work this paper cites.
As strong as the weakest link: Mining diverse cliques in weighted graphs. In Joint European conference on machine learning and knowledge discovery in databases . Springer, 525–540
Petko Bogdanov, Ben Baumer, Prithwish Basu, Amotz Bar-Noy, and Ambuj K Singh. 2013 · 2013
Earlier work this paper cites.
Enabling highly-scalable remote memory access programming with MPI-3 one sided. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis . 1–12
Robert Gerstenberger, Maciej Besta, and Torsten Hoefler. 2013 · 2013
Earlier work this paper cites.
Set theory
Thomas Jech. 2013 · 2013
Cited alongside, same era.
A survey of frequent subgraph mining algorithms
Chuntao Jiang, Frans Coenen, and Michele Zito. 2013 · 2013
Cited alongside, same era.
Graph databases
Ian Robinson, Jim Webber, and Emil Eifrem. 2013 · 2013
Cited alongside, same era.
X-stream: Edge-centric graph processing using streaming partitions. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles . ACM, 472–488
Amitabha Roy, Ivo Mihailovic, and Willy Zwaenepoel. 2013 · 2013
Cited alongside, same era.
RowClone: fast and energy-efficient in-DRAM bulk data copy and initialization. In Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture . 185–197
Vivek Seshadri, Yoongu Kim, Chris Fallin, Donghyuk Lee, Rachata Ausavarungnirun, Gennady Pekhimenko, Yixin Luo, Onur Mutlu, Phillip B Gibbons, and Michael A Kozuch. 2013 · 2013
Cited alongside, same era.
Transformations of high-level synthesis codes for high-performance computing
Johannes de Fine Licht, Maciej Besta, Simon Meierhans, and Torsten Hoefler. 2018 · 2018
Later among the works it cites.
Theoretically efficient parallel graph algorithms can be fast and scalable. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures . 393–404
Laxman Dhulipala, Guy E Blelloch, and Julian Shun. 2018 · 2018
Later among the works it cites.
Creating new cloud resource instruction set architecture
Hubertus Franke, Chung-Sheng Li, and Colin J Parris. 2018 · 2018
Later among the works it cites.
Communication-avoiding parallel minimum cuts and connected components
Lukas Gianinazzi, Pavel Kalvoda, Alessandro De Palma, Maciej Besta, and Torsten Hoefler. 2018 · 2018
Later among the works it cites.
A novel ReRAM-based processing-in-memory architecture for graph traversal
Lei Han, Zhaoyan Shen, Duo Liu, Zili Shao, H Howie Huang, and Tao Li. 2018a · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ligra: a lightweight graph processing framework for shared memory. In ACM SIGPLAN Notices , Vol. 48. 135–146
Julian Shun and Guy E Blelloch. 2013 · 2013
Cited alongside, same era.
Graph mining: procedure, application to drug discovery and recent advances
Ichigaku Takigawa and Hiroshi Mamitsuka. 2013 · 2013
Cited alongside, same era.
Fairness-aware scheduling on single-ISA heterogeneous multi-cores. In Proceedings of the 22nd international conference on Parallel architectures and compilation techniques . IEEE, 177–187
Kenzo Van Craeynest, Shoaib Akram, Wim Heirman, Aamer Jaleel, and Lieven Eeckhout. 2013 · 2013
Cited alongside, same era.
A 3D-stacked logic-in-memory accelerator for application-specific data intensive computing. In 2013 IEEE international 3D systems integration conference (3DIC) . IEEE, 1–7
Qiuling Zhu, Berkin Akin, H Ekin Sumbul, Fazle Sadi, James C Hoe, Larry Pileggi, and Franz Franchetti. 2013a · 2013
Cited alongside, same era.
Accelerating sparse matrix-matrix multiplication with 3D-stacked logic-in-memory hardware. In 2013 IEEE High Performance Extreme Computing Conference (HPEC) . IEEE, 1–6
Qiuling Zhu, Tobias Graf, H Ekin Sumbul, Larry Pileggi, and Franz Franchetti. 2013b · 2013
Cited alongside, same era.
CyGraph: A Reconfigurable Architecture for Parallel Breadth-First Search. In 2014 IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW) . IEEE, 228–235
Osama G Attia, Tyler Johnson, Kevin Townsend, Philip Jones, and Joseph Zambreno. 2014 · 2014
Cited alongside, same era.
Fault tolerance for remote memory access programming models. In Proceedings of the 23rd international symposium on High-performance parallel and distributed computing . 37–48
Maciej Besta and Torsten Hoefler. 2014 · 2014
Cited alongside, same era.
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions. In Proceedings of the 2018 International Conference on Management of Data . ACM, 1587–1602
Shuo Han, Lei Zou, and Jeffrey Xu Yu. 2018b · 2018
Later among the works it cites.
Near-data processing for dynamic graph analytics
Eric Robert Hein. 2018 · 2018
Later among the works it cites.
Compiler system for a processor with an expandable instruction set architecture for dynamically configuring execution resources
G Glenn Henry, Rodney E Hooker, Terry Parks, and Douglas R Reed. 2018 · 2018
Later among the works it cites.
HyVE: Hybrid vertex-edge memory hierarchy for energy-efficient graph processing. In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 973–978
Tianhao Huang, Guohao Dai, Yu Wang, and Huazhong Yang. 2018 · 2018
Later among the works it cites.
{ \{ ASAP } \} : Fast, Approximate Graph Pattern Mining at Scale. In 13th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 18) . 745–761
Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018 · 2018
Later among the works it cites.
Pushing the Envelope in Overlapping Communities Detection. In International Symposium on Intelligent Data Analysis . Springer, 151–163
Said Jabbour, Nizar Mhadhbi, Badran Raddaoui, and Lakhdar Sais. 2018 · 2018
Later among the works it cites.
An Efficient System for Subgraph Discovery. In 2018 IEEE International Conference on Big Data (Big Data) . IEEE, 703–712
Aparna Joshi, Yu Zhang, Petko Bogdanov, and Jeong-Hyon Hwang. 2018 · 2018
Later among the works it cites.
GraFBoost: Using accelerated flash storage for external graph analytics. In 2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 411–424
Sang-Woo Jun, Andy Wright, Sizhuo Zhang, and Shuotao Xu. 2018 · 2018
Later among the works it cites.
Accelerating Graph Analytics by Co-Optimizing Storage and Access on an FPGA-HMC Platform. In Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays . ACM, 239–248
Soroosh Khoram, Jialiang Zhang, Maxwell Strange, and Jing Li. 2018 · 2018
Later among the works it cites.
Turbograph++: A scalable and fast graph analytics system. In Proceedings of the 2018 International Conference on Management of Data . ACM, 395–410
Seongyun Ko and Wook-Shin Han. 2018 · 2018
Later among the works it cites.
GraphIA: an in-situ accelerator for large-scale graph processing. In Proceedings of the International Symposium on Memory Systems . 79–84
Gushu Li, Guohao Dai, Shuangchen Li, Yu Wang, and Yuan Xie. 2018 · 2018
Later among the works it cites.
An Empirical Analysis on Expressibility of Vertex Centric Graph Processing Paradigm. In 2018 IEEE International Conference on Big Data (Big Data) . IEEE, 242–251
Siyuan Liu and Arijit Khan. 2018 · 2018
Later among the works it cites.
Graph summarization methods and applications: A survey
Yike Liu, Tara Safavi, Abhilash Dighe, and Danai Koutra. 2018 · 2018
Later among the works it cites.
Exploiting locality in graph analytics through hardware-accelerated traversal scheduling. In 2018 51st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 1–14
Anurag Mukkara, Nathan Beckmann, Maleen Abeydeera, Xiaosong Ma, and Daniel Sanchez. 2018 · 2018
Later among the works it cites.
Outerspace: An outer product based sparse matrix multiplication accelerator. In 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA) . IEEE, 724–736
Subhankar Pal, Jonathan Beaumont, Dong-Hyeon Park, Aporva Amarnath, Siying Feng, Chaitali Chakrabarti, Hun-Seok Kim, David Blaauw, Trevor Mudge, and Ronald Dreslinski. 2018 · 2018
Later among the works it cites.
CGAcc: A Compressed Sparse Row Representation-Based BFS Graph Traversal Accelerator on Hybrid Memory Cube
Cheng Qian, Bruce Childers, Libo Huang, Hui Guo, and Zhiying Wang. 2018 · 2018
Later among the works it cites.
PageRank Acceleration for Large Graphs with Scalable Hardware and Two-Step SpMV. In 2018 IEEE High Performance extreme Computing Conference (HPEC) . IEEE, 1–7
Fazle Sadi, Joe Sweeney, Scott McMillan, Tze Meng Low, James C Hoe, Larry Pileggi, and Franz Franchetti. 2018 · 2018
Later among the works it cites.
Graph processing on GPUs: A survey
Xuanhua Shi, Zhigao Zheng, Yongluan Zhou, Hai Jin, Ligang He, Bo Liu, and Qiang-Sheng Hua. 2018 · 2018
Later among the works it cites.
GraphR: Accelerating graph processing using ReRAM. In High Performance Computer Architecture (HPCA), 2018 IEEE International Symposium on . IEEE, 531–543
Linghao Song, Youwei Zhuo, Xuehai Qian, Hai Li, and Yiran Chen. 2018 · 2018
Later among the works it cites.
Rstream: marrying relational algebra with streaming for efficient graph mining on a single machine. In 13th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 18) . 763–782
Kai Wang, Zhiqiang Zuo, John Thorpe, Tien Quang Nguyen, and Guoqing Harry Xu. 2018 · 2018
Later among the works it cites.
Domino: Graph Processing Services on Energy-Efficient Hardware Accelerator. In 2018 IEEE International Conference on Web Services (ICWS) . IEEE, 274–281
Chongchong Xu, Chao Wang, Lei Gong, Lihui Jin, Xi Li, and Xuehai Zhou. 2018b · 2018
Later among the works it cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018a · 2018
Later among the works it cites.
An Efficient Dispatcher for Large Scale GraphProcessing on OpenCL-based FPGAs
Chengbo Yang. 2018 · 2018
Later among the works it cites.
An Efficient Graph Accelerator with Parallel Data Conflict Management
Pengcheng Yao. 2018 · 2018
Later among the works it cites.
Degree-aware Hybrid Graph Traversal on FPGA-HMC Platform. In Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays . ACM, 229–238
Jialiang Zhang and Jing Li. 2018 · 2018
Later among the works it cites.
GraphP: Reducing Communication for PIM-based Graph Processing with Efficient Data Partition. In High Performance Computer Architecture (HPCA), 2018 IEEE International Symposium on . IEEE, 544–557
Mingxing Zhang, Youwei Zhuo, Chao Wang, Mingyu Gao, Yongwei Wu, Kang Chen, Christos Kozyrakis, and Xuehai Qian. 2018 · 2018
Later among the works it cites.
An FPGA framework for edge-centric graph processing. In Proceedings of the 15th ACM International Conference on Computing Frontiers . ACM, 69–77
Shijie Zhou, Rajgopal Kannan, Hanqing Zeng, and Viktor K Prasanna. 2018 · 2018
Later among the works it cites.
Graphide: A graph processing accelerator leveraging in-dram-computing. In Proceedings of the 2019 on Great Lakes Symposium on VLSI . 45–50
Shaahin Angizi and Deliang Fan. 2019 · 2019
Later among the works it cites.
GraphS: A graph processing accelerator leveraging SOT-MRAM. In 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 378–383
Shaahin Angizi, Jiao Sun, Wei Zhang, and Deliang Fan. 2019 · 2019
Later among the works it cites.
Analysis and optimization of the memory hierarchy for graph processing workloads. In 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA) . IEEE, 373–386
Abanti Basak, Shuangchen Li, Xing Hu, Sang Min Oh, Xinfeng Xie, Li Zhao, Xiaowei Jiang, and Yuan Xie. 2019 · 2019
Later among the works it cites.
Messagefusion: On-path message coalescing for energy efficient and scalable graph analytics. In 2019 IEEE/ACM International Symposium on Low Power Electronics and Design (ISLPED) . IEEE, 1–6
Leul Belayneh, Abraham Addisie, and Valeria Bertacco. 2019 · 2019
Later among the works it cites.
A modular benchmarking infrastructure for high-performance and reproducible deep learning. In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS) . IEEE, 66–77
Tal Ben-Nun, Maciej Besta, Simon Huber, Alexandros Nikolaos Ziogas, Daniel Peter, and Torsten Hoefler. 2019 · 2019
Later among the works it cites.
Substream-centric maximum matchings on fpga. In Proceedings of the 2019 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays . 152–161
Maciej Besta, Marc Fischer, Tal Ben-Nun, Johannes de Fine Licht, and Torsten Hoefler. 2019a · 2019
Later among the works it cites.
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, and Torsten Hoefler. 2019b · 2019
Later among the works it cites.
Maciej Besta, Emanuel Peter, Robert Gerstenberger, Marc Fischer, Michał Podstawski, Claude Barthels, Gustavo Alonso, and Torsten Hoefler. 2019c · 2019
Later among the works it cites.
Graph Processing on FPGAs: Taxonomy, Survey, Challenges
Maciej Besta, Dimitri Stanojevic, Johannes De Fine Licht, Tal Ben-Nun, and Torsten Hoefler. 2019d · 2019
Later among the works it cites.
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU
Xuhao Chen, Roshan Dathathri, Gurbinder Gill, and Keshav Pingali. 2019 · 2019
Later among the works it cites.
GraphSAR: a sparsity-aware processing-in-memory architecture for large-scale graph processing on ReRAMs. In Proceedings of the 24th Asia and South Pacific Design Automation Conference . 120–126
Guohao Dai, Tianhao Huang, Yu Wang, Huazhong Yang, and John Wawrzynek. 2019 · 2019
Later among the works it cites.
Fractal: A General-Purpose Graph Pattern Mining System. In Proceedings of the 2019 International Conference on Management of Data . ACM, 1357–1374
Vinicius Dias, Carlos HC Teixeira, Dorgival Guedes, Wagner Meira, and Srinivasan Parthasarathy. 2019 · 2019
Later among the works it cites.
Large-scale graph processing on emerging storage devices. In 17th { \{ USENIX } \} Conference on File and Storage Technologies ( { \{ FAST } \} 19) . 309–316
Nima Elyasi, Changho Choi, and Anand Sivasubramaniam. 2019 · 2019
Later among the works it cites.
POSTER: Domain-Specialized Cache Management for Graph Analytics. In 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT) . IEEE, 473–474
Priyank Faldu, Jeff Diamond, and Boris Grot. 2019 · 2019
Later among the works it cites.
Computedram: In-memory compute using off-the-shelf drams. In Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture . 100–113
Fei Gao, Georgios Tziantzioulis, and David Wentzlaff. 2019 · 2019
Later among the works it cites.
Processing-in-Memory: A Workload-driven Perspective
Saugata Ghose, Amirali Boroumand, Jeremie S Kim, Juan Gómez-Luna, and Onur Mutlu. 2019a · 2019
Later among the works it cites.
EnGN: A High-Throughput and Energy-Efficient Accelerator for Large Graph Neural Networks
Lei He. 2019 · 2019
Later among the works it cites.
RAGra: Leveraging Monolithic 3D ReRAM for Massively-Parallel Graph Processing. In 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 1273–1276
Yu Huang, Long Zheng, Xiaofei Liao, Hai Jin, Pengcheng Yao, and Chuangyi Gui. 2019 · 2019
Later among the works it cites.
GraphSSD: graph semantics aware SSD. In Proceedings of the 46th International Symposium on Computer Architecture . 116–128
Kiran Kumar Matam, Gunjae Koo, Haipeng Zha, Hung-Wei Tseng, and Murali Annavaram. 2019 · 2019
Later among the works it cites.
GraphZero: Breaking Symmetry for Efficient Graph Mining
Daniel Mawhirter, Sam Reinehr, Connor Holmes, Tongping Liu, and Bo Wu. 2019 · 2019
Later among the works it cites.
AutoMine: harmonizing high-level abstraction and high performance for graph mining. In Proceedings of the 27th ACM Symposium on Operating Systems Principles . ACM, 509–523
Daniel Mawhirter and Bo Wu. 2019 · 2019
Later among the works it cites.
Enhanced graph processing in PIM accelerators with improved queue management
Mohammad Amin Mosayebi, Arghavan Mohammad Hasani, and Masoud Dehyadegari. 2019 · 2019
Later among the works it cites.
Processing Data Where It Makes Sense: Enabling In-Memory Computation
O. Mutlu et al · 2019
Later among the works it cites.
Gencache: Leveraging in-cache operators for efficient sequence alignment. In Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture . 334–346
Anirban Nag, CN Ramachandra, Rajeev Balasubramonian, Ryan Stutsman, Edouard Giacomin, Hari Kambalasubramanyam, and Pierre-Emmanuel Gaillardon. 2019 · 2019
Later among the works it cites.
The Neo4j Graph Algorithms User Guide v3.5
Neo4j, Inc. 2019 · 2019
Later among the works it cites.
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
Pedro Ribeiro, Pedro Paredes, Miguel EP Silva, David Aparicio, and Fernando Silva. 2019 · 2019
Later among the works it cites.
Processor assisted worklist scheduling for FPGA accelerated graph processing on a shared-memory platform. In 2019 IEEE 27th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM) . IEEE, 136–144
Yu Wang, James C Hoe, and Eriko Nurvitadhi. 2019 · 2019
Later among the works it cites.
Alleviating irregularity in graph analytics acceleration: A hardware/software co-design approach. In Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture . 615–628
Mingyu Yan, Xing Hu, Shuangchen Li, Abanti Basak, Han Li, Xin Ma, Itir Akgun, Yujing Feng, Peng Gu, and Lei Deng. 2019 · 2019
Later among the works it cites.
Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine
Cheng Zhao, Zhibin Zhang, Peng Xu, Tianqi Zheng, and Xueqi Cheng. 2019 · 2019
Later among the works it cites.
GRAM: graph processing in a ReRAM-based computational memory.. In ASP-DAC . 591–596
Minxuan Zhou, Mohsen Imani, Saransh Gupta, Yeseong Kim, and Tajana Rosing. 2019 · 2019
Later among the works it cites.
Youwei Zhuo, Chao Wang, Mingxing Zhang, Rui Wang, Dimin Niu, Yanzhi Wang, and Xuehai Qian. 2019 · 2019
Later among the works it cites.
GraphVine: exploiting multicast for scalable graph analytics. In 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 762–767
Leul Belayneh and Valeria Bertacco. 2020 · 2020
Later among the works it cites.
High-performance parallel graph coloring with strong guarantees on work, depth, and quality
Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria, Kacper Janda, Lukas Gianinazzi, and Torsten Hoefler. 2020a · 2020
Later among the works it cites.
Substream-Centric Maximum Matchings on FPGA
Maciej Besta, Marc Fischer, Tal Ben-Nun, Dimitri Stanojevic, Johannes De Fine Licht, and Torsten Hoefler. 2020b · 2020
Later among the works it cites.
Communication-efficient jaccard similarity for high-performance distributed genome comparisons. In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) . IEEE, 1122–1132
Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa, Mikhail Karasikov, Gunnar Rätsch, Torsten Hoefler, and Edgar Solomonik. 2020c · 2020
Later among the works it cites.
GaaS-X: Graph Analytics Accelerator Supporting Sparse Data Representation using Crossbar Architectures
Nagadastagiri Challapalle, Sahithi Rampalli, Linghao Song, Nandhini Chandramoorthy, Karthik Swaminathan, John Sampson, Yiran Chen, and Vijaykrishnan Narayanan. 2020 · 2020
Later among the works it cites.
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy Blelloch, Phillip Gibbons, and Julian Shun. 2020 · 2020
Later among the works it cites.
The art of multiprocessor programming
Maurice Herlihy, Nir Shavit, Victor Luchangco, and Michael Spear. 2020 · 2020
Later among the works it cites.
Peregrine: a pattern-aware graph mining system. In Proceedings of the Fifteenth European Conference on Computer Systems . 1–16
Kasra Jamshidi, Rakesh Mahadasa, and Keval Vora. 2020 · 2020
Later among the works it cites.
The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins. In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems . 1217–1231
Oren Kalinsky, Benny Kimelfeld, and Yoav Etsion. 2020 · 2020
Later among the works it cites.
ReGra: Accelerating Graph Traversal Applications Using ReRAM with Lower Communication Cost
Haoqiang Liu, Qiang-Sheng Hua, Hai Jin, and Long Zheng. 2020 · 2020
Later among the works it cites.
A Modern Primer on Processing in Memory
Onur Mutlu, Saugata Ghose, Juan Gómez-Luna, and Rachata Ausavarungnirun. 2020 · 2020
Later among the works it cites.
The Future is Big Graphs! A Community View on Graph Processing Systems
Sherif Sakr, Angela Bonifati, Hannes Voigt, Alexandru Iosup, Khaled Ammar, Renzo Angles, Walid Aref, Marcelo Arenas, Maciej Besta, Peter A Boncz, et al · 2020
Later among the works it cites.
An FPGA based Accelerator for Ubiquitous Clustering Applications with Custom Instructions
Chao Wang, Lei Gong, Fahui Jia, and Zhou Xuehai. 2020 · 2020
Later among the works it cites.
A comprehensive survey on graph neural networks
Zonghan Wu, Shirui Pan, Fengwen Chen, Guodong Long, Chengqi Zhang, and S Yu Philip. 2020 · 2020
Later among the works it cites.
ELP2IM: Efficient and Low Power Bitwise Operation Processing in DRAM. In 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA) . IEEE, 303–314
Xin Xin, Youtao Zhang, and Jun Yang. 2020 · 2020
Later among the works it cites.
PrefixFPM: A Parallel Framework for General-Purpose Frequent Pattern Mining. In Proceedings of the 36th IEEE International Conference on Data Engineering (ICDE) 2020
Da Yan, Wenwen Qu, Guimu Guo, and Xiaoling Wang. 2020b · 2020
Later among the works it cites.
Hygcn: A gcn accelerator with hybrid architecture. In 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA) . IEEE, 15–29
Mingyu Yan, Lei Deng, Xing Hu, Ling Liang, Yujing Feng, Xiaochun Ye, Zhimin Zhang, Dongrui Fan, and Yuan Xie. 2020a · 2020
Later among the works it cites.
GraphABCD: Scaling Out Graph Analytics with Asynchronous Block Coordinate Descent. In 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 419–432
Yifan Yang, Zhaoshi Li, Yangdong Deng, Zhiwei Liu, Shouyi Yin, Shaojun Wei, and Leibo Liu. 2020 · 2020
Later among the works it cites.
A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications. In 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 895–907
Pengcheng Yao, Long Zheng, Zhen Zeng, Yu Huang, Chuangyi Gui, Xiaofei Liao, Hai Jin, and Jingling Xue. 2020 · 2020
Later among the works it cites.
Spara: An Energy-Efficient ReRAM-Based Accelerator for Sparse Graph Analytics Applications. In 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) . IEEE, 696–707
Long Zheng, Jieshan Zhao, Yu Huang, Qinggang Wang, Zhen Zeng, Jingling Xue, Xiaofei Liao, and Hai Jin. 2020 · 2020
Later among the works it cites.
Motif Prediction with Graph Neural Networks
Maciej Besta, Raphael Grob, Cesare Miglioli, Nicola Bernold, Grzegorz Kwasniewski, Gabriel Gjini, Raghavendra Kanakagiri, Saleh Ashkboos, Lukas Gianinazzi, Nikoli Dryden, et al · 2021
Closest in time.
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi, Jakub Beranek, Kacper Janda, Tobias Holenstein, Sebastian Leisinger, et al · 2021
Closest in time.
Learning Combinatorial Node Labeling Algorithms
Lukas Gianinazzi, Maximilian Fries, Nikoli Dryden, Tal Ben-Nun, and Torsten Hoefler. 2021b · 2021
Closest in time.
Benchmarking a New Paradigm: An Experimental Analysis of a Real Processing-in-Memory Architecture
Juan Gómez-Luna, Izzat El Hajj, Ivan Fernandez, Christina Giannoula, Geraldo F Oliveira, and Onur Mutlu. 2021 · 2021
Closest in time.
SIMDRAM: a framework for bit-serial SIMD processing using DRAM. In Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems . 329–345
Nastaran Hajinazar, Geraldo F Oliveira, Sven Gregorio, João Dinis Ferreira, Nika Mansouri Ghiasi, Minesh Patel, Mohammed Alser, Saugata Ghose, Juan Gómez-Luna, and Onur Mutlu. 2021 · 2021
Closest in time.
DAMOV: A New Methodology and Benchmark Suite for Evaluating Data Movement Bottlenecks
Geraldo F Oliveira, Juan Gómez-Luna, Lois Orosa, Saugata Ghose, Nandita Vijaykumar, Ivan Fernandez, Mohammad Sadrosadati, and Onur Mutlu. 2021 · 2021
Closest in time.
IntersectX: An Accelerator for Graph Mining
Gengyu Rao, Jingji Chen, Jason Yik, and Xuehai Qian. 2021 · 2021
Closest in time.
Testing bounded arboricity. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018 . 2081–2092
Talya Eden, Reut Levi, and Dana Ron. 2018 · 2092
Closest in time.