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

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

2010-10-27

arxiv.org/abs/1010.5573v1

EPTCS 38, 2010, pp. 115-119

Computer Science

Distributed, Parallel, and Cluster Computing

In Proceedings ICE 2010, arXiv:1010.5308

Scientific paper

10.4204/EPTCS.38.11

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.

Affiliated with

Also associated with

No associations

Rating

A linear programming approach to general dataflow process network verification and dimensioning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A linear programming approach to general dataflow process network verification and dimensioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A linear programming approach to general dataflow process network verification and dimensioning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484658