Planning and Distribution Algorithm of Heterogeneous Resources in Industrial Telecommunication Networks with Ordered Sets of Tasks

Abstract

In this paper, an algorithm for planning and distribution heterogeneous resources in a stochastic system with ordered sets of tasks is proposed. Processing resources and memory resources are considered. The algorithm is based on the GERT-network model with a new parameter – a random variable of resource. A system consisting of many parallel processes is described in the model. Each process includes multiple tasks. By finding the start and end times of a pair of tasks it is possible to determine whether one task can start when another has finished. If the probability is satisfied for a given value, then that pair of tasks can be performed by the same processing resource unit. The ordered set of multiple sequential tasks is the desired outcome. Each set comes with a probability of completing all the tasks in the set with only one processing resource unit. The fewer the number of sets, the more resources are saved. However, it is necessary to consider the probability of the set. Accepting a certain level of risk can save a corresponding number of resources. To support the computation process, an algorithm to find the distribution laws of any arc in the GERT-network has been introduced. It speeds up the computation and allows selected arc located on the loop. Assuming that the memory resources are released as soon as the task is complete, the total memory resources for the system are recalculated. An example of the analysis process, planning and distribution resources in network devices is given.