{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:11Z","timestamp":1772164031958,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T00:00:00Z","timestamp":1319241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,22]]},"DOI":"10.1145\/2048066.2048109","type":"proceedings-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T08:23:06Z","timestamp":1319530986000},"page":"537-554","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficiently speeding up sequential computation through the n-way programming model"],"prefix":"10.1145","author":[{"given":"Romain E.","family":"Cledat","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tushar","family":"Kumar","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Pande","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2190025.2190056"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640096"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.009"},{"key":"e_1_3_2_1_5_1","unstructured":"CLANG\n  : A C family frontend for LLVM. http:\/\/clang.llvm.org\/ 2010.  CLANG: A C family frontend for LLVM. http:\/\/clang.llvm.org\/ 2010."},{"key":"e_1_3_2_1_6_1","volume-title":"USENIX","author":"Cledat R.","year":"2009","unstructured":"R. Cledat , T. Kumar , J. Sreeram , and S. Pande . Opportunistic computing: A new paradigm for scalable realism on many cores. In HotPar 2009: 1st USENIX Workshop on Hot Topics in Parallelism . USENIX , 2009 . R. Cledat, T. Kumar, J. Sreeram, and S. Pande. Opportunistic computing: A new paradigm for scalable realism on many cores. In HotPar 2009: 1st USENIX Workshop on Hot Topics in Parallelism. USENIX, 2009."},{"key":"e_1_3_2_1_7_1","volume-title":"PESPMA 2010","author":"Cledat R.","year":"2010","unstructured":"R. Cledat and S. Pande . Energy efficiency via the n-way model . In PESPMA 2010 , in conjunction with ISCA. ACM, 2010 . R. Cledat and S. Pande. Energy efficiency via the n-way model. In PESPMA 2010, in conjunction with ISCA. ACM, 2010."},{"key":"e_1_3_2_1_8_1","first-page":"105","volume-title":"In Proceedings of the 15th USENIX Security Symposium","author":"Cox B.","year":"2006","unstructured":"B. Cox , D. Evans , A. Filipi , J. Rowanhill , W. Hu , J. Davidson , J. Knight , A. Nguyen-tuong, and J. Hiser . N-variant systems: A secretless framework for security through diversity . In In Proceedings of the 15th USENIX Security Symposium , pages 105 -- 120 , 2006 . B. Cox, D. Evans, A. Filipi, J. Rowanhill, W. Hu, J. Davidson, J. Knight, A. Nguyen-tuong, and J. Hiser. N-variant systems: A secretless framework for security through diversity. In In Proceedings of the 15th USENIX Security Symposium, pages 105--120, 2006."},{"key":"e_1_3_2_1_9_1","volume-title":"http:\/\/tinyurl.com\/myj2m7","author":"Dimacs","year":"2009","unstructured":"Dimacs benchmarks. http:\/\/tinyurl.com\/myj2m7 , 2009 . Dimacs benchmarks. http:\/\/tinyurl.com\/myj2m7, 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/949305.949340"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2008.209"},{"key":"e_1_3_2_1_13_1","volume-title":"http:\/\/tinyurl.com\/28dxp67","author":"Intel","year":"2010","unstructured":"Intel haswell. http:\/\/tinyurl.com\/28dxp67 , 2010 . Intel haswell. http:\/\/tinyurl.com\/28dxp67, 2010."},{"key":"e_1_3_2_1_14_1","volume-title":"http:\/\/tinyurl.com\/2fyhejo","author":"Intel","year":"2010","unstructured":"Intel shows 48-core 'datacentre on a chip'. http:\/\/tinyurl.com\/2fyhejo , 2010 . Intel shows 48-core 'datacentre on a chip'. http:\/\/tinyurl.com\/2fyhejo, 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11560548_30"},{"key":"e_1_3_2_1_17_1","volume-title":"USENIX","author":"Knobe K.","year":"2009","unstructured":"K. Knobe . Ease of use with concurrent collections (CnC). In HotPar 2009: 1st USENIX Workshop on Hot Topics in Parallelism . USENIX , 2009 . K. Knobe. Ease of use with concurrent collections (CnC). In HotPar 2009: 1st USENIX Workshop on Hot Topics in Parallelism. USENIX, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646510.695012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806808"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2010.5491011"},{"key":"e_1_3_2_1_25_1","first-page":"376","volume-title":"ORSA Journal on Computing","volume":"3","author":"Reinelt G.","year":"1991","unstructured":"G. Reinelt . TSPLIB - a traveling salesman problem library . In ORSA Journal on Computing , volume 3 , pages 376 -- 384 , 1991 . G. Reinelt. TSPLIB - a traveling salesman problem library. In ORSA Journal on Computing, volume 3, pages 376--384, 1991."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183447"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519071"},{"key":"e_1_3_2_1_28_1","first-page":"521","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"Selman B.","year":"1995","unstructured":"B. Selman , H. Kautz , and B. Cohen . Local search strategies for satisfiability testing . In DIMACS Series in Discrete Mathematics and Theoretical Computer Science , pages 521 -- 532 , 1995 . B. Selman, H. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 521--532, 1995."},{"key":"e_1_3_2_1_29_1","unstructured":"TomLab. CPLEX parameters interface. http:\/\/tomopt.com\/docs\/cplexug\/tomlab_cplex014.php March 2010.  TomLab. CPLEX parameters interface. http:\/\/tomopt.com\/docs\/cplexug\/tomlab_cplex014.php March 2010."},{"key":"e_1_3_2_1_30_1","volume-title":"PESPMA 2008","author":"Trachsel O.","year":"2008","unstructured":"O. Trachsel and T. Gross . A platform for competitive execution . In PESPMA 2008 , in conjunction with ISCA. ACM, 2008 . O. Trachsel and T. Gross. A platform for competitive execution. In PESPMA 2008, in conjunction with ISCA. ACM, 2008."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1787275.1787325"},{"key":"e_1_3_2_1_32_1","volume-title":"A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations","author":"Tygert M.","year":"2009","unstructured":"M. Tygert . A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations . May 2009 . M. Tygert. A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations. May 2009."},{"key":"e_1_3_2_1_33_1","volume-title":"Approximation Algorithms","author":"Vazirani V.","year":"2001","unstructured":"V. Vazirani . Approximation Algorithms . Springer , 2001 . V. Vazirani. Approximation Algorithms. Springer, 2001."},{"key":"e_1_3_2_1_34_1","volume-title":"http:\/\/lancet.mit.edu\/ga\/","author":"Wall M.","year":"2009","unstructured":"M. Wall . GAlib. http:\/\/lancet.mit.edu\/ga\/ , 2009 . M. Wall. GAlib. http:\/\/lancet.mit.edu\/ga\/, 2009."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_60"}],"event":{"name":"SPLASH '11: Conference on Systems, Programming, and Applications: Software for Humanity","location":"Portland Oregon USA","acronym":"SPLASH '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048109","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2048066.2048109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:32Z","timestamp":1750225712000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2048066.2048109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,22]]},"references-count":32,"alternative-id":["10.1145\/2048066.2048109","10.1145\/2048066"],"URL":"https:\/\/doi.org\/10.1145\/2048066.2048109","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2076021.2048109","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,10,22]]},"assertion":[{"value":"2011-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}