{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:43Z","timestamp":1763468143526,"version":"3.41.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"2s","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0811397, 0835652, 0905244, 1036241"],"award-info":[{"award-number":["0811397, 0835652, 0905244, 1036241"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:p>We present QuickStep, a novel system for parallelizing sequential programs. Unlike standard parallelizing compilers (which are designed to preserve the semantics of the original sequential computation), QuickStep is instead designed to generate (potentially nondeterministic) parallel programs that produce acceptably accurate results acceptably often. The freedom to generate parallel programs whose output may differ (within statistical accuracy bounds) from the output of the sequential program enables a dramatic simplification of the compiler, a dramatic increase in the range of applications that it can parallelize, and a significant expansion in the range of parallel programs that it can legally generate.<\/jats:p>\n          <jats:p>Results from our benchmark set of applications show that QuickStep can automatically generate acceptably accurate and efficient parallel programs---the automatically generated parallel versions of five of our six benchmark applications run between 5.0 and 7.8 times faster on eight cores than the original sequential versions. These applications and parallelizations contain features (such as the use of modern object-oriented programming constructs or desirable parallelizations with infrequent but acceptable data races) that place them inherently beyond the reach of standard approaches.<\/jats:p>","DOI":"10.1145\/2465787.2465790","type":"journal-article","created":{"date-parts":[[2013,6,5]],"date-time":"2013-06-05T12:09:34Z","timestamp":1370434174000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Parallelizing Sequential Programs with Statistical Accuracy Tests"],"prefix":"10.1145","volume":"12","author":[{"given":"Sasa","family":"Misailovic","sequence":"first","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deokhwan","family":"Kim","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Rinard","sequence":"additional","affiliation":[{"name":"MIT"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,5]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1508244.1508273"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1038\/324446a0"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1145\/1133981.1134000"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1109\/71.180621"},{"key":"e_1_2_1_5_1","article-title":"Effective automatic parallelization with","author":"Blume W.","year":"1995","journal-title":"Polaris. Int. J. Parallel Program."},{"volume-title":"Proceedings of SEDMS.","author":"Bolosky W.","key":"e_1_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1109\/MICRO.2007.35"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1002\/sca.4950170406"},{"volume-title":"Proceedings of ECOOP.","author":"Carbin M.","key":"e_1_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1145\/2025113.2025131"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_1","DOI":"10.1109\/99.660313"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/1062455.1062499"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1145\/1146238.1146266"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1145\/1250734.1250760"},{"doi-asserted-by":"crossref","unstructured":"Ding Y.\n     and \n      \n      \n      Li Z\n      \n  \n  . \n  2003\n  . An adaptive scheme for dynamic parallelization. In Proceedings of LCPC H. Dietz Ed. Lecture Notes in Computer Science vol. \n  2624\n  . \n  Springer-Verlag 274--289.   Ding Y. and Li Z. 2003. An adaptive scheme for dynamic parallelization. In Proceedings of LCPC H. Dietz Ed. Lecture Notes in Computer Science vol. 2624. Springer-Verlag 274--289.","key":"e_1_2_1_15_1","DOI":"10.1007\/3-540-35767-X_18"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1145\/122759.122767"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1109\/2.546613"},{"volume-title":"Proceedings of the 60th Annual International Meeting, Society of Exploration and Geophysics, Extended Abstracts.","author":"Harris J.","key":"e_1_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1145\/165123.165164"},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_1","DOI":"10.1080\/01621459.1963.10500830"},{"unstructured":"Hoffmann H. Misailovic S. Sidiroglou S. Agarwal A. and Rinard M. 2009. Using code perforation to improve performance reduce energy consumption and respond to failures. Tech. rep. MIT-CSAIL-TR-2009-042 MIT Cambridge MA.  Hoffmann H. Misailovic S. Sidiroglou S. Agarwal A. and Rinard M. 2009. Using code perforation to improve performance reduce energy consumption and respond to failures. Tech. rep. MIT-CSAIL-TR-2009-042 MIT Cambridge MA.","key":"e_1_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1145\/1993498.1993544"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1145\/1993498.1993561"},{"doi-asserted-by":"crossref","unstructured":"Kirsch C. Payer H. R\u00f6ck H. and Sokolova A. 2011. Performance scalability and semantics of concurrent FIFO queues. Tech. rep. 2011-03 Department of Computer Sciences University of Salzburg.  Kirsch C. Payer H. R\u00f6ck H. and Sokolova A. 2011. Performance scalability and semantics of concurrent FIFO queues. Tech. rep. 2011-03 Department of Computer Sciences University of Salzburg.","key":"e_1_2_1_24_1","DOI":"10.1145\/1993806.1993869"},{"volume-title":"Proceedings of CGO.","author":"Lattner C.","key":"e_1_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_26_1","DOI":"10.1109\/IPDPS.2009.5160991"},{"volume-title":"Proceedings of IPDPS.","author":"Meng J.","key":"e_1_2_1_27_1"},{"unstructured":"Misailovic S. Kim D. and Rinard M. 2010a. Automatic parallelization with statistical accuracy bounds. Tech. rep. MIT-CSAIL-TR-2010-007 MIT Cambridge MA.  Misailovic S. Kim D. and Rinard M. 2010a. Automatic parallelization with statistical accuracy bounds. Tech. rep. MIT-CSAIL-TR-2010-007 MIT Cambridge MA.","key":"e_1_2_1_28_1"},{"unstructured":"Misailovic S. Kim D. and Rinard M. 2010b. Parallelizing sequential programs with statistical accuracy tests. Tech. rep. MIT-CSAIL-TR-2010-038 MIT Cambridge MA.  Misailovic S. Kim D. and Rinard M. 2010b. Parallelizing sequential programs with statistical accuracy tests. Tech. rep. MIT-CSAIL-TR-2010-038 MIT Cambridge MA.","key":"e_1_2_1_29_1"},{"unstructured":"Misailovic S. Roy D. and Rinard M. 2011a. Probabilistic and statistical analysis of perforated patterns. Tech. rep. MIT-CSAIL-TR-2011-003 MIT Cambridge MA.  Misailovic S. Roy D. and Rinard M. 2011a. Probabilistic and statistical analysis of perforated patterns. Tech. rep. MIT-CSAIL-TR-2011-003 MIT Cambridge MA.","key":"e_1_2_1_30_1"},{"volume-title":"Proceedings of SAS.","author":"Misailovic S.","key":"e_1_2_1_31_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1145\/1806799.1806808"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_1","DOI":"10.1145\/1296907.1296912"},{"doi-asserted-by":"crossref","unstructured":"Nieh J. and Levoy M. 1992. Volume rendering on scalable shared-memory MIMD architectures. Tech. rep. CSL-TR-92-537 Computer Systems Laboratory Stanford Univ. Stanford CA.  Nieh J. and Levoy M. 1992. Volume rendering on scalable shared-memory MIMD architectures. Tech. rep. CSL-TR-92-537 Computer Systems Laboratory Stanford Univ. Stanford CA.","key":"e_1_2_1_34_1","DOI":"10.1145\/147130.147141"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1145\/1629575.1629585"},{"doi-asserted-by":"publisher","key":"e_1_2_1_36_1","DOI":"10.1145\/1065944.1065964"},{"doi-asserted-by":"publisher","key":"e_1_2_1_37_1","DOI":"10.1145\/207110.207148"},{"doi-asserted-by":"publisher","key":"e_1_2_1_38_1","DOI":"10.1145\/224538.224553"},{"unstructured":"Rinard M. 1994. The design implementation and evaluation of Jade a portable implicitly parallel programming language. Ph.D. dissertation Dept. of Computer Science Stanford Univ. Stanford CA.   Rinard M. 1994. The design implementation and evaluation of Jade a portable implicitly parallel programming language. Ph.D. dissertation Dept. of Computer Science Stanford Univ. Stanford CA.","key":"e_1_2_1_39_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_40_1","DOI":"10.1145\/949344.949402"},{"doi-asserted-by":"publisher","key":"e_1_2_1_41_1","DOI":"10.1145\/1183401.1183447"},{"doi-asserted-by":"publisher","key":"e_1_2_1_42_1","DOI":"10.1145\/1297027.1297055"},{"doi-asserted-by":"publisher","key":"e_1_2_1_43_1","DOI":"10.1145\/267959.269969"},{"volume-title":"Proceedings of OSDI.","author":"Rinard M.","key":"e_1_2_1_44_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_45_1","DOI":"10.1145\/1869459.1869525"},{"volume-title":"Proceedings of HiPEAC Industrial Workshop.","year":"2008","author":"Rul S.","key":"e_1_2_1_46_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_47_1","DOI":"10.1145\/1274971.1275008"},{"doi-asserted-by":"publisher","key":"e_1_2_1_48_1","DOI":"10.1145\/2025113.2025133"},{"doi-asserted-by":"publisher","key":"e_1_2_1_49_1","DOI":"10.1145\/62678.62682"},{"doi-asserted-by":"publisher","key":"e_1_2_1_50_1","DOI":"10.1145\/1542476.1542496"},{"doi-asserted-by":"publisher","key":"e_1_2_1_51_1","DOI":"10.1145\/1993498.1993555"},{"unstructured":"Wald A. 1947. Sequential Analysis. John Wiley and Sons.  Wald A. 1947. Sequential Analysis . John Wiley and Sons.","key":"e_1_2_1_52_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_53_1","DOI":"10.1145\/223982.223990"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465787.2465790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465787.2465790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:16Z","timestamp":1750235956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465787.2465790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":53,"journal-issue":{"issue":"2s","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["10.1145\/2465787.2465790"],"URL":"https:\/\/doi.org\/10.1145\/2465787.2465790","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"2011-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}