DocumentCode
2779163
Title
The synthesis of real-time systems from processing graphs
Author
Goddard, Steve ; Jeffay, Kevin
Author_Institution
Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA
fYear
2000
fDate
2000
Firstpage
177
Lastpage
186
Abstract
Directed graphs, called processing graphs, are a standard design aid for complex real-time systems. The primary problem in developing real-time systems with processing graphs is transforming the processing graph into a predictable real-time system in which latency can be managed. Software engineering techniques are combined with real-time scheduling theory to solve this problem. In the parlance of software engineering methodologies, a synthesis method is presented. New results on managing latency in the synthesis of real-time systems from cyclic processing graphs are also presented. The synthesis method is demonstrated with an embedded signal processing application for an anti-submarine warfare (ASW) system
Keywords
data flow graphs; directed graphs; embedded systems; software engineering; anti-submarine warfare system; cyclic processing graphs; directed graphs; embedded signal processing; latency; processing graphs; real-time scheduling theory; real-time systems synthesis; software engineering; Aging; Application software; Computer science; Delay; Design engineering; Processor scheduling; Real time systems; Signal processing; Signal synthesis; Software engineering;
fLanguage
English
Publisher
ieee
Conference_Titel
High Assurance Systems Engineering, 2000, Fifth IEEE International Symposim on. HASE 2000
Conference_Location
Albuquerque, NM
Print_ISBN
0-7695-0927-4
Type
conf
DOI
10.1109/HASE.2000.895457
Filename
895457
Link To Document