QQ客服 官方微博 反馈留言

	Memory Partitioning and Scheduling Co-optimization in Behavioral Synthesis
	Li, Peng ; Wang, Yuxin ; Zhang, Peng ; Luo, Guojie ; Wang, Tao ; Cong, Jason
	2012
关键词	Behavioral Synthesis Memory Partitioning Memory Scheduling MACHINES
英文摘要	Achieving optimal throughput by extracting parallelism in behavioral synthesis often exaggerates memory bottleneck issues. Data partitioning is an important technique for increasing memory bandwidth by scheduling multiple simultaneous memory accesses to different memory banks. In this paper we present a vertical memory partitioning and scheduling algorithm that can generate a valid partition scheme for arbitrary affine memory inputs. It does this by arranging non-conflicting memory accesses across the border of loop iterations. A mixed memory partitioning and scheduling algorithm is also proposed to combine the advantages of the vertical and other state-of-art algorithms. A set of theorems is provided as criteria for selecting a valid partitioning scheme. This is followed by an optimal and scalable memory scheduling algorithm. By utilizing the property of constant strides between memory addresses in successive loop iterations, an address translation optimization technique for an arbitrary partition factor is proposed to improve performance, area and energy efficiency. Experimental results show that on a set of real-world medical image processing kernels, the proposed mixed algorithm with address translation optimization can gain speed-up, area reduction and power savings of 15.8%, 36% and 32.4% respectively, compared to the state-of-art memory partitioning algorithm.; Computer Science, Software Engineering; Engineering, Electrical & Electronic; CPCI-S(ISTP); 3
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/405989]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Li, Peng,Wang, Yuxin,Zhang, Peng,et al. Memory Partitioning and Scheduling Co-optimization in Behavioral Synthesis. 2012-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。