Managing Latency and Buffer Requirements in Processing Graph Chains

@article{Goddard2001ManagingLA,
  title={Managing Latency and Buffer Requirements in Processing Graph Chains},
  author={Steve Goddard and Kevin Jeffay},
  journal={Comput. J.},
  year={2001},
  volume={44},
  pages={486-503}
}
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… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
18 Citations
19 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Managing Latency and Buffer Requirements in Processing Graph Chains

  • S. Goddard, K. Jeffay
  • Technical Report UNL-CSE-00-530,
  • 2000
2 Excerpts

Software Synthesis from Dataflow Graphs

  • S. S. Bhattacharyya, P. K. Murthy, E. A. Lee
  • 1996
3 Excerpts

Similar Papers

Loading similar papers…