乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T04:18:05Z","timestamp":1728447485784},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10766-022-00740-7","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T13:04:54Z","timestamp":1668517494000},"page":"515-561","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scaling the Maximum Flow Computation on GPUs"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4302-3256","authenticated-orcid":false,"given":"Jash","family":"Khatri","sequence":"first","affiliation":[]},{"given":"Arihant","family":"Samar","sequence":"additional","affiliation":[]},{"given":"Bikash","family":"Behera","sequence":"additional","affiliation":[]},{"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"740_CR1","unstructured":"Bader, D., Sachdeva, V.: A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic. ISCA PDCS, p. 8, 01 (2005)"},{"key":"740_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, R.J., Setubal, J.C.: On the parallel implementation of Goldberg\u2019s maximum flow algorithm. In: Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA\u201992, pp. 168\u2013177, New York, NY, USA (1992). Association for Computing Machinery","DOI":"10.1145\/140901.140919"},{"key":"740_CR3","first-page":"1277","volume":"11","author":"Yefim Dinitz","year":"1970","unstructured":"Dinitz, Yefim: Algorithm for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11, 1277\u20131280 (1970)","journal-title":"Sov. Math. Dokl."},{"key":"740_CR4","first-page":"434","volume":"15","author":"Alexander Karzanov","year":"1974","unstructured":"Karzanov, Alexander: Determining the maximal flow in a network by the method of preflows. Doklady Math. 15, 434\u2013437 (1974)","journal-title":"Doklady Math."},{"key":"740_CR5","doi-asserted-by":"crossref","unstructured":"He, Z., Hong, B.: Dynamically tuned push-relabel algorithm for the maximum flow problem on cpu-gpu-hybrid platforms. In: 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS), pp. 1\u201310 (2010)","DOI":"10.1109\/IPDPS.2010.5470401"},{"issue":"2","key":"740_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"Jack Edmonds","year":"1972","unstructured":"Edmonds, Jack, Karp, Richard M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"740_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, Andrew V.: Recent developments in maximum flow algorithms (invited lecture). In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, SWAT\u201998, pp. 1\u201310. Springer, Berlin, Heidelberg (1998)","DOI":"10.1007\/BFb0054350"},{"issue":"4","key":"740_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"Andrew V Goldberg","year":"1988","unstructured":"Goldberg, Andrew V., Tarjan, Robert E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"740_CR9","unstructured":"Hussein, M., Varshney, A., Davis, L.: On implementing graph cuts on cuda. First Workshop on General Purpose Processing on Graphics Processing Units, pp. 10, 10 (2009)"},{"key":"740_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC\u201990, pp. 352\u2013358, New York, NY, USA (1990). Association for Computing Machinery","DOI":"10.1145\/100216.100262"},{"issue":"8","key":"740_CR11","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.1145\/3016078.2851145","volume":"51","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., Owens, J.D.: Gunrock: a high-performance graph processing library on the gpu. SIGPLAN Not. 51(8), 2016 (2016)","journal-title":"SIGPLAN Not."},{"key":"740_CR12","doi-asserted-by":"crossref","unstructured":"Luo, L., Wong, M., Hwu, W.: An effective gpu implementation of breadth-first search. In: Proceedings of the 47th Design Automation Conference, DAC\u201910, New York, NY, USA, pp. 52\u201355 (2010). Association for Computing Machinery","DOI":"10.1145\/1837274.1837289"},{"key":"740_CR13","unstructured":"Bader, D.A., Madduri, K.: Gtgraph : A synthetic graph generator suite. http:\/\/www.cse.psu.edu\/~madduri\/software\/GTgraph (2006)"},{"key":"740_CR14","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/012","volume-title":"Network Flows and Matching: First DIMACS Implementation Challenge","author":"David S Johnson","year":"1993","unstructured":"Johnson, David S., McGeoch, Catherine C.: Network Flows and Matching: First DIMACS Implementation Challenge. American Mathematical Society, USA (1993)"},{"key":"740_CR15","volume-title":"Introduction to Algorithms","author":"Thomas H Cormen","year":"2009","unstructured":"Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., Stein, Clifford: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"740_CR16","unstructured":"Konect. http:\/\/konect.cc\/networks\/"},{"volume-title":"Flows in Networks","year":"2010","author":"DR Ford","key":"740_CR17","unstructured":"Ford, D.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (2010)"},{"key":"740_CR18","doi-asserted-by":"crossref","unstructured":"Vineet, V., Narayanan, P.J.: Cuda cuts: Fast graph cuts on the gpu. In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"740_CR19","doi-asserted-by":"crossref","unstructured":"Hong, B.: A lock-free multi-threaded algorithm for the maximum flow problem. In: 2008 IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20138 (2008)","DOI":"10.1109\/IPDPS.2008.4536352"},{"issue":"4","key":"740_CR20","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.1145\/2893356","volume":"48","author":"Sparsh Mittal","year":"2016","unstructured":"Mittal, Sparsh: A survey of techniques for approximate computing. ACM Comput. Surv. 48(4), 2016 (2016)","journal-title":"ACM Comput. Surv."},{"key":"740_CR21","doi-asserted-by":"crossref","unstructured":"Besta, M., Weber, S., Gianinazzi, L., Gerstenberger, R., Ivanov, A., Oltchik, Y., Hoefler, T.: Slim graph: Practical lossy graph compression for approximate graph processing, storage, and analytics. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC\u201919, New York, NY, USA (2019). Association for Computing Machinery","DOI":"10.1145\/3295500.3356182"},{"key":"740_CR22","doi-asserted-by":"crossref","unstructured":"Singh, S., Nasre, R.: Graffix: Efficient graph processing with a tinge of gpu-specific approximations. In: 49th International Conference on Parallel Processing - ICPP, ICPP\u201920, New York, NY, USA (2020). Association for Computing Machinery","DOI":"10.1145\/3404397.3404406"},{"key":"740_CR23","doi-asserted-by":"crossref","unstructured":"Singh, S., Nasre, R.: Optimizing graph processing on gpus using approximate computing: Poster. In: Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, PPoPP\u201919, pp. 395\u2013396, New York, NY, USA (2019). Association for Computing Machinery","DOI":"10.1145\/3293883.3295736"},{"key":"740_CR24","unstructured":"Princeton cos 226 course. https:\/\/www.cs.princeton.edu\/courses\/archive\/spr03\/cs226\/assignments\/baseball.html"},{"key":"740_CR25","unstructured":"Kaggle. https:\/\/www.kaggle.com"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-022-00740-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10766-022-00740-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-022-00740-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T06:53:41Z","timestamp":1728370421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10766-022-00740-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":25,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["740"],"URL":"https:\/\/doi.org\/10.1007\/s10766-022-00740-7","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"16 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}