Evaluation of the mean cycle time in fork-join queueing networks

被引：0

作者：

Krivulin, N.K.

机构：

来源：

Vestnik Sankt-Peterburgskogo Universiteta. Ser 1. Matematika Mekhanika Astronomiya | 2002年 / 03期

关键词：

Algebra - Graph theory - Parameter estimation - Queueing theory - Scheduling - Topology;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The problem of evaluating the mean service time in fork-join queueing networks is considered. An approach is proposed based on implementation and further development of methods and techniques of the idempotent algebra theory. It is shown that for acyclic fork-join networks under fairly general conditions, the mean cycle time is determined only by the mean service times in the network nodes, and it does not depend on the network topology.

引用

页码：27 / 35