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


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. In: 8th Int. Conf. on Formal Methods in Computer Aided Design (FMCAD), 17-20 Nov. 2008, Portland, Oregon.

[img]
Preview
PDF
163Kb
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:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65126
Official URL:http://dx.doi.org/10.1109/FMCAD.2008.ECP.25
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 252119