Abstract
An algorithm for optimal grouping blocks of a structured program resource in systems of distributed competing processes is proposed.
Similar content being viewed by others
References
Voevodin, V.V. and Voevodin, Vl.V., Parallel’nye vychisleniya (Parallel Computing), St. Petersburg: BKhV-Peterburg, 2002.
Kovalenko, N.S. and Samal’, S.A., Vychislitel’nye metody realizatsii intellektual’nykh modelei slozhnykh sistem (Computational Methods of Implementation of Intelligent Models of Complex Systems), Minsk: Belaruskaya navuka, 2004.
Toporkov, V.V., Modeli raspredelennykh vychislenii (Distributed Computing Models), Moscow: Fizmatlit, 2004.
Ivannikov, V.P., Kovalenko, N.S., and Metel’skii, V.M., On the Minimal Time Required for Execution of Distributed Concurrent Processes in Synchronous Modes, Programming Comput. Software, 2000, vol. 26, no. 5, pp. 268–274.
Kapitonova, Yu.V., Kovalenko, N.S., and Pavlov, P.A., Optimality of Systems of Equally Distributed Competing Processes, Kibern. sistemnyi analiz, 2005, no. 6, pp. 3–10.
Pavlov, P.A., Efficiency of Distributed Computing in Scalable Systems, Nauchno-tekhnicheskie vedomosti SPbGPU, 2010, no. 1, pp. 83–89.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © N.S. Kovalenko, P.A. Pavlov, 2012, published in Programmirovanie, 2012, Vol. 38, No. 3.
Rights and permissions
About this article
Cite this article
Kovalenko, N.S., Pavlov, P.A. Optimal grouping algorithm of identically distributed systems. Program Comput Soft 38, 143–149 (2012). https://doi.org/10.1134/S0361768812030036
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768812030036