A linear programming approach to general dataflow process network verification and dimensioning

In this paper, we present linear programming-based sufficient conditions, some of them polynomial-time, to establish the liveness and memory boundedness of general dataflow process networks. Furthermore, this approach can be used to obtain safe upper bounds on the size of the channel buffers of such...

Full description

Saved in:
Bibliographic Details
Published in:Electronic proceedings in theoretical computer science 2010-10, Vol.38 (Proc. ICE 2010), p.115-119
Main Authors: Sirdey, Renaud, Aubry, Pascal
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present linear programming-based sufficient conditions, some of them polynomial-time, to establish the liveness and memory boundedness of general dataflow process networks. Furthermore, this approach can be used to obtain safe upper bounds on the size of the channel buffers of such a network.
ISSN:2075-2180
2075-2180
DOI:10.4204/EPTCS.38.11