ACM Home Page
Please provide us with feedback. Feedback
COSYN: hardware-software co-synthesis of embedded systems
Full text PdfPdf (75 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 34th annual Design Automation Conference table of contents
Anaheim, California, United States
Pages: 703 - 708  
Year of Publication: 1997
ISBN:0-89791-920-3
Authors
Bharat P. Dave  Department of Electrical Engineering, Princeton University, Princeton, NJ
Ganesh Lakshminarayana  Department of Electrical Engineering, Princeton University, Princeton, NJ
Niraj K. Jha  Department of Electrical Engineering, Princeton University, Princeton, NJ
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 51,   Citation Count: 39
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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/266021.266341
What is a DOI?

ABSTRACT

Hardware-software co-synthesis is the process ofpartitioning an embedded system specification into hardware andsoftware modules to meet performance, power and cost goals. Inthis paper, we present a co-synthesis algorithm which starts withperiodic task graphs with real-time constraints and produces a low-costheterogeneous distributed embedded system architecturemeeting the constraints. The algorithm has the following features:1) it allows the use of multiple types of processing elements (PEs)and inter-PE communication links, where the links can take variousforms (point-to-point, bus, local area network (LAN), etc.), 2) itsupports both concurrent and sequential modes of communicationand computation, 3) it allows both preemptive and non-preemptivescheduling, 4) it employs the concept of an association array totackle the problem of multi-rate systems (which are commonlyfound in multimedia applications), 5) it uses a scheduler based ondynamic deadline-based priority levels for accurate performanceestimation of a co-synthesis solution, 6) it uses a new taskclustering technique which takes the dynamic nature of the criticalpath, and the existence of multiple critical paths in the task graphinto account, and 7) if desired, it also optimizes the architecture forpower consumption (we are not aware of any other co-synthesisalgorithm that optimizes power). Application of the proposedalgorithm to examples from the literature and real-life telecomtransport systems shows its efficacy.


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
R.K. Gupta, Hardware-Software Co-synthesis of Digital Systems, Ph.D. thesis, Dept. of EE, Stanford University, 1994.
 
3
 
4
S. Prakash and A. Parker, "SOS: Synthesis of application-specific heterogeneous multiprocessor systems," J. Par. & Dist. Comput., pp. 338-351, Dec. 1992.
 
5
 
6
 
7
 
8
 
9
E. Lawler and C. Martel, "Scheduling periodically occurring tasks on multiple processors," Info~. Process. Letters, vol. 12, Feb. 1981.
 
10
S. Yajnik, S. Srinivasan and N. K. Jha, "TBFT: A task based fault tolerance scheme for distributed systems," in Proc. ISCA Int. Conf. Parallel & Distr. Comput. Syst., pp. 483-489, Oct. 1994.
 
11
B.P. Dave, G. Lakshminarayana, and N. K. Jha, "COSYN: Hardware-software co-synthesis of embedded systems," Tech. Rep., CE-J96-003, Dept. of EE, Princeton University, Oct. 1996.
 
12
V. Tiwari, S. Malik and A. Wolfe, "Compilation techniques for low energy: An overview," in Proc. Syrup. Low-Power Electronics, Oct. 1994.

CITED BY  39

Collaborative Colleagues:
Bharat P. Dave: colleagues
Ganesh Lakshminarayana: colleagues
Niraj K. Jha: colleagues