{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T09:40:05Z","timestamp":1737452405358,"version":"3.33.0"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p>To increase memory bandwidth, many programmable Digital-Signal Processors (DSPs) employ two on-chip data memories. This architectural feature supports higher memory bandwidth by allowing multiple data memory accesses to occur in parallel. Exploiting dual memory banks, however, is a challenging problem for compilers. This, in part, is due to the instruction-level parallelism, small numbers of registers, and highly specialized register capabilities of most DSPs. In this paper, we present a new methodology based on a Memetic Algorithm (MA) for assigning data to dual-bank memories. Our approach is global, and integrates several important issues in memory assignment within a single model. Special effort is made to identify those data objects that could potentially benefit from an assignment to a specific memory, or perhaps duplication in both memories. Our computational results show that the MA is able to achieve a 54% reduction in the number of memory cycles and a reduction in the range of 7%\u201342% in the total number of cycles when tested with well-known DSP kernels and applications. Our computational results also show that, when compared with the Genetic Algorithm in Ref. 3, the memetic algorithm is able to find solutions that, on average, have 7%\u201320% less cost, with the biggest improvements being found for larger problem instances.<\/jats:p>","DOI":"10.1142\/s1469026806002039","type":"journal-article","created":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T09:36:29Z","timestamp":1191231389000},"page":"473-497","source":"Crossref","is-referenced-by-count":0,"title":["A MEMETIC ALGORITHM FOR PERFORMING MEMORY ASSIGNMENT IN DUAL-BANK DSPS"],"prefix":"10.1142","volume":"06","author":[{"given":"G.","family":"GR\u00c9WAL","sequence":"first","affiliation":[{"name":"Computing and Information Science, University of Guelph, Guelph, ON N1L1N5, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"COROS","sequence":"additional","affiliation":[{"name":"Computing and Information Science, University of Guelph, Guelph, ON N1L1N5, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"VENTRESCA","sequence":"additional","affiliation":[{"name":"Systems Design Engineering, University of Waterloo, Waterloo, ON N2L3G1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"volume-title":"A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M.","key":"rf2"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/335043.335047"},{"volume-title":"John E. Freud's Mathematical Statistics","year":"1999","author":"Miller I.","key":"rf11"},{"key":"rf13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"Mitchell M.","year":"1996"}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026806002039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T09:22:18Z","timestamp":1737451338000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1469026806002039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":4,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S1469026806002039"],"URL":"https:\/\/doi.org\/10.1142\/s1469026806002039","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"type":"print","value":"1469-0268"},{"type":"electronic","value":"1757-5885"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}