Requirements on the execution of Kahn process networks

  • Authors:
  • Marc Geilen;Twan Basten

  • Affiliations:
  • Dept. of Elec. Eng., Eindhoven University of Technology, The Netherlands;Dept. of Elec. Eng., Eindhoven University of Technology, The Netherlands

  • Venue:
  • ESOP'03 Proceedings of the 12th European conference on Programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Kahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criteria for correct scheduling of their realisations. In [12], Parks shows how process networks can be scheduled in bounded memory; the proposed method is used in many implementations of KPNs. However, it does not result in the correct behaviour for all KPNs. We investigate the requirements for a scheduler to guarantee both correct and bounded execution of KPNs and present an improved scheduling strategy that satisfies them.