Fetching the paper…
Reading the bibliography…
Graph-specific computing with the support of dedicated accelerator has greatly boosted the graph processing in both efficiency and energy.
J. Sklansky, “Conditional-sum addition logic,” IRE Transactions on Electronic computers , no. 2, pp. 226–231, 1960
1960
Earlier work this paper cites.
P. M. Kogge and H. S. Stone, “A parallel algorithm for the efficient solution of a general class of recurrence equations,” IEEE transactions on computers , vol. 100, no. 8, pp. 786–793, 1973
1973
Earlier work this paper cites.
R. E. Ladner and M. J. Fischer, “Parallel prefix computation,” Journal of the ACM , vol. 27, no. 4, pp. 831–838, 1980
1980
Earlier work this paper cites.
R. P. Brent and H.-T. Kung, “A regular layout for parallel adders,” IEEE transactions on Computers , no. 3, pp. 260–264, 1982
1982
Earlier work this paper cites.
G. E. Blelloch, “Scans as primitive parallel operations,” IEEE Transactions on computers , vol. 38, no. 11, pp. 1526–1538, 1989
1989
Earlier work this paper cites.
M. Herlihy and J. E. B. Moss, “Transactional memory: Architectural support for lock-free data structures,” in Proceedings of Annual International Symposium on Computer Architecture (ISCA) , 1993, pp. 289–300
1993
Earlier work this paper cites.
M. Gokhale, B. Holmes, and K. Iobst, “Processing in memory: The terasys massively oarallel pim array,” IEEE Computer , vol. 28, no. 4, pp. 23–31, 1995
1995
Earlier work this paper cites.
S. Knowles, “A family of adders,” in Proceedings of IEEE Symposium on Computer Arithmetic , 2001, pp. 277–281
2001
Earlier work this paper cites.
R. Rajwar and J. R. Goodman, “Speculative lock elision: Enabling highly concurrent multithreaded execution,” in Proceedings of International Symposium on Microarchitecture (MICRO) , 2001, pp. 294–305
2001
Earlier work this paper cites.
X. Liao, H. Jin, Y. Liu, L. M. Ni, and D. Deng, “Anysee: Peer-to-peer live streaming,” in Processing of IEEE International Conference on Computer Communications (INFOCOM) , 2006, pp. 1–10
2006
Earlier work this paper cites.
K. Pagiamtzis and A. Sheikholeslami, “Content-addressable memory (cam) circuits and architectures: A tutorial and survey,” IEEE Journal of Solid-State Circuits , vol. 41, no. 3, pp. 712–727, 2006
2006
Earlier work this paper cites.
J. Cong, W. Jiang, B. Liu, and Y. Zou, “Automatic memory partitioning and scheduling for throughput and power optimization,” ACM Transactions on Design Automation of Electronic Systems , vol. 16, no. 2, pp. 15:1–15:25, 2011
2011
Earlier work this paper cites.
P. Rosenfeld, E. Cooper-Balis, and B. Jacob, “Dramsim2: A cycle accurate memory system simulator,” IEEE Computer Architecture Letters , vol. 10, no. 1, pp. 16–19, 2011
2011
Cited alongside, same era.
J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, “Powergraph: Distributed graph-parallel computation on natural graphs,” in Proceedings of USENIX Symposium on Operating Systems Design and Implementation (OSDI) , 2012, pp. 17–30
2012
Cited alongside, same era.
J. Shun and G. E. Blelloch, “Ligra: A lightweight graph processing framework for shared memory,” in Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) , 2013, pp. 135–146
2013
Cited alongside, same era.
Y. Wang, P. Li, P. Zhang, C. Zhang, and J. Cong, “Memory partitioning for multidimensional arrays in high-level synthesis,” in Proceedings of Annual Design Automation Conference (DAC) , 2013, pp. 12:1–12:8
2013
Cited alongside, same era.
Y. Guo, A. L. Varbanescu, A. Iosup, and D. Epema, “An empirical performance evaluation of gpu-enabled graph-processing systems,” in Proceedings of IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) , 2015, pp. 423–432
2015
Later among the works it cites.
X. Zhu, W. Han, and W. Chen, “Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning,” in Proceedings of USENIX Annual Technical Conference (ATC) , 2015, pp. 375–386
2015
Later among the works it cites.
J. Ahn, S. Yoo, O. Mutlu, and K. Choi, “Pim-enabled instructions: A low-overhead, locality-aware processing-in-memory architecture,” in Proceedings of Annual International Symposium on Computer Architecture (ISCA) , 2015, pp. 336–348
2015
Later among the works it cites.
T. J. Ham, L. Wu, N. Sundaram, N. Satish, and M. Martonosi, “Graphicionado: A high-performance and energy-efficient accelerator for graph analytics,” in Proceedings of International Symposium on Microarchitecture (MICRO) , 2016, pp. 1–13
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Nurvitadhi, G. Weisz, Y. Wang, S. Hurkat, M. Nguyen, J. C. Hoe, J. F. Martínez, and C. Guestrin, “Graphgen: An fpga framework for vertex-centric graph computation,” in Proceedings of IEEE Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM) , 2014, pp. 25–28
2014
Cited alongside, same era.
J. Leskovec and A. Krevl, “SNAP Datasets: Stanford large network dataset collection,” http://snap.stanford.edu/data, 2014
2014
Cited alongside, same era.
Y. Guo, M. Biczak, A. L. Varbanescu, A. Iosup, C. Martella, and T. L. Willke, “How well do graph-processing platforms perform? an empirical performance evaluation and analysis,” in Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS) , 2014, pp. 395–404
2014
Cited alongside, same era.
C. H. Teixeira, A. J. Fonseca, M. Serafini, G. Siganos, M. J. Zaki, and A. Aboulnaga, “Arabesque: A system for distributed graph mining,” in Proceedings of Symposium on Operating Systems Principles (SOSP) , 2015, pp. 425–440
2015
Cited alongside, same era.
M. Wu, F. Yang, J. Xue, W. Xiao, Y. Miao, L. Wei, H. Lin, Y. Dai, and L. Zhou, “Gram: Scaling graph computation to the trillions,” in Proceedings of ACM Symposium on Cloud Computing (SoCC) , 2015, pp. 408–421
2015
Cited alongside, same era.
J. H. Lee, J. Sim, and H. Kim, “Bssync: Processing near memory for machine learning workloads with bounded staleness consistency models,” in Proceedings of International Conference on Parallel Architecture and Compilation (PACT) , 2015, pp. 241–252
2015
Cited alongside, same era.
J. Ahn, S. Hong, S. Yoo, O. Mutlu, and K. Choi, “A scalable processing-in-memory accelerator for parallel graph processing,” in Proceedings of Annual International Symposium on Computer Architecture (ISCA) , 2015, pp. 105–117
2015
Cited alongside, same era.
S. Beamer, K. Asanovic, and D. Patterson, “Locality exists in graph processing: Workload characterization on an ivy bridge server,” in Proceedings of IEEE International Symposium on Workload Characterization (IISWC) , 2015, pp. 56–65
2015
Cited alongside, same era.
2016
Later among the works it cites.
M. M. Ozdal, S. Yesil, T. Kim, A. Ayupov, J. Greth, S. Burns, and O. Ozturk, “Energy efficient architecture for graph analytics accelerators,” in Proceedings of Annual International Symposium on Computer Architecture (ISCA) , 2016, pp. 166–177
2016
Later among the works it cites.
S. Zhou, C. Chelmis, and V. K. Prasanna, “High-throughput and energy-efficient graph processing on fpga,” in Proceedings of IEEE Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM) , 2016, pp. 103–110
2016
Later among the works it cites.
T. Oguntebi and K. Olukotun, “Graphops: A dataflow library for graph analytics acceleration,” in Proceedings of International Symposium on Field-Programmable Gate Arrays (FPGA) , 2016, pp. 111–117
2016
Later among the works it cites.
G. Dai, T. Huang, Y. Chi, N. Xu, Y. Wang, and H. Yang, “Foregraph: Exploring large-scale graph processing on multi-fpga architecture,” in Proceedings of International Symposium on Field-Programmable Gate Arrays (FPGA) , 2017, pp. 217–226
2017
Later among the works it cites.
L. Nai, R. Hadidi, J. Sim, H. Kim, P. Kumar, and H. Kim, “Graphpim: Enabling instruction-level pim offloading in graph computing frameworks,” in Proceedings of IEEE International Symposium on High Performance Computer Architecture (HPCA) , 2017, pp. 457–468
2017
Later among the works it cites.
L. Ma, Z. Yang, H. Chen, J. Xue, and Y. Dai, “Garaph: Efficient gpu-accelerated graph processing on a single machine with balanced replication,” in Proceedings of USENIX Annual Technical Conference (ATC) , 2017, pp. 195–207
2017
Later among the works it cites.
D. Tim, “The university of florida sparse matrix collection,” https://sparse.tamu.edu/, 2018
2018
Closest in time.
G. . Origanization, “Graph 500 benchmark,” http://graph500.org/, 2018
2018
Closest in time.