Managing Latency and Buffer Requirements in Processing Graph Chains

S.M. Goddard and K. Jeffay
The Computer Journal
Volume 44, Number 6, 2001
pages 486-503.

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.

Get a PostScript - or - a PDF copy of this paper.

Back to Real-Time Systems Research at UNC page.