SCHEDULING SEQUENTIAL PROCESSES IN TREE NETWORKS

Călin Ciufudean, Constantin Filote, Adrian Graur, George Mahalu

Abstract

In this paper we focus on the problem of scheduling time-critical data flow over a measuring tree network. We assume that data are operated in discrete time and their arrival and deadline processes are arbitrary. Our goal is to determine a policy which transmits data with minimum extension time at every node (every link) in a tree network. The models existing in the literature do not consider simultaneous performance of various hardware components of a complex system. When a hardware component of the system fails, the system reconfiguration is often less than perfect. On this assumption we introduce an algorithm to model the availability of measuring systems with colored Petri nets (CPN). Regarding the fact that the availability of a measuring cell i (or branch in the network) is calculated with Markov chains, we model our system with stochastic CPN. The utility of our approach in alleviating the computational burden of measuring systems availability is illustrated via a Markov chain structure.

Keywords

tree networks, optimal scheduling, colored Petri nets, Markov chains

Download

IMEKO-TC4-2004-062.pdf

DOI

-

IMEKO TC

TC4 - Measurement of Electrical Quantities

Back to the proceedings