Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow


Synchronous data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling optimisations. We extend related work on using SPIN to experiment with scheduling optimisations aimed at minimising buffer requirements. We show that for a benchmark of commonly… (More)
DOI: 10.1109/FMCAD.2008.ECP.25


9 Figures and Tables