Journal article
Managing latency and buffer requirements in processing graph chains
Computer journal, Vol.44(6), pp.486-503
01/01/2001
DOI: 10.1093/comjnl/44.6.486
Abstract
Real-time signal-processing applications for high assurance systems are commonly designed using a processing-graph software architecture. Here we demonstrate the management of latency and buffer requirements in such an architecture-the US Navy's processing graph method (PGM). By applying recent results in real-time scheduling theory to the subset of PGM employed by the US DARPA rapid prototyping of application-specific signal processors (RASSP) synthetic aperture radar (SAR) benchmark application, we identify inherent real-time properties of nodes in a PGM graph, and demonstrate 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, we develop relationships between properties such as latency and buffer bounds and show how one may be traded off for the other.
Details
- Title: Subtitle
- Managing latency and buffer requirements in processing graph chains
- Creators
- S Goddard - University of Nebraska–LincolnK Jeffay
- Resource Type
- Journal article
- Publication Details
- Computer journal, Vol.44(6), pp.486-503
- Publisher
- Oxford Univ Press
- DOI
- 10.1093/comjnl/44.6.486
- ISSN
- 0010-4620
- eISSN
- 1460-2067
- Number of pages
- 18
- Language
- English
- Date published
- 01/01/2001
- Academic Unit
- Computer Science
- Record Identifier
- 9984259439002771
Metrics
12 Record Views