Adaptive Source-Level Data Assignment to Dual Memory Banks

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{Murray:2012:ASL,

• author = "Alastair Murray and Bjorn Franke",
• title = "Adaptive Source-Level Data Assignment to Dual Memory Banks",
• journal = "ACM Transactions on Embedded Computing Systems",
• year = "2012",
• volume = "11S",
• number = "1",
• month = jun,
• pages = "20:1--20:22",
• publisher = "ACM",
• address = "New York, NY, USA",
• keywords = "genetic algorithms, genetic programming, SBSE, compilers, digital signal processors, dual memory banks, graph colouring, integer linear programming, source-level transformations",
• ISSN = "1539-9087",
• DOI = "doi:10.1145/2180887.2180897",
• size = "22 pages",
• abstract = "Dual memory banks provide extra memory bandwidth to DSP applications and enable simultaneous access to two operands if the data is partitioned appropriately. Fully automated and compiler integrated approaches to data partitioning and memory bank assignment have, however, found little acceptance by DSP software developers. In this article we present a novel source-level approach that is more programmer friendly. Our scheme is based on soft graph colouring and highly adaptive heuristics generated by genetic programming. We have evaluated our scheme on an Analog Devices TigerSHARC TS-101 DSP and achieved speedups of up to 57percent on 13 UTDSP benchmarks.",
• acmid = "2180897",
• articleno = "20",
• bibdate = "Thu Jun 7 16:18:52 MDT 2012",
• bibsource = "http://portal.acm.org/; http://www.math.utah.edu/pub/tex/bib/tecs.bib",
• acknowledgement = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|",

}

Genetic Programming entries for Alastair Murray Bjorn Franke

Citations