A linear programming approach to general dataflow process network verification and dimensioning
Distributed, Parallel, and Cluster Computing
2010-10-28 v1 Software Engineering
Abstract
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.
Keywords
Cite
@article{arxiv.1010.5573,
title = {A linear programming approach to general dataflow process network verification and dimensioning},
author = {Renaud Sirdey and Pascal Aubry},
journal= {arXiv preprint arXiv:1010.5573},
year = {2010}
}
Comments
In Proceedings ICE 2010, arXiv:1010.5308