Abstract
Locally optimal algorithms for designing schedules for program execution on multiprocessors based on Hopfield networks are considered. Results of the numerical investigations of these algorithms are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Computer and Job-Shop Scheduling Theory, Coffman, E.G., Jr., Ed., New York: Wiley, 1976. Translated under the title Teoriya raspisanii i vychislitel'nye mashiny, Moscow: Nauka, 1984.
Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel'nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
Kostenko, V.A., Constructing Schedules in Joint Design of Hardware and Software for Real-Time Computer Systems, Proc. of Int. Conf. Parallel Computing and Control Problems, Moscow, 2001, Institute of Control Sciences, pp. 125-141.
Kostenko, V.A., Synthesis of Architectures: Formalization, Specific Features, and Capabilities of Various Methods, Programmnye sistemy i instrumenty (Software Systems and Tools), Moscow: MAKS, 2000, no. 1, pp. 31-41.
Kostenko, V.A., Smelyanskii, R.L., and Trekin, A.G., Synthesizing Structures of Real-Time Computer Systems Using Genetic Algorithms, Programmirovanie, 2000, no. 5, pp. 63-72.
Hopfield, J.J., Neural Networks and Physical Systems with Emergent Collective Computational Abilities, Proc. of the National Academy of Science, 1982.
Wasserman, P.D., Neural Computing: Theory and Practice, New York: Van Nostrand Reinhold, 1989. Translated under the title Neirokomp'yuternaya tekhnika. Teoriya i praktika, Moscow: Mir, 1992.
Smelyanskii, R.L., An Invariant of Program Behavior, Vestn. Mosk. Univ., Ser. 15, Vychisl. Mat. Kibern., 1990, no. 4, pp. 54-60.
Smelyanskii, R.L., A Model of the Operation of Distributed Computer Systems, Vestn. Mosk. Univ., Ser. 15, Vychisl. Mat. Kibern., 1990, no. 3, pp. 3-21.
Kostenko, V.A., The Problem of Schedule Construction in the Joint Design of Hardware and Software, Programmirovanie, 2002, no. 3, pp. 1-16.
Kostenko, V.A., Representation and Transformation of Schedules in Iterative Algorithms, Programmnye sistemy i instrumenty (Software Systems and Tools), Moscow: MAKS, 2001, no. 2, pp. 53-69.
Brucker, P., Hurink, J., and Werner, F., Improving Local Search Heuristics for Some Scheduling Problems, Discrete Appl. Math., 1997, no. 72, pp. 34-72.
Grigor'eva, N.S. and Fedorova, I.A., Local Search Algorithms for the Parallel Ordering Problem, Trudy mezhdunarodnoi shkoly-seminara "Diskretnaya matematika i matematicheskaya kibernetica" (Proc. Int. Seminar on Discrete Mathematics and Mathematical Cybernetics), Moscow: MAKS, 2001, p. 18.
Kostenko, V.A., Romanov, V.G., and Smelyanskii, R.L., An Algorithm for Minimization of Hardware Resources in Computer Systems, Iskusstvennyi intellect (Artificial Intelligence), Donetsk: 2000, no. 2, pp. 383-388.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kostenko, V.A., Vinokurov, A.V. Locally Optimal Algorithms for Designing Schedules Based on Hopfield Networks. Programming and Computer Software 29, 199–209 (2003). https://doi.org/10.1023/A:1024918625291
Issue Date:
DOI: https://doi.org/10.1023/A:1024918625291