{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:10:06Z","timestamp":1750194606868,"version":"3.41.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1318103","CCF-1524852"],"award-info":[{"award-number":["CCF-1318103","CCF-1524852"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10766-017-0499-9","type":"journal-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T07:06:20Z","timestamp":1491375980000},"page":"313-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Software Speculation on Caching DSMs"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0857-6357","authenticated-orcid":false,"given":"Sai Charan","family":"Koduru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keval","family":"Vora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,4]]},"reference":[{"issue":"1","key":"499_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/273011.273014","volume":"16","author":"HE Bal","year":"1998","unstructured":"Bal, H.E., Bhoedjang, R., Hofman, R., Jacobs, C., Langendoen, K., R\u00fchl, T., Kaashoek, M.F.: Performance evaluation of the Orca shared-object system. ACM Trans. Comput. Syst. (TOCS) 16(1), 1\u201340 (1998)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"8","key":"499_CR2","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1109\/TPDS.2011.23","volume":"22","author":"A Dash","year":"2011","unstructured":"Dash, A., Demsky, B.: Integrating caching and prefetching mechanisms in a distributed transactional memory. IEEE Trans. Parallel Distrib. Syst. 22(8), 1284\u20131298 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"499_CR3","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"499_CR4","doi-asserted-by":"crossref","unstructured":"Ding, C., Shen, X., Kelsey, K., Tice, C., Huang, R., Zhang, C.: Software behavior oriented parallelization. In: ACM SIGPlan Notices, vol.\u00a042, pp. 223\u2013234. ACM, New York, NY, USA (2007)","DOI":"10.1145\/1273442.1250760"},{"key":"499_CR5","doi-asserted-by":"crossref","unstructured":"Feng, M., Gupta, R., Hu, Y.: SpiceC: scalable parallelism via implicit copying and explicit commit. In: ACM SIGPlan Notices, vol.\u00a046, pp. 69\u201380. ACM, New York, NY, USA (2011)","DOI":"10.1145\/2038037.1941564"},{"key":"499_CR6","unstructured":"Fernandes, J.: Speculative execution on distributed and replicated software transactional memory systems URL http:\/\/www.gsd.inesc-id.pt\/~ler\/reports\/joaofernandesea.pdf"},{"key":"499_CR7","doi-asserted-by":"crossref","unstructured":"Fu, H., Zhu, Y., Yu, W.: A case study of mapreduce speculation for failure recovery. In: Proceedings of the 2015 International Workshop on Data-Intensive Scalable Computing Systems, p.\u00a07. ACM (2015)","DOI":"10.1145\/2831244.2831245"},{"key":"499_CR8","unstructured":"Jacobs, B., Bai, T., Ding, C.: The first workshop on advances in message passing. (co-located with PLDI 2010), Toronto, Canada, June 6, 2010 http:\/\/www.cs.rochester.edu\/u\/cding\/amp\/papers\/pos\/Distributed%20Speculative%20Program%20Parallelization.pdf (2010)"},{"issue":"9","key":"499_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/TPDS.2005.110","volume":"16","author":"M Kistler","year":"2005","unstructured":"Kistler, M., Alvisi, L.: Improving the performance of software distributed shared memory with speculation. IEEE Trans. Parallel Distrib. Syst. 16(9), 885\u2013896 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"499_CR10","doi-asserted-by":"crossref","unstructured":"Kulkarni, M., Burtscher, M., Inkulu, R., Pingali, K., Cas\u00e7aval, C.: How much parallelism is there in irregular applications? In: ACM SIGPlan Notices, vol.\u00a044, pp. 3\u201314. ACM, New York, NY, USA (2009)","DOI":"10.1145\/1594835.1504181"},{"key":"499_CR11","unstructured":"Kunegis, J.: KONECT\u2014The Koblenz Network Collection. In: Proceedings of International Conference on World Wide Web Companion, pp. 1343\u20131350 (2013). URL http:\/\/userpages.uni-koblenz.de\/~kunegis\/paper\/kunegis-koblenz-network-collection.pdf"},{"key":"499_CR12","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"499_CR13","unstructured":"Low, Y., Gonzalez, J.E., Kyrola, A., Bickson, D., Guestrin, C.E., Hellerstein, J.: Graphlab: a new framework for parallel machine learning. Preprint arXiv:1408.2041 (2014)"},{"key":"499_CR14","unstructured":"Oancea, C.E., Selby, J.W., Giesbrecht, M., Watt, S.M.: Distributed models of thread level speculation. In: The 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA \u201805, vol.\u00a05, pp. 920\u2013927 (2005)"},{"key":"499_CR15","doi-asserted-by":"crossref","unstructured":"Palmieri, R., Quaglia, F., Romano, P.: Osare: Opportunistic speculation in actively replicated transactional systems. In: 30th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 59\u201364. IEEE (2011)","DOI":"10.1109\/SRDS.2011.16"},{"key":"499_CR16","doi-asserted-by":"crossref","unstructured":"Raghavachari, M., Rogers, A.: Understanding language support for irregular parallelism. In: Ito, T., Halstead, R., Queinnec, C. (eds.) Parallel Symbolic Languages and Systems: International Workshop PSLS\u201995 Beaune, France, October 2\u20134, 1995 Proceedings, pp. 174\u2013189. Springer, Berlin, Heidelberg (1996)","DOI":"10.1007\/BFb0023061"},{"key":"499_CR17","doi-asserted-by":"crossref","unstructured":"Rauchwerger, L., Amato, N.M., Padua, D.A.: Run-time methods for parallelizing partially parallel loops. In: Proceedings of the 9th international conference on Supercomputing, pp. 137\u2013146. ACM (1995)","DOI":"10.1145\/224538.224553"},{"issue":"2","key":"499_CR18","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/71.752782","volume":"10","author":"L Rauchwerger","year":"1999","unstructured":"Rauchwerger, L., Padua, D.A.: The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Trans. Parallel Distrib. Syst. 10(2), 160\u2013180 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"499_CR19","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/2544173.2509525","volume":"48","author":"K Ravichandran","year":"2013","unstructured":"Ravichandran, K., Pande, S.: Multiverse: efficiently supporting distributed high-level speculation. ACM SIGPlan Not. 48(10), 533\u2013552 (2013)","journal-title":"ACM SIGPlan Not."},{"issue":"1","key":"499_CR20","first-page":"2002","volume":"3","author":"P Rundberg","year":"2001","unstructured":"Rundberg, P., Stenstr\u00f6m, P.: An all-software thread-level data dependence speculation system for multiprocessors. J. Instr. Level Parallelism 3(1), 2002 (2001)","journal-title":"J. Instr. Level Parallelism"},{"key":"499_CR21","doi-asserted-by":"crossref","unstructured":"Scales, D.J., Gharachorloo, K.: Shasta: a system for supporting fine-grain shared memory across clusters. In: Eighth SIAM Conference on Parallel Processing for Scientific Computing, PPSC \u201897. Citeseer (1997)","DOI":"10.1145\/237090.237179"},{"key":"499_CR22","unstructured":"\u0162\u0103pu\u015f, C., Hickey, J.: Speculations: providing fault-tolerance and recoverability in distributed environments. In: Proceedings of the Second Conference on Hot Topics in System Dependability, pp. 10\u201310. USENIX Association (2006)"},{"key":"499_CR23","doi-asserted-by":"crossref","unstructured":"Vora, K., Koduru, S.C., Gupta, R.: ASPIRE: Exploiting Asynchronous Parallelism in Iterative Algorithms using a Relaxed Consistency Based DSM. In: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages and Applications, pp. 861\u2013878. ACM (2014)","DOI":"10.1145\/2714064.2660227"},{"key":"499_CR24","unstructured":"Yahoo Developer Network: Hadoop tutorial\u2014mapreduce fault tolerance. https:\/\/developer.yahoo.com\/hadoop\/tutorial\/module4.html"},{"key":"499_CR25","doi-asserted-by":"crossref","unstructured":"Zilles, C., Sohi, G.: Master\/slave speculative parallelization. In: Proceedings of the 35th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO-35), pp. 85\u201396. IEEE (2002)","DOI":"10.1109\/MICRO.2002.1176241"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-017-0499-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-017-0499-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-017-0499-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:07Z","timestamp":1750193227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-017-0499-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,4]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["499"],"URL":"https:\/\/doi.org\/10.1007\/s10766-017-0499-9","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2017,4,4]]},"assertion":[{"value":"19 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}