ACM Home Page
Please provide us with feedback. Feedback
An algorithm for synthesis of large time-constrained heterogeneous adaptive systems
Full text PdfPdf (164 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 6 ,  Issue 2  (April 2001) table of contents
Pages: 207 - 225  
Year of Publication: 2001
ISSN:1084-4309
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   review  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/375977.375979
What is a DOI?

ABSTRACT

Large time-constrained applications are highly computer-intensive and are often implemented as a complex organization of pipelined data parallel tasks on a pool of embedded processors, DSP processors, and FPGAs. The large number of design alternatives available at each task level, the application as a whole, and the special needs of the reconfigurable devices (such as the FPGA) make the manual synthesis of such systems very tedious. The automatic synthesis algorithm in this paper combines exact (MILP-based) and heuristic techniques to solve this problem, which basically involves (1) propagation of timing constraints; (2) pipelining the loops to meet throughput requirements; (3) resource selection and scheduling, keeping the processing requirements and the timing constraints in view; (4) scheduling the resources across the tasks to ensure maximum utilization; and (5) hiding the reconfiguration delays of the FPGAs. While the use of MILP techniques helps in getting high-quality results, combining them with heuristics ensures acceptable synthesis times, striking a good balance between quality of results and synthesis time. Our experimental evaluation of the algorithm shows an average 40% in resource cost reduction (compared to manual synthesis) with synthesis times from minutes to as low as a few seconds in some cases.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
BERKELAAR. 2001. lp_solve version 2.1. ftp://ftp.es.ele.tue.nl/pub/lp_solve.
 
3
BROWN,R.AND LINDERMAN, R. 1997. Algorithm development for an airborne real-time STAP demonstration. In Proceedings of the IEEE National Conference on Radar. IEEE Computer Society Press, Los Alamitos, CA.
4
 
5
CHOUDHARY, A., LIO, W., WEINER, D., VARSHNEY, P., LINDERMAN, R., AND LINDERMAN, M. 1998. Design, implementation and evaluation of parallel pipelined STAP on parallel computers. In Proceedings of the 12th International Symposium on Parallel Processing.
 
6
DAVE,B.AND JHA, N. 1998. CORHA: Hardware-software C-synthesis of hierarchical distributed embedded system architectures. IEEE Trans. Comput.-Aided Des. 17 (Oct.), 900-919.
7
 
8
9
 
10
 
11
 
12
 
13
GUPTA,R.AND DEMICHELI, G. 1992. System-level synthesis using re-programmable components. In Proceedings of the European Conference on Design Automation (EDAC '92, Brussels, Belgium, Mar. 16 - 19). IEEE Computer Society Press, Los Alamitos, CA, 2-7.
 
14
KALAVADE,A.AND LEE, E. 1992. Hardware/software co-design using Ptolemy: A case study. In Proceedings of the IFIP International Workshop on Hardware/Software Co-Design. IFIP.
15
 
16
PRAKASH,S.AND PARKER, A. C. 1992. SOS: Synthesis of application-specific heterogeneous multiprocessor systems. J. Parallel Distrib. Comput. 16, 4 (Dec.), 338-351.



REVIEW

"William R. Spillers : Reviewer"

In their abstract, the authors state that “The automatic synthesis algorithm in this paper combines exact (MILP-based) and heuristic techniques to solve this problem, which basically involves (1) propagation of timing constraints; (2) pipeli  more...