Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow (with appendix)

Share/Save/Bookmark

Hartel, P.H. and Ruys, T.C. and Geilen, M.C.W. (2008) Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow (with appendix). [Report]

[img]
Preview
PDF
240Kb
Abstract: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 used case studies the performance of our SPIN based scheduler is comparable to that of state of the art research tools. The key to success is using the semantics of SDF to prove when using (even unsound and/or incomplete) optimisations are justified. The main benefit of our approach lies in gaining deep insight in the optimisations at relatively low cost.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64675
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 250902