{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:56:48Z","timestamp":1740895008666,"version":"3.38.0"},"reference-count":39,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2016,7,27]],"date-time":"2016-07-27T00:00:00Z","timestamp":1469577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p> The objective of data compression is to avoid redundancy in order to reduce the size of the data to be stored or transmitted. In some scenarios, data compression may help to increase global performance by reducing the amount of data at a competitive cost in terms of global time and energy consumption. We have introduced computational compression as a technique for reducing redundant computation, in other words, to avoid carrying out the same computation with the same input to obtain the same output. In some scenarios, such as simulations, graphic processing, and so on, part of the computation is repeated using the same input in order to obtain the same output, and this computation could have an important cost in terms of global time and energy consumption. We propose applying computational compression by using memoization in order to store the results for future reuse and, in this way, minimize the use of the same costly computation. Although memoization was proposed for sequential applications in the 1980s, and there are some projects that have applied it in very specific domains, we propose a novel, domain-independent way of using it in high-performance applications, as a means of avoiding redundant computation. <\/jats:p>","DOI":"10.1177\/1094342016637813","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T00:44:04Z","timestamp":1459212244000},"page":"469-485","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Improving performance using computational compression through memoization: A case study using a railway power consumption simulator"],"prefix":"10.1177","volume":"30","author":[{"given":"Alejandro","family":"Calder\u00f3n","sequence":"first","affiliation":[{"name":"Computer Architecture Group, Computer Science and Engineering Department, Universidad Carlos III de Madrid, Spain"}]},{"given":"Alberto","family":"Garc\u00eda","sequence":"additional","affiliation":[{"name":"Computer Architecture Group, Computer Science and Engineering Department, Universidad Carlos III de Madrid, Spain"}]},{"given":"F\u00e9lix","family":"Garc\u00eda-Carballeira","sequence":"additional","affiliation":[{"name":"Computer Architecture Group, Computer Science and Engineering Department, Universidad Carlos III de Madrid, Spain"}]},{"given":"Jes\u00fas","family":"Carretero","sequence":"additional","affiliation":[{"name":"Computer Architecture Group, Computer Science and Engineering Department, Universidad Carlos III de Madrid, Spain"}]},{"given":"Javier","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[{"name":"Computer Architecture Group, Computer Science and Engineering Department, Universidad Carlos III de Madrid, Spain"}]}],"member":"179","published-online":{"date-parts":[[2016,7,27]]},"reference":[{"doi-asserted-by":"publisher","key":"bibr1-1094342016637813","DOI":"10.1016\/j.suscom.2012.02.002"},{"volume-title":"Mathematics for Biological Scientists","year":"2010","author":"Aitken M","key":"bibr2-1094342016637813"},{"issue":"34","key":"bibr3-1094342016637813","first-page":"1","volume":"7","author":"Antol\u00edk J","year":"2013","journal-title":"Frontiers in Neuroinformatics"},{"doi-asserted-by":"publisher","key":"bibr4-1094342016637813","DOI":"10.1177\/1094342013493644"},{"doi-asserted-by":"publisher","key":"bibr5-1094342016637813","DOI":"10.1177\/1094342010369115"},{"key":"bibr6-1094342016637813","first-page":"1","volume-title":"Writing Efficient Programs","author":"Bentley JL","year":"1982"},{"volume-title":"Prolog Programming for Artificial Intelligence","year":"1986","author":"Bratko I","key":"bibr7-1094342016637813"},{"year":"2014","author":"BS-EN-50641","journal-title":"Railway applications - fixed installations - requirements for the validation of simulation tools used for the design of traction power supply systems","key":"bibr8-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr9-1094342016637813","DOI":"10.1007\/978-3-319-14313-2_32"},{"doi-asserted-by":"publisher","key":"bibr10-1094342016637813","DOI":"10.1145\/2488551.2488554"},{"unstructured":"Chaos A (2008) Another Look at my old Benchmark. Available at: http:\/\/attractivechaos.wordpress.com\/2008\/10\/07\/another-look-at-my-old-benchmark\/ (accessed 8 March 2016).","key":"bibr11-1094342016637813"},{"doi-asserted-by":"crossref","unstructured":"Chen W, Deelman E (2012a) WorkflowSim: A toolkit for simulating scientific workflows in distributed environments. Available at: https:\/\/www.ci.uchicago.edu\/escience2012\/pdf\/WorkflowSim-A_Toolkit_for_Simulating_Scientific_Workflows_in_Distibuted_Environments.pdf (acces-sed 8 March 2016).","key":"bibr12-1094342016637813","DOI":"10.1109\/eScience.2012.6404430"},{"doi-asserted-by":"publisher","key":"bibr13-1094342016637813","DOI":"10.1109\/eScience.2012.6404430"},{"doi-asserted-by":"publisher","key":"bibr14-1094342016637813","DOI":"10.1109\/PACT.2000.888334"},{"key":"bibr15-1094342016637813","first-page":"1","volume-title":"Proceedings of the 9th USENIX conference on operating systems design and implementation","author":"Cui H","year":"2010"},{"unstructured":"Gailly J-L, Adler M (2014) Zlib. Available at: http:\/\/www.zlib.net\/ (accessed 8 March 2016).","key":"bibr16-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr17-1094342016637813","DOI":"10.1007\/978-0-85729-439-5_12"},{"key":"bibr18-1094342016637813","first-page":"254","volume-title":"Johns Hopkins APL Technical Digest","volume":"18","author":"Hall M","year":"1997"},{"doi-asserted-by":"publisher","key":"bibr19-1094342016637813","DOI":"10.1109\/CSC.2011.6138544"},{"key":"bibr20-1094342016637813","volume-title":"Numerical Methods for Engineers and Scientists","author":"Hoffman J","year":"2001","edition":"2"},{"unstructured":"Intel and Micron (2015) Intel and micron produce breakthrough memory technology. Available at: http:\/\/newsroom.intel.com\/community\/intel_newsroom\/blog\/2015\/07\/28\/intel-and-micron-produce-breakthrough-memory-technology (accessed 8 March 2016).","key":"bibr21-1094342016637813"},{"unstructured":"Jahn S, Margraf M, Habchi V, (2007) Qucs technical papers. Available at: http:\/\/qucs.sourceforge.net\/tech\/node14.html (accessed November 2015).","key":"bibr22-1094342016637813"},{"unstructured":"Jarod24 (2014) Memoization functor wrapper in C++. Available at: http:\/\/stackoverflow.com\/questions\/24637619\/memoization-functor-wrapper-in-c. (accessed 8 March 2016).","key":"bibr23-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr24-1094342016637813","DOI":"10.1109\/ICNC.2012.17"},{"unstructured":"Kovacs K (2013) Cassandra vs MongoDB vs CouchDB vs Redis vs Riak vs HBase vs Couchbase vs Neo4j vs Hypertable vs ElasticSearch vs Accumulo vs VoltDB vs Scalaris comparison. Available at: http:\/\/kkovacs.eu\/cassandra-vs-mongodb-vs-couchdb-vs-redis (accessed 8 March 2016).","key":"bibr25-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr26-1094342016637813","DOI":"10.1109\/2.76287"},{"key":"bibr27-1094342016637813","first-page":"367","volume-title":"MPI: A Message-Passing Interface Standard Version 3.0","volume":"1","author":"Message Passing Interface Forum","year":"2012"},{"unstructured":"Mulalic EH, Stankovic MS, Stankovic RS (2012) Memoization technique for optimizing functions with stochastic input. Available at: http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1211.html#abs-1211-5173 (accessed 8 March 2016).","key":"bibr28-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr29-1094342016637813","DOI":"10.1088\/1742-6596\/219\/7\/072014"},{"unstructured":"Richardson SE (1992) Caching function results: Faster arithmetic by avoiding unnecessary computation. Technical report, Mountain View, CA.","key":"bibr30-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr31-1094342016637813","DOI":"10.1145\/1852761.1852775"},{"doi-asserted-by":"publisher","key":"bibr32-1094342016637813","DOI":"10.1016\/j.eswa.2012.02.002"},{"doi-asserted-by":"publisher","key":"bibr33-1094342016637813","DOI":"10.1145\/384265.291063"},{"volume-title":"Financial Modeling Using Excel and VBA","year":"2004","author":"Sengupta C","key":"bibr34-1094342016637813"},{"doi-asserted-by":"publisher","key":"bibr35-1094342016637813","DOI":"10.1109\/VISUAL.1998.745332"},{"doi-asserted-by":"publisher","key":"bibr36-1094342016637813","DOI":"10.1016\/j.jpdc.2010.01.004"},{"unstructured":"Troy HD (2012) UThash. Available at: https:\/\/sourceforge.net\/projects\/uthash\/ (accessed 8 March 2016).","key":"bibr37-1094342016637813"},{"key":"bibr38-1094342016637813","first-page":"5","volume-title":"INTENSIVE 2012, the fourth international conference on resource intensive applications and services","author":"Yamada D","year":"2012"},{"doi-asserted-by":"publisher","key":"bibr39-1094342016637813","DOI":"10.1145\/1631687.1596575"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342016637813","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342016637813","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342016637813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T21:16:20Z","timestamp":1740863780000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342016637813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,27]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.1177\/1094342016637813"],"URL":"https:\/\/doi.org\/10.1177\/1094342016637813","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2016,7,27]]}}}