A Framework for Memory-aware Multimedia Application Mapping on Chip-Multiprocessors

被引:3
作者
Bathen, Luis Angel D. [1 ]
Dutt, Nikil D. [1 ]
Pasricha, Sudeep [2 ]
机构
[1] Univ Calif Irvine, Ctr Embedded Comp Syst, Irvine, CA 92717 USA
[2] Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA
来源
PROCEEDINGS OF THE 2008 IEEE/ACM/IFIP WORKSHOP ON EMBEDDED SYSTEMS FOR REAL-TIME MULTIMEDIA | 2008年
关键词
D O I
10.1109/ESTMED.2008.4697003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The relentless increase in multimedia embedded system application requirements as well as improvements in IC design technology have motivated the deployment of chip multiprocessor (CMP) architectures. Task scheduling and data placement in memory are two of the most important steps in the application customization process as they greatly influence overall power consumption, and performance. Most designers consider task scheduling and data placement to be independent of each other. However, optimal task scheduling does not always produce optimal data placement, and optimal data placement may not necessarily allow for optimal task scheduling. In this paper, we propose a novel framework for simultaneous application mapping and data placement onto CMP architectures, especially for multimedia applications. At the core of our framework is a memory-aware task scheduling algorithm that relies on static analysis and task splitting to reduce off-chip memory transfers. Our experiments on a JPEG2000 case study have shown that we can achieve up to 35% performance Improvement and up to 66% power reduction compared to traditional scheduling/data allocation approaches.
引用
收藏
页码:89 / +
页数:2
相关论文
共 30 条
[1]   COMPARISON OF LIST SCHEDULES FOR PARALLEL PROCESSING SYSTEMS [J].
ADAM, TL ;
CHANDY, KM ;
DICKSON, JR .
COMMUNICATIONS OF THE ACM, 1974, 17 (12) :685-690
[2]  
Agarwal V, 2000, PROCEEDING OF THE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P248, DOI [10.1109/ISCA.2000.854395, 10.1145/342001.339691]
[3]  
[Anonymous], 2003, 1449610 ISO IEC
[4]  
BANAKAR R, 2002, SCRATCHPAD MEMORY DE
[5]  
BROCKMEYER E, 2003, LAYER ASSIGNMENT TEC, P1070
[6]  
CHONG J, 2007, EFFICIENT PARALLELIZ, P1874
[7]  
Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[8]   PARALLEL SEQUENCING AND ASSEMBLY LINE PROBLEMS [J].
HU, TC .
OPERATIONS RESEARCH, 1961, 9 (06) :841-848
[9]  
ISO/IEC, 2000, 154441 ISOIEC
[10]   FORAY-GEN: Automatic generation of affine functions for memory optimizations [J].
Issenin, I ;
Dutt, N .
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2005, :808-813