A Method for Estimating the Execution Time of Computer Programs in Automated Information Transmission Systems

Abstract

This article presents the development of mathe matical models for evaluating the execution time of computer programs within two distinct classes of computational resources (CR) in Automated Communication Systems (ACS): (i) systems characterized by a multistage program execution process, and (ii) systems operating with finite load source devices and unreliable components. The primary objective is to derive analytical ex pressions for computing key time-related characteristics—such as execution delay, waiting time, and system throughput—by modeling these CRs as multi-phase queueing systems. Two time allocation strategies are considered: fixed-priority scheduling and cyclic weighted execution. The models capture both the structural complexity and timing behavior under varying processor loads and service priorities. Comparative simulation results confirm the effectiveness and accuracy of the proposed models, highlighting their advantages over conventional static estimation approaches. The proposed framework provides a robust foundation for opti mizing scheduling policies and improving timing predictability in real-time control environments, particularly in critical automated communication networks and embedded systems.

Keywords