{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:02:44Z","timestamp":1729634564081,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/ipdpsw.2010.5470712","type":"proceedings-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T18:25:42Z","timestamp":1275071142000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Designing scalable many-core parallel algorithms for min graphs using CUDA"],"prefix":"10.1109","author":[{"family":"Quoc-Nam Tran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Combinatorial Optimization Networks and Matroids","year":"1976","author":"lawler","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.31"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1365490.1365500"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1145\/882262.882363","article-title":"Linear algebra operators for gpu implementation of numerical algorithms","volume":"22","author":"kr\u00fcger","year":"2003","journal-title":"ACM Transactions on Graphics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.24"},{"key":"ref15","article-title":"Gpu cluster for high performance computing","author":"fan","year":"2004","journal-title":"Proceedings of the 2004 ACM\/IEEE conference on Supercomputing SC'04 IEEE"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2010.230"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1152154.1152189"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2006.1639347"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77220-0_21"},{"article-title":"Optimizing all pairs shortest path algorithm using vector instructions","year":"2005","author":"han","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/996546.996553"},{"key":"ref7","article-title":"An efficient parallel algorithm for shortest paths in planar layered digraphs","author":"subramanian","year":"1993","journal-title":"Tech Rep"},{"key":"ref2","article-title":"All-pairs shortest-paths for large graphs on the gpu","author":"katz","year":"2008","journal-title":"Graphics Hardware"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1997.641265"},{"year":"2008","key":"ref9"}],"event":{"name":"Distributed Processing, Workshops and Phd Forum (IPDPSW 2010)","start":{"date-parts":[[2010,4,19]]},"location":"Atlanta, GA","end":{"date-parts":[[2010,4,23]]}},"container-title":["2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5465895\/5470678\/05470712.pdf?arnumber=5470712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T08:48:44Z","timestamp":1497862124000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5470712\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/ipdpsw.2010.5470712","relation":{},"subject":[],"published":{"date-parts":[[2010,4]]}}}