{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:48Z","timestamp":1772164068151,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T00:00:00Z","timestamp":1413331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1318103"],"award-info":[{"award-number":["CCF-1318103"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,10,15]]},"DOI":"10.1145\/2660193.2660227","type":"proceedings-article","created":{"date-parts":[[2014,10,21]],"date-time":"2014-10-21T08:59:05Z","timestamp":1413881945000},"page":"861-878","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["ASPIRE"],"prefix":"10.1145","author":[{"given":"Keval","family":"Vora","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"given":"Sai Charan","family":"Koduru","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,10,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Giraph. http:\/\/giraph.apache.org\/.  Apache Giraph. http:\/\/giraph.apache.org\/."},{"issue":"1","key":"e_1_3_2_1_2_1","first-page":"37","volume":"9","author":"Ahamad M.","year":"1995","unstructured":"M. Ahamad , G. Neiger , J.E. Burns , P. Kohli , and P.W. Hutto . Causal Memory: Definitions, Implementation and Programming. phDistributed Computing , 9 ( 1 ): 37 -- 49 , 1995 . M. Ahamad, G. Neiger, J.E. Burns, P. Kohli, and P.W. Hutto. Causal Memory: Definitions, Implementation and Programming. phDistributed Computing, 9 (1): 37--49, 1995.","journal-title":"Causal Memory: Definitions, Implementation and Programming. phDistributed Computing"},{"key":"e_1_3_2_1_3_1","first-page":"261","volume-title":"Software DSM Protocols That Adapt Between Single Writer and Multiple Writer. phHPCA","author":"Amza C.","year":"1997","unstructured":"C. Amza , A.L. Cox , W. Zwaenepoel , and S. Dwarkadas . Software DSM Protocols That Adapt Between Single Writer and Multiple Writer. phHPCA , pages 261 -- 271 , 1997 . C. Amza, A.L. Cox, W. Zwaenepoel, and S. Dwarkadas. Software DSM Protocols That Adapt Between Single Writer and Multiple Writer. phHPCA, pages 261--271, 1997."},{"key":"e_1_3_2_1_4_1","unstructured":"A. Bourchtein. Atmospheric models. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Bourchtein\/atmosmodl.html 2009.  A. Bourchtein. Atmospheric models. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Bourchtein\/atmosmodl.html 2009."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.126768"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322067"},{"key":"e_1_3_2_1_7_1","volume-title":"Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors. phTR","author":"Bershad B.N.","year":"1991","unstructured":"B.N. Bershad and M.J. Zekauskas . Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors. phTR , Carnegie Mellon University-CS- 91--170, 1991 . B.N. Bershad and M.J. Zekauskas. Midway: Shared Memory Parallel Programming with Entry Consistency for Distributed Memory Multiprocessors. phTR, Carnegie Mellon University-CS-91--170, 1991."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/121132.121159"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/210126.210127"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.55500"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781518"},{"key":"e_1_3_2_1_12_1","first-page":"1938","author":"Cheng Y-S.","year":"1934","unstructured":"Y-S. Cheng , M. Neely , and K. M. Chugg . Iterative Message Passing Algorithm for Bipartite Maximum Weighted Matching. In phIEEE International Symposium on Information Theory, pages 1934 -- 1938 . 2006. Y-S. Cheng, M. Neely, and K. M. Chugg. Iterative Message Passing Algorithm for Bipartite Maximum Weighted Matching. In phIEEE International Symposium on Information Theory, pages 1934--1938. 2006.","journal-title":"In phIEEE International Symposium on Information Theory, pages"},{"key":"e_1_3_2_1_13_1","first-page":"22","volume-title":"Solving the Straggler Problem with Bounded Staleness. phHotOS","author":"Cipar J.","year":"2013","unstructured":"J. Cipar , Q. Ho , J. K. Kim , S. Lee , G. R. Ganger , G. Gibson , K. Keeton , and E. Xing . Solving the Straggler Problem with Bounded Staleness. phHotOS , pages 22 -- 22 , 2013 . J. Cipar, Q. Ho, J. K. Kim, S. Lee, G. R. Ganger, G. Gibson, K. Keeton, and E. Xing. Solving the Straggler Problem with Bounded Staleness. phHotOS, pages 22--22, 2013."},{"key":"e_1_3_2_1_14_1","first-page":"199","volume-title":"Chaotic relaxation. In phLinear Algebra and Its Application","author":"Chazan W. L. M. D.","year":"1969","unstructured":"W. L. M. D. Chazan . Chaotic relaxation. In phLinear Algebra and Its Application , pages 2: 199 -- 222 , 1969 . W. L. M. D. Chazan. Chaotic relaxation. In phLinear Algebra and Its Application, pages 2:199--222, 1969."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_16_1","unstructured":"A. Dziekonski A. Lamecki and M. Mrozowski. High-order vector finite element method in EM. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Dziekonski\/dielFilterV3real.html 2011.  A. Dziekonski A. Lamecki and M. Mrozowski. High-order vector finite element method in EM. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Dziekonski\/dielFilterV3real.html 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250760"},{"key":"e_1_3_2_1_18_1","unstructured":"C. Janna and M. Ferronato. 3D model of a steel flange hexahedral finite elements. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Janna\/Flan\\_1565.html 2011.  C. Janna and M. Ferronato. 3D model of a steel flange hexahedral finite elements. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Janna\/Flan\\_1565.html 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/325164.325102"},{"key":"e_1_3_2_1_20_1","first-page":"17","volume-title":"PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. phOSDI","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. phOSDI , pages 17 -- 30 , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed Graph-parallel Computation on Natural Graphs. phOSDI, pages 17--30, 2012."},{"key":"e_1_3_2_1_21_1","volume-title":"CS Department","author":"Goodman J. R.","year":"1991","unstructured":"J. R. Goodman . phCache Consistency and Sequential Consistency. Univ. of Wisconsin-Madison , CS Department , 1991 . J. R. Goodman. phCache Consistency and Sequential Consistency. Univ. of Wisconsin-Madison, CS Department, 1991."},{"key":"e_1_3_2_1_22_1","first-page":"164","volume":"2","author":"Heddaya A.","year":"1993","unstructured":"A. Heddaya and H. Sinha . An overview of Mermera: A system and formalism for non-coherent distributed parallel memory. phHawaii International Conf. on System Sciences , vol. 2 , pages 164 -- 173 , 1993 . A. Heddaya and H. Sinha. An overview of Mermera: A system and formalism for non-coherent distributed parallel memory. phHawaii International Conf. on System Sciences, vol. 2, pages 164--173, 1993.","journal-title":"phHawaii International Conf. on System Sciences"},{"key":"e_1_3_2_1_23_1","volume-title":"Non-coherence and Local Consistency in Distributed Shared Memory for Parallel Computing. TR BU-CS-92-004","author":"Heddaya A.","year":"1992","unstructured":"A. Heddaya and H. Sinha . phCoherence , Non-coherence and Local Consistency in Distributed Shared Memory for Parallel Computing. TR BU-CS-92-004 , Boston Univ. , 1992 . A. Heddaya and H. Sinha. phCoherence, Non-coherence and Local Consistency in Distributed Shared Memory for Parallel Computing. TR BU-CS-92-004, Boston Univ., 1992."},{"key":"e_1_3_2_1_24_1","volume-title":"Boston Univ.","author":"Heddaya A.","year":"1993","unstructured":"A. Heddaya and H. Sinha . phAn Implementation of Mermera: A Shared Memory System that Mixes Coherence with Non-coherence. TR BUCS-TR-1993-006 , Boston Univ. , 1993 . A. Heddaya and H. Sinha. phAn Implementation of Mermera: A Shared Memory System that Mixes Coherence with Non-coherence. TR BUCS-TR-1993-006, Boston Univ., 1993."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep02980"},{"key":"e_1_3_2_1_26_1","first-page":"302","volume-title":"Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. phICDCS","author":"Hutto P. W.","year":"1990","unstructured":"P. W. Hutto and M. Ahamad . Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. phICDCS , pages 302 -- 309 , 1990 . P. W. Hutto and M. Ahamad. Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. phICDCS, pages 302--309, 1990."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/237502.237567"},{"key":"e_1_3_2_1_28_1","first-page":"198","volume":"3149","author":"Iosevich V.","year":"2004","unstructured":"V. Iosevich and A. Schuster . Distributed Shared Memory: To Relax or Not to Relax? In M. Danelutto, M. Vanneschi, and D. Laforenza, editors, phEuro-Par, phLNCS 3149 , pages 198 -- 205 , Springer, 2004 . V. Iosevich and A. Schuster. Distributed Shared Memory: To Relax or Not to Relax? In M. Danelutto, M. Vanneschi, and D. Laforenza, editors, phEuro-Par, phLNCS 3149, pages 198--205, Springer, 2004.","journal-title":"In M. Danelutto, M. Vanneschi, and D. Laforenza, editors, phEuro-Par, phLNCS"},{"key":"e_1_3_2_1_29_1","volume-title":"Inference of Beliefs on Billion-Scale Graphs. phKDD-LDMTA","author":"Kang U.","year":"2010","unstructured":"U. Kang , D. Horng , Inference of Beliefs on Billion-Scale Graphs. phKDD-LDMTA , 2010 . U. Kang, D. Horng, et al. Inference of Beliefs on Billion-Scale Graphs. phKDD-LDMTA, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/139669.139676"},{"key":"e_1_3_2_1_32_1","volume-title":"TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems. phWTEC.pages 10--10","author":"Keleher P.","year":"1994","unstructured":"P. Keleher , A. L. Cox , S. Dwarkadas , and W. Zwaenepoel . TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems. phWTEC.pages 10--10 , 1994 . P. Keleher, A. L. Cox, S. Dwarkadas, and W. Zwaenepoel. TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems. phWTEC.pages 10--10, 1994."},{"key":"e_1_3_2_1_33_1","volume-title":"Programming Large Dynamic Data Structures on a DSM Cluster of Multicores. phPGAS Programming Models","author":"Koduru SC.","year":"2013","unstructured":"SC. Koduru , M. Feng , and R. Gupta . Programming Large Dynamic Data Structures on a DSM Cluster of Multicores. phPGAS Programming Models , 2013 . SC. Koduru, M. Feng, and R. Gupta. Programming Large Dynamic Data Structures on a DSM Cluster of Multicores. phPGAS Programming Models, 2013."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082469.1082472"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/217838.217878"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_37_1","first-page":"31","volume-title":"Guestrin GraphChi: Large-scale Graph Computation on Just a PC. phOSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , C. Guestrin GraphChi: Large-scale Graph Computation on Just a PC. phOSDI , pages 31 -- 46 , 2012 . A. Kyrola, G. Blelloch, C. Guestrin GraphChi: Large-scale Graph Computation on Just a PC. phOSDI, pages 31--46, 2012."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/325164.325132"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/320384.320433"},{"key":"e_1_3_2_1_43_1","volume-title":"phPRAM: A Scalable Shared Memory","author":"Lipton R.","year":"1988","unstructured":"R. Lipton and J. Sandberg . phPRAM: A Scalable Shared Memory . Princeton University , Department of Computer Science, TR-180--88, 1988 . R. Lipton and J. Sandberg. phPRAM: A Scalable Shared Memory. Princeton University, Department of Computer Science, TR-180--88, 1988."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693483"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2009.12.019"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89740-8_20"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/160551.160553"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_51_1","first-page":"173","volume-title":"Adsmith: An Efficient Object-Based Distributed Shared Memory System on PVM. phInternational Symposium on Parallel Architectures, Algorithms, and Networks","author":"Liang W-Y.","year":"1996","unstructured":"W-Y. Liang , C-T. King , and F. Lai . Adsmith: An Efficient Object-Based Distributed Shared Memory System on PVM. phInternational Symposium on Parallel Architectures, Algorithms, and Networks , pages 173 -- 179 , 1996 . W-Y. Liang, C-T. King, and F. Lai. Adsmith: An Efficient Object-Based Distributed Shared Memory System on PVM. phInternational Symposium on Parallel Architectures, Algorithms, and Networks, pages 173--179, 1996."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.138"},{"key":"e_1_3_2_1_53_1","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web","author":"Page L.","year":"1999","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank Citation Ranking: Bringing Order to the Web . 1999 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. 1999."},{"key":"e_1_3_2_1_54_1","volume-title":"International Scientific Conference and International Workshop Present Day Trends of Innovations","author":"Takac L.","year":"2012","unstructured":"L. Takac and M. Zabovsky . Data analysis in public social networks . International Scientific Conference and International Workshop Present Day Trends of Innovations , 2012 . L. Takac and M. Zabovsky. Data analysis in public social networks. International Scientific Conference and International Workshop Present Day Trends of Innovations, 2012."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207148"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/263580.263643"},{"key":"e_1_3_2_1_57_1","volume-title":"Improving the Scalability of Shared Memory Systems through Relaxed Consistency. phWC3","author":"Schulz M.","year":"2002","unstructured":"M. Schulz , J. Tao , and W. Karl . Improving the Scalability of Shared Memory Systems through Relaxed Consistency. phWC3 , 2002 . M. Schulz, J. Tao, and W. Karl. Improving the Scalability of Shared Memory Systems through Relaxed Consistency. phWC3, 2002."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/305138.305187"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258513"},{"key":"e_1_3_2_1_61_1","volume-title":"http:\/\/snap.stanford.edu\/data\/index.html","author":"Leskovec J.","year":"2011","unstructured":"J. Leskovec . Stanford Large Network Dataset Collection . http:\/\/snap.stanford.edu\/data\/index.html , 2011 . J. Leskovec. Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data\/index.html, 2011."},{"key":"e_1_3_2_1_62_1","unstructured":"C. Sinclair. 3-D spectral-element elastic wave modeling in freq. domain. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Sinclair\/3Dspectralwave.html 2007.  C. Sinclair. 3-D spectral-element elastic wave modeling in freq. domain. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Sinclair\/3Dspectralwave.html 2007."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_3_2_1_66_1","volume-title":"Asynchronous Large-Scale Graph Processing Made Easy. phCIDR","author":"Wang G.","year":"2013","unstructured":"G. Wang , W. Xie , A. Demers , and J. Gehrke . Asynchronous Large-Scale Graph Processing Made Easy. phCIDR , 2013 . G. Wang, W. Xie, A. Demers, and J. Gehrke. Asynchronous Large-Scale Graph Processing Made Easy. phCIDR, 2013."},{"key":"e_1_3_2_1_67_1","first-page":"117","volume":"26","author":"Yu B.-H.","year":"2004","unstructured":"B.-H. Yu , Z. Huang , S. Cranefield , and M. Purvis . Homeless and Home-based Lazy Release Consistency Protocols on Distributed Shared Memory. phAustralasian Conf. on Computer Science- Vol 26 , pages 117 -- 123 , 2004 . B.-H. Yu, Z. Huang, S. Cranefield, and M. Purvis. Homeless and Home-based Lazy Release Consistency Protocols on Distributed Shared Memory. phAustralasian Conf. on Computer Science-Vol 26, pages 117--123, 2004.","journal-title":"phAustralasian Conf. on Computer Science-"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/263764.263788"},{"key":"e_1_3_2_1_69_1","volume-title":"Learning from Labeled and Unlabeled Data with Label Propagation","author":"Zhu X.","year":"2002","unstructured":"X. Zhu and Z. Ghahramani . Learning from Labeled and Unlabeled Data with Label Propagation . Technical Report Carnegie Mellon University-CALD-02--107,Carnegie Mellon University , 2002 . X. Zhu and Z. Ghahramani. Learning from Labeled and Unlabeled Data with Label Propagation. Technical Report Carnegie Mellon University-CALD-02--107,Carnegie Mellon University, 2002."}],"event":{"name":"SPLASH '14: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Portland Oregon USA","acronym":"SPLASH '14","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"]},"container-title":["Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660193.2660227","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2660193.2660227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:14:43Z","timestamp":1750263283000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2660193.2660227"}},"subtitle":["exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSM"],"short-title":[],"issued":{"date-parts":[[2014,10,15]]},"references-count":69,"alternative-id":["10.1145\/2660193.2660227","10.1145\/2660193"],"URL":"https:\/\/doi.org\/10.1145\/2660193.2660227","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2714064.2660227","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,10,15]]},"assertion":[{"value":"2014-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}