Skip to main content
SpringerLink
Log in

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

  • Published:
Cybernetics and Systems Analysis Aims and scope

Conclusion

The 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Efficiency of parallel computation with limited resources,” Dokl. Akad. Nauk SSSR,254, No. 3, 527–530 (1980).

    Google Scholar 

  2. Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computing System Design [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  3. A. Yu. Doroshenko, Mathematical Models and Methods for Organization of Parallel Macropipelined Computations [in Ukrainian], doctoral dissertation, Inst. Kibern. im. V. M. Glushkov NAN Ukr., Kiev (1997).

    Google Scholar 

  4. C. Nevison, “Teaching parallel computing using transputers,” in: V. E. Malyshkin (ed.), Parallel Computing Technologies, PaCT-93: Proc. Int. Conf., NT-Center, Moscow (1993), pp. 612–629.

    Google Scholar 

  5. Yu. V. Kapitonova, A. A. Letichevskii, P. S. Klyaus, and N. S. Kovalenko, “Execution time of asynchronous processes with macropipelined organization of computations,” Kibernetika, No. 6, 120-122 (1985).

  6. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theory of hardware and software design for multiprocessor computers,” Kibernetika, No. 6, 1–15 (1978).

  7. V. M. Glushkov, Yu. V. Kapitonova, A. A. Letichevskii, and S. P. Gorlach, “Macropipelined evaluation of functions on data structures,” Kibernetika, No. 4, 13–21 (1981).

Download references

Authors
  1. N. S. Kovalenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 150–158, September–October, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kovalenko, N.S. Macropipelined execution of asynchronous processes competing for a limited number of transfer channels. Cybern Syst Anal 34, 759–765 (1998). https://doi.org/10.1007/BF02667050

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02667050

Keywords

Search

Navigation