{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:14Z","timestamp":1750306574017,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T00:00:00Z","timestamp":1417564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2014,12,3]]},"abstract":"<jats:p>The graph analysis has been applied in various fields related to big-data processing and actively researched in recent years. For processing a larger scale of graph, parallel computing with multi-GPU system is paid attention as an economical solution. Here, an efficient parallel method is proposed to solve a typical graph analysis, Breadth First Search (BFS) for multi-GPU systems. Our target system is GPU-BOX, a prototype of multi-GPU system using ExpEther which is a virtualization technology based on PCI Express and Ethernet. Although many vertices between GPUs must be exchanged to run BFS on multi-GPU system, GPU-BOX provides only small communication performance because of using Ethernet. Our parallel algorithm for BFS is designed so as to reduce the traffic between GPUs as possible. The proposed method reduced 30-40% traffic between GPUs and improved the traditional parallel method by 10%.<\/jats:p>","DOI":"10.1145\/2693714.2693729","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T16:17:14Z","timestamp":1418055434000},"page":"81-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Accelerating Breadth First Search on GPU-BOX"],"prefix":"10.1145","volume":"42","author":[{"given":"Takuji","family":"Mitsuishi","sequence":"first","affiliation":[{"name":"Keio University, Yokohama,, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shimpei","family":"Nomura","sequence":"additional","affiliation":[{"name":"Keio University, Yokohama,, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Suzuki","sequence":"additional","affiliation":[{"name":"NEC Corporation, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuki","family":"Hayashi","sequence":"additional","affiliation":[{"name":"NEC Corporation, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Kan","sequence":"additional","affiliation":[{"name":"NEC Corporation, Kanagawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideharu","family":"Amano","sequence":"additional","affiliation":[{"name":"Keio University, Yokohama,, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"CUB library. http:\/\/nvlabs.github.io\/cub\/index.html  CUB library. http:\/\/nvlabs.github.io\/cub\/index.html"},{"key":"e_1_2_1_2_1","unstructured":"Graph 500. http:\/\/www.graph500.org\/  Graph 500. http:\/\/www.graph500.org\/"},{"key":"e_1_2_1_3_1","unstructured":"Thrust library. http:\/\/thrust.github.io\/  Thrust library. http:\/\/thrust.github.io\/"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2006.34"},{"key":"e_1_2_1_6_1","volume-title":"Multi-gpu programming","author":"Barnes L.","year":"2013","unstructured":"L. Barnes . Multi-gpu programming , 2013 . http:\/\/ondemand.gputechconf.com\/gtc\/2013\/presentations\/S3465- Multi-GPU-Programming .pdf. L. Barnes. Multi-gpu programming, 2013. http:\/\/ondemand.gputechconf.com\/gtc\/2013\/presentations\/S3465- Multi-GPU-Programming.pdf."},{"key":"e_1_2_1_7_1","unstructured":"D. Chakrabarti Y. Zhan and C. Faloutsos. R-mat: A recursive model for graph mining. In Computer Science Department. Paper 541.  D. Chakrabarti Y. Zhan and C. Faloutsos. R-mat: A recursive model for graph mining. In Computer Science Department. Paper 541."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782174.1782200"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145832"},{"key":"e_1_2_1_12_1","unstructured":"NEC Corporation. http:\/\/www.nec.co.jp.  NEC Corporation. http:\/\/www.nec.co.jp."},{"key":"e_1_2_1_13_1","volume-title":"International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'12","author":"Nomura S.","year":"2012","unstructured":"S. Nomura , T. Nakahama , J. Higuchi , J. Suzuki , T. Yoshikawa , and H. Amano . The multi-gpu system with expether . In International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'12 , July 2012 . S. Nomura, T. Nakahama, J. Higuchi, J. Suzuki, T. Yoshikawa, and H. Amano. The multi-gpu system with expether. In International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'12, July 2012."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2006.12"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2011.6114175"}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2693714.2693729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2693714.2693729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:31Z","timestamp":1750227211000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2693714.2693729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,3]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12,3]]}},"alternative-id":["10.1145\/2693714.2693729"],"URL":"https:\/\/doi.org\/10.1145\/2693714.2693729","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2014,12,3]]},"assertion":[{"value":"2014-12-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}