Managing latency and buffer requirements in processing graph chains

Computer Journal

Volumn 44, Issue 6, 2001, Pages 486-503

  Goddard, Steve ^a   Jeffay, Kevin ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b University of North Carolina   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BUFFER STORAGE; RAPID PROTOTYPING; REAL TIME SYSTEMS; SIGNAL PROCESSING; SOFTWARE PROTOTYPING;

PROCESSING GRAPH METHOD (PGM);

SOFTWARE ENGINEERING;

EID: 0035659186     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/44.6.486     Document Type: Article

References (20)

1. Static scheduling of synchronous data flow programs for digital signal processing
2. The synthesis of real-time systems from processing graphs
3. Distributed pipeline scheduling: A framework for distributed, heterogeneous real-time system design
4. A timing-driven design and validation methodology for embeded real-time systems
5. Ptolemy: A framework for simulating and prototyping heterogeneous systems
6. Scheduling for optimum data memory compaction in block diagram oriented software synthesis
7. Managing memory requirements in the synthesis of real-time systems from processing graphs
8. Guaranteeing real-time requirements with resource-based calibration of periodic processes
9. SAR processing for RASSP application
10. The ESTEREL synchronous programming language and its mathematical semantics
11. A theory of rate-based execution
12. Algorithms and complexity concerning the preemptively scheduling of periodic, real-time tasks on one processor
13. Scheduling algorithms for multiprogramming in a hard-real-time environment
14. On latency management in time-shared operating systems
15. Analyzing the real-time properties of a U.S. navy signal processing system