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

Pieter H. Hartel; Theo C. Ruys

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

Pieter H. Hartel
, Theo C. Ruys

Research output: Book/Report › Report › Professional

129 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 language	English
Place of Publication	Enschede
Publisher	Centre for Telematics and Information Technology (CTIT)
Number of pages	10
Publication status	Published - 11 May 2008

Publication series

Name	CTIT Technical Report Series
Publisher	Centre for Telematics and Information Technology, University of Twente
No.	TR-CTIT-08-16
ISSN (Print)	1381-3625

Keywords

SCS-Cybersecurity

Access to Document

ReportFinal published version, 241 KB

Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow
Hartel, P. H., Ruys, T. C. & Geilen, M. C. W., Nov 2008, 2008 Formal Methods in Computer-Aided Design: Portland, Oregon, USA, 17-20 November 2008. Cimatti, A. & Jones, R. (eds.). Piscataway, NJ: IEEE, p. 161-170 10 p.
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Open Access
File
7 Link opens in a new tab Citations (Scopus)

133 Downloads (Pure)

Cite this

@book{331fc625a3b24916b982514fca84879e,

title = "Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow: (with appendix)",

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.",

keywords = "SCS-Cybersecurity",

author = "Hartel, \{Pieter H.\} and Ruys, \{Theo C.\}",

year = "2008",

month = may,

day = "11",

language = "English",

series = "CTIT Technical Report Series",

publisher = "Centre for Telematics and Information Technology (CTIT)",

number = "TR-CTIT-08-16",

address = "Netherlands",

}

TY - BOOK

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

T2 - (with appendix)

AU - Hartel, Pieter H.

AU - Ruys, Theo C.

PY - 2008/5/11

Y1 - 2008/5/11

N2 - 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.

AB - 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.

KW - SCS-Cybersecurity

M3 - Report

T3 - CTIT Technical Report Series

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

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -

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

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Research output

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

Cite this