Analyzing the real-time properties of a U.S. Navy signal processing system

The state of the art in verifying the real-time requirements of applications developed using general processing graph models relies on simulation or off-line scheduling. We extend the state of the art by presenting analytical methods that support the analysis of cyclic processing graphs executed with on-line schedulers. We show that it is possible to compute the latency inherent in a processing graph independent of the hardware hosting the application. We also show how to compute the real-time execution rate of each node in the graph. Using the execution rate of each node and the time it takes per execution on a given processor, the resulting CPU utilization can be computed as shown here for the Directed Low Frequency Analysis and Recording (DIFAR) acoustic signal processing application from the Airborne Low Frequency Sonar (ALFS) system of the SH-60B LAMPS MK III anti-submarine helicopter.

[1]  Kevin Jeffay,et al.  On the management of latency in the synthesis of real-time signal processing systems from processing graphs , 1998 .

[2]  Jay K. Strosnider,et al.  Distributed Pipeline Scheduling: A Framework for Distributed, Heterogeneous Real-Time System Design , 1995, Comput. J..

[3]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[4]  Edward A. Lee,et al.  Ptolemy: A Framework for Simulating and Prototyping Heterogenous Systems , 2001, Int. J. Comput. Simul..

[5]  Heinrich Meyr,et al.  High performance DSP software using data-flow graph transformations , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

[6]  Steve Goddard.  Analyzing the real-time properties of a dataflow execution paradigm using a synthetic aperture radar application , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[7]  Rajesh K. Gupta,et al.  A timing-driven design and validation methodology for embedded real-time systems , 1998, TODE.

[8]  Sanjoy K. Baruah,et al.  Feasibility concerns in PGM graphs with bounded buffers , 1997, Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168).

[9]  Richard Gerber,et al.  Guaranteeing Real-Time Requirements With Resource-Based Calibration of Periodic Processes , 1995, IEEE Trans. Software Eng..

[10]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[11]  Heinrich Meyr,et al.  Scheduling for optimum data memory compaction in block diagram oriented software synthesis , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[12]  R. Karp,et al.  Properties of a model for parallel computations: determinacy , 1966 .

[13]  Gérard Berry,et al.  The ESTEREL Synchronous Programming Language and its Mathematical Semantics , 1984, Seminar on Concurrency.

[14]  Edward A. Lee,et al.  Software Synthesis from Dataflow Graphs , 1996 .

[15]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[16]  Steve Goddard,et al.  Managing memory requirements in the synthesis of real-time systems from processing graphs , 1998, Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245).