Synthesis of an application-specific soft multiprocessor system
Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field …, 2007•dl.acm.org
The application-specific multiprocessor System-on-a-Chip is a promising design alternative
because of its high degree of flexibility, short development time, and potentially high
performance attributed to application-specific optimizations. However, designing an optimal
application-specific multiprocessor system is still challenging because there are a number of
important metrics, such as throughput, latency, and resource usage, that need to be
explored and optimized. This paper addresses the problem of synthesizing the application …
because of its high degree of flexibility, short development time, and potentially high
performance attributed to application-specific optimizations. However, designing an optimal
application-specific multiprocessor system is still challenging because there are a number of
important metrics, such as throughput, latency, and resource usage, that need to be
explored and optimized. This paper addresses the problem of synthesizing the application …
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high performance attributed to application-specific optimizations. However, designing an optimal application-specific multiprocessor system is still challenging because there are a number of important metrics, such as throughput, latency, and resource usage, that need to be explored and optimized. This paper addresses the problem of synthesizing the application-specific multiprocessor system to minimize latency and resource usage under the throughput constraint. We employ a novel framework for this problem, similar to that of technology mapping in the logic synthesis domain, and develop a set of efficient algorithms, including labeling, clustering and packing, for efficient generation of the multiprocessor architecture with application-specific optimized latency and resources. Specifically, the result of our algorithm is latency-optimal for directed acyclic task graphs. Application of our approach to the Motion JPEG example on Xilinx's Virtex II Pro platform FPGA shows interesting design tradeoffs.
ACM Digital Library
Showing the best result for this search. See all results