首页 | 本学科首页   官方微博 | 高级检索  
     


Cost Minimization with HPDFG and Data Mining for Heterogeneous DSP
Authors:Jian-Wei Niu  Meikang Qiu  Xiaofei Wang  Jiayin Li  Gang Wu  Tianzhou Chen
Affiliation:(1) State Key Laboratory of Software Development Environment, Beihang University, Beijing, 100191, China;(2) Department of Electrical and Computer Engineering, University of Kentucky, Lexington, KY 40506, USA;(3) School of Computer Science and Engineering, Seoul National University, Seoul, 151-742, Korea;(4) School of Software, Shanghai Jiao Tong University, Shanghai, 200030, People’s Republic of China;(5) College of Computer Science, Zhejiang University, Hangzhou, 310027, People’s Republic of China
Abstract:Cost minimization and execution-time reduction have become the most important issues in today’s real-time embedded system. Meanwhile, for the DSP (Digital Signal Processing) applications running on embedded system, loops inside them are the most critical part for performance optimization. To optimize the loop iteration patterns, we need to schedule the loop execution order. Due to the uncertainties within the execution time of tasks, we model varied execution times of tasks as random variables and propose a novel data graph model, called HPDFG (Heterogeneous Probabilistic Data-Flow Graph) to model DSP applications on embedded systems. A novel algorithm, LSHAPE, is proposed to minimize the cost and satisfy the timing constraints. First of all, we use the data mining methods to estimate the probabilistic distribution of the execution time variables. Second, we rotate the loops in the application to explore different possible execution patterns. Finally, we combine the list-scheduling and the dynamic programming to generate a near-optimal task allocation and a core-mode assignment. Experimental results demonstrate the effectiveness of our algorithm. Our approach can handle loops efficiently.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号