Macropipelined execution of asynchronous processes competing for a limited number of transfer channels

• Published in: Cybernetics and systems analysis Vol. 34; no. 5; pp. 759 - 765
• Main Author: Kovalenko, N. S.
• Format: Journal Article
• Language: English
• Published: New York Springer Nature B.V 01.09.1998
• Subjects: Balancing; Channels; Computing time; Mathematical analysis; Mathematical models; Microprocessors; Processors
• ISSN: 1060-0396; 1573-8337
• DOI: 10.1007/BF02667050

ConclusionThe mathematical model of execution of asynchronous competing processes in a macropipelined MS considered in this article makes it possible to estimate the minimum overall execution time of given volumes of computation and to find the optimal balancing of transfer and computing, the ratio of the number of processors and channels in the MS. Moreover, the proposed mathematical model and the derived balancing conditions fully corroborate the basic principle of macropipelined computation advanced previously by Glushkov [6]. This principle states that when the work is allocated to processors, each processor is assigned in the current step a task that will keep it busy for the longest possible time without requiring interaction with other processors.Further research of this model can proceed in several directions. First, it is very interesting to determine the total idle time of the processors due to busy channels, and also the “idle” time of transfer blocks. Second, it is relevant to calculate the efficiency of the macropipelined method of computation. A similar study of efficiency estimates has been previously conducted in [7]. Third, it is necessary to derive formulas for the total computing time and the corresponding balancing conditions for other classes of competing processes and various operating regimes of channels and processors.