Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2017 (2017), Article ID 1496104, 9 pages
https://doi.org/10.1155/2017/1496104
Research Article

Scalable Parallel Distributed Coprocessor System for Graph Searching Problems with Massive Data

School of Computer, National University of Defense Technology, Deya Road No. 109, Kaifu District, Changsha, Hunan 410073, China

Correspondence should be addressed to Wanrong Huang

Received 2 May 2017; Accepted 20 November 2017; Published 19 December 2017

Academic Editor: José María Álvarez-Rodríguez

Copyright © 2017 Wanrong Huang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. Demetrescui, A. Goldberg, and D. Johnson, “The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Proceedings.dimacs Book.ams,” in Proceedings of the The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Proceedings.dimacs Book.ams, p. 4, 2006.
  2. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 2, Article ID 026113, pp. 1–26113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Bu, Y. Zhao, L. Cai et al., “Topological structure analysis of the protein-protein interaction network in budding yeast,” Nucleic Acids Research, vol. 31, no. 9, pp. 2443–2450, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. B. Betkaoui, Y. Wang, D. B. Thomas, and W. Luk, “A reconfigurable computing approach for efficient and scalable parallel graph exploration,” in Proceedings of the 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors, ASAP 2012, pp. 8–15, Netherlands, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. J. J. Tithi, D. Matani, G. Menghani, and R. A. Chowdhury, “Avoiding locks and atomic instructions in shared-memory parallel BFS using optimistic parallelization,” in Proceedings of the 2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013, pp. 1628–1637, USA, May 2013. View at Publisher · View at Google Scholar · View at Scopus
  6. C. Chen, S. Koliai, and G. Gao, “Exploitation of locality for energy efficiency for breadth first search in fine-grain execution models,” Tsinghua Science and Technology, vol. 18, no. 6, Article ID 6678909, pp. 636–646, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Putnam, A. M. Caulfield, E. S. Chung et al., “A reconfigurable fabric for accelerating large-scale datacenter services,” in Proceedings of the ACM/IEEE 41st International Symposium on Computer Architecture (ISCA '14), pp. 13–24, IEEE, Minneapolis, Minn, USA, June 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. O. G. Attia, T. Johnson, K. Townsend, P. Jones, and J. Zambreno, “CyGraph: A reconfigurable architecture for parallel breadth-first search,” in Proceedings of the 28th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2014, pp. 228–235, usa, May 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Hong, T. Oguntebi, and K. Olukotun, “Efficient parallel graph exploration on multi-core CPU and GPU,” in Proceedings of the 20th International Conference on Parallel Architectures and Compilation Techniques, PACT 2011, pp. 78–88, USA, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. R. Pearce, M. Gokhale, and N. M. Amato, “Scaling techniques for massive scale-free graphs in distributed (external) memory,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013, pp. 825–836, USA, May 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. Umuroglu, D. Morrison, and M. Jahre, “Hybrid breadth-first search on a single-chip FPGA-CPU heterogeneous platform,” in Proceedings of the 25th International Conference on Field Programmable Logic and Applications, FPL 2015, UK, September 2015. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Anghel, G. Rodriguez, and B. Prisacari, “The importance and characteristics of communication in high performance data analytics,” in Proceedings of the 2014 IEEE International Symposium on Workload Characterization, IISWC 2014, pp. 80-81, USA, October 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Amer, H. Lu, P. Balaji, and S. Matsuoka, “Characterizing MPI and hybrid MPI+threads applications at scale: Case study with BFS,” in Proceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, CCGrid 2015, pp. 1075–1083, China, May 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. M. Anderson, “Better benchmarking for supercomputers: The usual yardstick is not a good metric,” IEEE Spectrum, vol. 48, no. 1, pp. 12–14, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. A. D. Bader, J. Berry, S. Kahan, and R. Murphy, “The graph 500 list,” 2010, http://graph500.org.list.
  16. R. Berrendorf and M. Makulla, “Level-synchronous parallel breadthfirst search algorithms for multicore and multiprocessor systems,” in Proceedings of the the Sixth Intl. Conf. on Future Computational Technologies and Applications, vol. 26, 2014.
  17. M. Ceriani, G. Palermo, S. Secchi, A. Tumeo, and O. Villa, “Exploring manycore multinode systems for irregular applications with FPGA prototyping,” in Proceedings of the 21st Annual International IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2013, p. 238, USA, April 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. V. Agarwal, F. Petrini, D. Pasetto, and D. A. Bader, “Scalable graph exploration on multicore processors,” in Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2010, USA, November 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Bisson, M. Bernaschi, and E. Mastrostefano, “Parallel distributed breadth first search on the Kepler architecture,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 7, pp. 2091–2102, 2015. View at Publisher · View at Google Scholar
  20. U. A. Acar, A. Chargueraud, and M. Rainey, Fast parallel graph-search with splittable and catenable frontiers, Inria, 2015.
  21. S. Beamer, K. Asanović, and D. Patterson, “Direction-optimizing breadth-first search,” Scientific Programming, vol. 21, no. 3-4, pp. 137–148, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Yasui, K. Fujisawa, and K. Goto, “NUMA-optimized parallel breadth-first search on multicore single-node system,” in Proceedings of the 2013 IEEE International Conference on Big Data, Big Data 2013, pp. 394–402, USA, October 2013. View at Publisher · View at Google Scholar · View at Scopus