ACM Home Page
Please provide us with feedback. Feedback
Sensitivity-driven co-synthesis of distributed embedded systems
Full text Publisher SitePublisher Site PdfPdf (197 KB)
Source International Symposium on Systems Synthesis archive
Proceedings of the 8th international symposium on System synthesis table of contents
Cannes, France
Pages: 4 - 9  
Year of Publication: 1995
ISBN:0-89791-771-5
Authors
Ti-Yen Yen  Department of Electrical Engineering, Princeton University, Princeton, NJ
Wayne Wolf  Department of Electrical Engineering, Princeton University, Princeton, NJ
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): 4,   Downloads (12 Months): 16,   Citation Count: 16
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.224488
What is a DOI?

ABSTRACT

Abstract: Describes a new, sensitivity-driven algorithm for the co-synthesis of real-time distributed embedded systems. Many embedded computing systems are distributed systems: communicating periodic processes executing on several CPUs/ASICs connected by communication links. We use performance estimates to compute a local sensitivity of the design to process allocation. We propose a priority prediction method to schedule processes. Based on these techniques, we develop a gradient-search algorithm which co-synthesizes heterogeneous distributed systems of arbitrary topology and the associated application software architecture. Experimental results show that our algorithm can find good implementation architectures in small amounts of CPU time.


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
 
3
 
4
 
5
 
6
C. J. Hou and K. G. Shin. Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. In Proceedings, Real- Time Systems Symposium, 1982.
 
7
J. Y.-T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2, 1982.
8
 
9
M. C. McFarland, A. C. Parker, and R. Camposano. The high-level synthesis of digital systems. Proceedings of the IEEE, 78(2), February 1990.
 
10
D.-T. Peng and K. G. Shin. Static allocation of periodic tasks with precedence constraints. In Proceedings, International Conference on Distributed Computing Systems, 1989.
 
11
S. Prakash and A. C. Parker. SOS: synthesis of application-specific heterogeneous multiprocessor systems. Journal of Parallel and Distributed Computing, 16, 1992.
 
12
K. Ramamritham. Allocation and scheduling of complex periodic tasks. In Proceedings, International Conference on Distributed Computing Systems, 1990.
 
13
K. Ramamritham and J. A. Stankovic. Scheduling algorithms and operating systems support for realtime systems. Proceedings of the IEEE, 82(1), January 1994.
 
14
 
15
 
16
L. Sha, R. Rajkumar, and S. S. Sathaye. Generalized rate-monotonic scheduling theory: A framework for developing real-time systems. Proceedings o} the IEEE, 82(1), January 1994.
 
17
K. G. Shin and P. Ramanathan. Real-time computing: A new discipline of computer science and engineering. Proceedings o} the IEEE, 82(1), January 1994.
 
18
 
19
 
20

CITED BY  16