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

Pieter H. Hartel, Theo C. Ruys, Marc C.W. Geilen

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

    6 Citations (Scopus)
    59 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 publication2008 Formal Methods in Computer-Aided Design
    Subtitle of host publicationPortland, Oregon, USA, 17-20 November 2008
    EditorsA. Cimatti, R. Jones
    Place of PublicationPiscataway
    PublisherIEEE Computer Society
    Pages161-170
    Number of pages10
    ISBN (Print)978-1-4244-2735-2
    DOIs
    Publication statusPublished - Nov 2008
    Event8th International Conference on Formal Methods in Computer Aided Design 2008 - Portland, United States
    Duration: 17 Nov 200820 Nov 2008
    Conference number: 8

    Conference

    Conference8th International Conference on Formal Methods in Computer Aided Design 2008
    CountryUnited States
    CityPortland
    Period17/11/0820/11/08

    Keywords

    • SCS-Cybersecurity

    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

    Hartel, P. H., Ruys, T. C., & Geilen, M. C. W. (2008). Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow. In A. Cimatti, & R. Jones (Eds.), 2008 Formal Methods in Computer-Aided Design: Portland, Oregon, USA, 17-20 November 2008 (pp. 161-170). Piscataway: IEEE Computer Society. https://doi.org/10.1109/FMCAD.2008.ECP.25