Finding heap-bounds for hardware synthesis
FMCAD(2009)
摘要
Abstract—Dynamically allocated and manipulated data struc- tures cannot be translated into hardware unless there is an upper bound on the amount,of memory,the program,uses during all executions. This bound,can depend on the generic parameters to the program, i.e., program inputs that are instantiated at synthesis time. We propose a constraint based method,for the discovery of memory usage bounds, which leads to the first- known,C-to-gates hardware synthesis supporting programs with non-trivial use of dynamically allocated memory, e.g., linked lists maintained withmalloc,andfree. We illustrate the practicality of our tool on a range of examples. I. I NTRODUCTION C-to-gates synthesis promises to bring the power,of hard- ware based acceleration to mainstream,programmers,and to radically increase the productivity of digital designers [ 17]. However, today’s C-to-gates synthesis tools do not support one of the most powerful and widely used features of high-level programming,in C—dynamically,allocated data structures. Thus, with today’s tools we usually cannot synthesize gates from off-the-shelf C-based software. The support for dynamic memory,abstraction remains,an on-going research problem
更多查看译文
关键词
digital design,shape,data structure,data mining,memory management,tree data structures,upper bound,artificial neural networks,hardware
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络