ACM Home Page
Please provide us with feedback. Feedback
Array mapping in behavioral synthesis
Full text Publisher SitePublisher Site PdfPdf (67 KB)
Source International Symposium on Systems Synthesis archive
Proceedings of the 8th international symposium on System synthesis table of contents
Cannes, France
Pages: 90 - 95  
Year of Publication: 1995
ISBN:0-89791-771-5
Authors
Herman Schmit  Dept. of ECE, Carnegie Mellon University, Pittsburgh, PA
Donald E. Thomas  Dept. of ECE, Carnegie Mellon University, Pittsburgh, PA
Sponsors
IEEE-CS\TCDA : TC Design Automation
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Abstract: This paper discusses the mapping of arrays in a behavior to memories in an implementation. We introduce a design representation based on a variety of array grouping techniques and the binding of array groups to memory components with different dimensions, access times, and number of ports. The results of design actions are computed in terms of the number of memory components and the length of schedules in the behavior. We demonstrate the ability of a synthesis tool using this representation to generate designs that span the entire range of the memory design space.


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
M. Balakrishnan, A. Majmudar, D. Banerji, J. Linders, and J. Majithia, "Allocation of Multiport Memories in Data Path Synthesis," IEEE Trans. on CAD, April 1988.
2
 
3
C. Coroyer and Z. Liu, Effectiveness of Heuristics and Simulated Annealing for the Scheduling of Concurrent Tasks: an Empirical Comparison. INRIA report 1379, 1991.
 
4
5
 
6
7
 
8
E. Ochotta and T. Mukherjee, "Programmer's Guide to the Reconfigurable Simulated Annealing Library (anneal)," Report No. CMUCAD-94-35, Carnegie Mellon University, August 1994.
 
9
 
10
L. Ramachandran, D. D. Gajski, and V. Chaiyakul, "An Algorithm for Array Variable Clustering," Proc. of European Design and Test Conference (EDAC), 1994.
 
11
H. Schmit and D. E. Thomas, "Array Mapping for Behavioral Synthesis," Report No. CMUCAD-94-46, Carnegie Mellon University, October 1994.
 
12
 
13
 
14
 
15
 
16


Collaborative Colleagues:
Herman Schmit: colleagues
Donald E. Thomas: colleagues