Scheduling optimisations for SPIN to minimise buffer requirements in synchronous data flow.

P.H. Hartel, T.C. Ruys, M.C.W. Geilen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)
89 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationFormal Methods in Computer-Aided Design, 2008. FMCAD '08, 17-20 November 2008
EditorsA. Cimatti, R.B. Jons
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
Pages1-10
ISBN (Print)978-1-4244-2735-2
DOIs
Publication statusPublished - 2008

Fingerprint

Dive into the research topics of 'Scheduling optimisations for SPIN to minimise buffer requirements in synchronous data flow.'. Together they form a unique fingerprint.

Cite this