{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:37:38Z","timestamp":1783035458495,"version":"3.54.6"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"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":["XRDS"],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p>Do we need to design algorithms differently if our goal is to save energy, rather than time or space? This article presents a simple and speculative thought experiment that suggests when and why the answer could be \"yes.\"<\/jats:p>","DOI":"10.1145\/2425676.2425691","type":"journal-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T13:31:59Z","timestamp":1364218319000},"page":"49-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["How much (execution) time and energy does my algorithm cost?"],"prefix":"10.1145","volume":"19","author":[{"given":"Jee Whan","family":"Choi","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard W.","family":"Vuduc","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,3]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"The Connection Machine","author":"Hilis W. D.","year":"1989","unstructured":"Hilis , W. D. The Connection Machine . MIT Press , Cambridge , 1989 . Hilis, W. D. The Connection Machine. MIT Press, Cambridge, 1989."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2209249.2209272"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/17407.17362"},{"key":"e_1_2_1_5_1","volume-title":"Balance principles for algorithm-architecture co-design. USENIX Wkshp. Hot Topics in Parallelism (HotPar)","author":"Czechowski K.","year":"2011","unstructured":"Czechowski , K. , Battaglino , C. , Mcclanahan , C. , Chandramowlishwaran , A. , and Vuduc , R . Balance principles for algorithm-architecture co-design. USENIX Wkshp. Hot Topics in Parallelism (HotPar) , Usenix Association ( 2011 ), 1--5. Czechowski, K., Battaglino, C., Mcclanahan, C., Chandramowlishwaran, A., and Vuduc, R. Balance principles for algorithm-architecture co-design. USENIX Wkshp. Hot Topics in Parallelism (HotPar), Usenix Association (2011), 1--5."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2011.17"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2011.89"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2008.127"}],"container-title":["XRDS: Crossroads, The ACM Magazine for Students"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2425676.2425691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2425676.2425691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:41Z","timestamp":1750234721000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2425676.2425691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1145\/2425676.2425691"],"URL":"https:\/\/doi.org\/10.1145\/2425676.2425691","relation":{},"ISSN":["1528-4972","1528-4980"],"issn-type":[{"value":"1528-4972","type":"print"},{"value":"1528-4980","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]},"assertion":[{"value":"2013-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}