{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:15Z","timestamp":1750309215698,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"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":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2014,2]]},"abstract":"<jats:p>Memory management searches for the resources required to store the concurrently alive elements. The solution quality is affected by the representation of the element accesses: a sub-optimal representation leads to overestimation and a non-scalable representation increases the exploration time. We propose a methodology to near-optimal and scalable represent regular and irregular accesses. The representation consists of a set of pattern entries to compactly describe the behavior of the memory accesses and of pattern operations to consistently combine the pattern entries. The result is a final sequence of pattern entries which represents the global access scheme without unnecessary overestimation.<\/jats:p>","DOI":"10.1145\/2579677","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T12:09:07Z","timestamp":1395144547000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A scalable and near-optimal representation of access schemes for memory management"],"prefix":"10.1145","volume":"11","author":[{"given":"Angeliki","family":"Kritikakou","sequence":"first","affiliation":[{"name":"ONERA and University of Patras, Belin, Toulouse"}]},{"given":"Francky","family":"Catthoor","sequence":"additional","affiliation":[{"name":"IMEC and KU Leuven, Belgium"}]},{"given":"Vasilios","family":"Kelefouras","sequence":"additional","affiliation":[{"name":"University of Patras, Patras, Greece"}]},{"given":"Costas","family":"Goutis","sequence":"additional","affiliation":[{"name":"University of Patras, Patras, Greece"}]}],"member":"320","published-online":{"date-parts":[[2014,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142155.1142165"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626494000260"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/74818.74822"},{"volume-title":"Proceedings of DATA. ACM, 740--745","author":"Bartzas A.","key":"e_1_2_1_4_1","unstructured":"A. Bartzas , S. Mamagkakis , G. Pouiklis , D. Atienza , F. Catthoor , D. Soudris , and A. Thanailakis . 2006. Dynamic data type refinement methodology for systematic performance-energy design exploration of network applications . In Proceedings of DATA. ACM, 740--745 . A. Bartzas, S. Mamagkakis, G. Pouiklis, D. Atienza, F. Catthoor, D. Soudris, and A. Thanailakis. 2006. Dynamic data type refinement methodology for systematic performance-energy design exploration of network applications. In Proceedings of DATA. ACM, 740--745."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008181319813"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"F. Catthoor E. De Greef and S. Suytack. 1998a. Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design. Kluwer.   F. Catthoor E. De Greef and S. Suytack. 1998a. Custom Memory Management Methodology: Exploration of Memory Organisation for Embedded Multimedia System Design. Kluwer.","DOI":"10.1007\/978-1-4757-2849-1"},{"volume-title":"Proceedings of Low-Power CMOS Design. IEEE, 609--618","author":"Catthoor F.","key":"e_1_2_1_7_1","unstructured":"F. Catthoor , S. Wuytack , E. De Greef , F. Franssen , L. Nachtergaele , and H. De Man . 1998b. System-level transformations for low power data transfer and storage . In Proceedings of Low-Power CMOS Design. IEEE, 609--618 . F. Catthoor, S. Wuytack, E. De Greef, F. Franssen, L. Nachtergaele, and H. De Man. 1998b. System-level transformations for low power data transfer and storage. In Proceedings of Low-Power CMOS Design. IEEE, 609--618."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1289881.1289915"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/346023.346031"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929943.1929947"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"B. Creusillet and F. Irigoin. 1996. Exact vs. Approximate Array Region Analyses.  B. Creusillet and F. Irigoin. 1996. Exact vs. Approximate Array Region Analyses.","DOI":"10.1007\/BFb0017247"},{"volume-title":"Proceedings of PDPTA. 1669--1675","author":"Danckaert K.","key":"e_1_2_1_12_1","unstructured":"K. Danckaert , F. Catthoor , and H. De Man . 1999. Platform independent data transfer & storage exploration illustrated on parallel cavity detection algorithm . In Proceedings of PDPTA. 1669--1675 . K. Danckaert, F. Catthoor, and H. De Man. 1999. Platform independent data transfer & storage exploration illustrated on parallel cavity detection algorithm. In Proceedings of PDPTA. 1669--1675."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.167"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90045-Q"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.238445"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455229.1455232"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00722-4_17"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1128020.1128563"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.107"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the International Conference on Computational Science","author":"Janjusic T.","year":"2058","unstructured":"T. Janjusic , K. M. Kavi , and B. Potter . 2011. Gleipnir: A memory analysis tool . In Proceedings of the International Conference on Computational Science . Springer, Netherlands , 2058 --2067. T. Janjusic, K. M. Kavi, and B. Potter. 2011. Gleipnir: A memory analysis tool. In Proceedings of the International Conference on Computational Science. Springer, Netherlands, 2058--2067."},{"volume-title":"Proceedings of EDAC. IEEE, 288","author":"Jha P. K.","key":"e_1_2_1_21_1","unstructured":"P. K. Jha and N. D. Dutt . 1997. Library mapping for memories . In Proceedings of EDAC. IEEE, 288 . P. K. Jha and N. D. Dutt. 1997. Library mapping for memories. In Proceedings of EDAC. IEEE, 288."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/373243.360219"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.814257"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/989995.989996"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534383"},{"key":"e_1_2_1_26_1","article-title":"Scalable & near-optimal array size under overlapping & irregular accesses","author":"Kritikakou A.","year":"2013","unstructured":"A. Kritikakou , F. Catthoor , V. Kelefouras , and C. Goutis . 2013 b. Scalable & near-optimal array size under overlapping & irregular accesses . IEEE Trans. Comput. Under revision. A. Kritikakou, F. Catthoor, V. Kelefouras, and C. Goutis. 2013b. Scalable & near-optimal array size under overlapping & irregular accesses. IEEE Trans. Comput. Under revision.","journal-title":"IEEE Trans. Comput. Under revision."},{"volume-title":"Proceedings of MICRO. IEEE, 330--335","author":"Lee C.","key":"e_1_2_1_27_1","unstructured":"C. Lee , M. Potkonjak , and W. H. Mangione-Smith . 1997. MediaBench: A tool for evaluating & synthesizing multimedia & communications systems . In Proceedings of MICRO. IEEE, 330--335 . C. Lee, M. Potkonjak, and W. H. Mangione-Smith. 1997. MediaBench: A tool for evaluating & synthesizing multimedia & communications systems. In Proceedings of MICRO. IEEE, 330--335."},{"key":"e_1_2_1_28_1","unstructured":"S.-T. Leung and J. Zahorjan. 1995. Optimizing Data Locality by Array Restructuring. Technical Report.  S.-T. Leung and J. Zahorjan. 1995. Optimizing Data Locality by Array Restructuring. Technical Report."},{"key":"e_1_2_1_29_1","volume-title":"Van Der Werf","author":"Lippens P. E. R.","year":"1993","unstructured":"P. E. R. Lippens , J. L. Van Meerbergen , W. F. J. Verhaegh , and A. Van Der Werf . 1993 . Allocation of multiport memories for hierarchical data stream. In Proceedings of CAD. IEEE , 728--735. P. E. R. Lippens, J. L. Van Meerbergen, W. F. J. Verhaegh, and A. Van Der Werf. 1993. Allocation of multiport memories for hierarchical data stream. In Proceedings of CAD. IEEE, 728--735."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065034"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/149439.133079"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158515"},{"key":"e_1_2_1_33_1","first-page":"213","article-title":"A specification and simulation front-end for hardware synthesis of digital signal processing applications","volume":"2","author":"Nachtergaele L.","year":"1992","unstructured":"L. Nachtergaele , I. Bolsens , and H. De Man . 1992 . A specification and simulation front-end for hardware synthesis of digital signal processing applications . Int. J. Comp. Simulation 2 , 213 -- 229 . L. Nachtergaele, I. Bolsens, and H. De Man. 1992. A specification and simulation front-end for hardware synthesis of digital signal processing applications. Int. J. Comp. Simulation 2, 213--229.","journal-title":"Int. J. Comp. Simulation"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391962.1391968"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/509705.509708"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/513829.513836"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.739054"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/375977.375978"},{"key":"e_1_2_1_39_1","unstructured":"L. N. Pouchet J. Cavazos and S. Grauer-Gray. 2012. PolyBench\/C:The Polyhedral Benchmark Suite. Retrieved from http:\/\/www.cse.ohio-state.edu\/&sim;pouchet\/software\/polybench\/.  L. N. Pouchet J. Cavazos and S. Grauer-Gray. 2012. PolyBench\/C:The Polyhedral Benchmark Suite. Retrieved from http:\/\/www.cse.ohio-state.edu\/&sim;pouchet\/software\/polybench\/."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.378523"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/565816.503287"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2207222.2207224"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.80162"},{"volume-title":"Proceedings of ISSGO. IEEE, 291","author":"So B.","key":"e_1_2_1_44_1","unstructured":"B. So , M. W. Hall , and H. E. Ziegler . 2004. Custom data layout for memory parallelism . In Proceedings of ISSGO. IEEE, 291 . B. So, M. W. Hall, and H. E. Ziegler. 2004. Custom data layout for memory parallelism. In Proceedings of ISSGO. IEEE, 291."},{"key":"e_1_2_1_45_1","unstructured":"S. Verdoolaege. 2013. Barvinok. Retrieved from http:\/\/barvinok.gforge.inria.fr\/.  S. Verdoolaege. 2013. Barvinok. Retrieved from http:\/\/barvinok.gforge.inria.fr\/."},{"volume-title":"Proceedings of the Workshop on VLSI Signal Processing. IEEE, 397--406","author":"Swaaij M.","key":"e_1_2_1_46_1","unstructured":"M. Swaaij , F. Franssen , F. Catthoor , and H. De Man . 1992. Automating high level control flow transformations for DSP memory management . In Proceedings of the Workshop on VLSI Signal Processing. IEEE, 397--406 . M. Swaaij, F. Franssen, F. Catthoor, and H. De Man. 1992. Automating high level control flow transformations for DSP memory management. In Proceedings of the Workshop on VLSI Signal Processing. IEEE, 397--406."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/501790.501816"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/263272.263278"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.736124"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2579677","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2579677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:50Z","timestamp":1750290230000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2579677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["10.1145\/2579677"],"URL":"https:\/\/doi.org\/10.1145\/2579677","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"type":"print","value":"1544-3566"},{"type":"electronic","value":"1544-3973"}],"subject":[],"published":{"date-parts":[[2014,2]]},"assertion":[{"value":"2012-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}