Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

DOI10.1109/TC.1987.5009446MaRDI QIDQ3742710zbMATH OpenOpenAlexFDO

Authors Edward A. Lee, David Gavin Messerschmitt

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1987.5009446

zbMATH Keywords

block diagramcomputation graphshard real-time systemsmultiprocessingPetri nets

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10) Communication, information (94A99)

Cited in

(21)

• Periodic schedules for linear precedence constraints
• A sufficient condition for the liveness of weighted event graphs
• Minimizing place capacities of weighted event graphs for enforcing liveness
• The complexity of multidimensional periodic scheduling
• A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications
• Assigning service requests in voice-over-internet gateway multiprocessors
• Formal verification of timed synchronous dataflow graphs using Lustre
• Algebraic quantitative semantics for efficient online temporal monitoring
• A compact DSP core with static floating-point arithmetic
• Resource control for synchronous cooperative threads
• Q-SCA: incorporating QoS support into software communications architecture for SDR waveform processing
• Combining extended retiming and unfolding for rate-optimal graph transformation
• Energy-optimal batching periods for asynchronous multistage data processing on sensor nodes: foundations and an mPlatform case study
• REGULAR STATE MACHINES
• CROSS cyclic resource-constrained scheduling solver
• Static optimal scheduling for synchronous data flow graphs with model checking
• Local consistency check in synchronous dataflow models
• Dynamic reconfigurations in frequency constrained data flow
• Keeping calm in the face of change. Towards optimisation of FRP by reasoning about change
• Parameterized dataflow (extended abstract)
• Uniprocessor scheduling of real-time synchronous dataflow tasks

This page was built for publication: Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742710)