Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
From MaRDI portal
Publication:4564088
DOI10.1109/TC.2008.58zbMath1390.68153OpenAlexW2165973617MaRDI QIDQ4564088
Marc Geilen, Twan Basten, Sander Stuijk
Publication date: 12 June 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2008.58
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (4)
A hybrid performance analysis technique for distributed real-time embedded systems ⋮ Complexity results for weighted timed event graphs ⋮ Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems ⋮ Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking
This page was built for publication: Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
