Conference proceeding
Analyzing the real-time properties of a dataflow execution paradigm using a synthetic aperture radar application
Proceedings Third IEEE Real-Time Technology and Applications Symposium, pp.60-71
1997
DOI: 10.1109/RTTAS.1997.601344
Abstract
Real-time signal processing applications are commonly designed using a data flow software architecture. The author attempts to understand fundamental real-time properties of such an architecture-the Navy's coarse-grain processing graph method (PGM). By applying recent results in real-time scheduling theory to the subset of PGM employed by the ARPA RASSP Synthetic Aperture Radar benchmark application, he identifies inherent real-time properties of nodes in a PGM data flow graph, and demonstrates how these properties can be exploited to perform useful and important system-level analyses such as schedulability analysis, end-to-end latency analysis, and memory requirements analysis. More importantly, he develops relationships between properties such as latency and buffer bounds and show how one may be traded-off for the other. The results assume only the existence of a simple EDF scheduler and thus can be easily applied in practice.
Details
- Title: Subtitle
- Analyzing the real-time properties of a dataflow execution paradigm using a synthetic aperture radar application
- Creators
- S Goddard - University of North Carolina at Chapel Hill
- Resource Type
- Conference proceeding
- Publication Details
- Proceedings Third IEEE Real-Time Technology and Applications Symposium, pp.60-71
- Publisher
- IEEE
- DOI
- 10.1109/RTTAS.1997.601344
- ISSN
- 1080-1812
- eISSN
- 2375-5342
- Language
- English
- Date published
- 1997
- Academic Unit
- Computer Science
- Record Identifier
- 9984259412002771
Metrics
5 Record Views