TY - GEN
T1 - Requirements on the execution of Kahn process networks
AU - Geilen, M.C.W.
AU - Basten, T.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
U2 - 10.1007/3-540-36575-3_22
DO - 10.1007/3-540-36575-3_22
M3 - Conference contribution
SN - 3-540-00886-1
T3 - Lecture notes in computer science
SP - 319
EP - 334
BT - Programming Languages and Systems, 12th European Symposium on Programming, ESOP 2003, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003.
A2 - Degano, P.
PB - Springer
CY - Berlin, Germany
T2 - conference; ESOP 2003, Warsaw, Poland; 2003-04-07; 2003-04-11
Y2 - 7 April 2003 through 11 April 2003
ER -