Abstract
A model of a computational process with loops and branchings, viz., a bilogic graph, is studied. An algorithm for partitioning a bilogic graph into a sequence of linear segments is described. A class of graphs is distinguished, for which the set of all staticodynamic schedules coincides with the set of schedules for the sequence of linear segments.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
K. V. Shakhbazyan, T. A. Tushkina, V. S. Sokhranskaya, and L. M. Tovkach, “Experiment on the realization of scheduling algorithms for multiprocessor systems,” Upr. Sistemy Mashiny, No. 3, 84–85 (1975).
K. V. Shakhbazyan, T. A. Tushkina, and V. S. Sokhranskaya, “Statistical tests of various scheduling methods for multiprocessor systems,” Programmirovanie, No. 4, 91–100 (1976).
T. A. Tushkina, “Methods and programs for the generation of random graphs,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,54, 295–264 (1975).
D. Martin and G. Estrin, “Experiments on models of computations and systems,” IEEE Trans. Electron. Computers,EC-16, No. 1, 59–69 (1967).
A. P. Ryzhkov, “Legal bilogic graph model of a parallel computation process and its properties,” Izv. Akad. Nauk SSSR, Tekh. Kibern., No. 2, 96–104 (1976).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdelenlya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 90, pp. 210–226, 1979
Rights and permissions
About this article
Cite this article
Sokhranskaya, V.S., Tushkina, T.A. Paralleling of computational processes with loops and branchings. J Math Sci 20, 2055–2067 (1982). https://doi.org/10.1007/BF01680570
Issue Date:
DOI: https://doi.org/10.1007/BF01680570