Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs

Adnan Bouakaz, Pascal Fradet, Alain Girault. Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs. In 2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), Vienna, Austria, April 11-14, 2016. pages 199-208, IEEE Computer Society, 2016. [doi]

@inproceedings{BouakazFG16,
  title = {Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs},
  author = {Adnan Bouakaz and Pascal Fradet and Alain Girault},
  year = {2016},
  doi = {10.1109/RTAS.2016.7461360},
  url = {http://doi.ieeecomputersociety.org/10.1109/RTAS.2016.7461360},
  researchr = {https://researchr.org/publication/BouakazFG16},
  cites = {0},
  citedby = {0},
  pages = {199-208},
  booktitle = {2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), Vienna, Austria, April 11-14, 2016},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4673-8641-8},
}