The problem of schedule construction in the joint design of hardware and software

Programming and Computer Software

Volumn 28, Issue 3, 2002, Pages 162-173

  Kostenko, V A ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11244355202     PISSN: 03617688     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015636230903     Document Type: Article

References (27)

1. 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.
2. Smelyanskii, R.L., An Invariant of Program Behavior, Vestn. Mask. Univ., Ser. 15, Vychisl. Mat. Kibern., 1990, no. 4, pp. 54-60.
3. Voevodin, V.V., Matematicheskie modeli i metody v parallel'nykh protsessakh (Mathematical Models and Methods in Parallel Processes), Moscow: Nauka, 1986.
4. 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.
5. 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.
6. 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.
7. 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.
8. Bellman, R. Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title Dinamicheskoe programmirovanie, Moscow: Inostrannaya Literature, 1960.
9. Bellman, R. Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title Dinamicheskoe programmirovanie, Moscow: Inostrannaya Literature, 1960.
10. Minoux, M., Mathematical Programming: Theory and Algorithms, Chichester: Wiley, 1986. Translated under the title Matematicheskoe programmirovanie. Teoriya i algoritmy, Moscow: Nauka, 1990.
11. Minoux, M., Mathematical Programming: Theory and Algorithms, Chichester: Wiley, 1986. Translated under the title Matematicheskoe programmirovanie. Teoriya i algoritmy, Moscow: Nauka, 1990.
12. Cormen, T.H., Leiserson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge, Mass.: MIT Press, 1990. Translated under the title Algoritmy: postroenie i analiz, Moscow: MTs NMO, 1999.
13. Cormen, T.H., Leiserson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge, Mass.: MIT Press, 1990. Translated under the title Algoritmy: postroenie i analiz, Moscow: MTs NMO, 1999.
14. Kostenko, V.A., A Technique for Automated Synthesis of Parallel Programs for Computer Systems with MIMD Architecture, Programmirovanie, 1993, no. 1, pp. 43-57.
15. Kostenko, V.A., Automated Development of Parallel Programs for Computer Systems with MIMD Architecture, Kibernetika i Sistemnyi Analiz, 1995, no. 5, pp. 170-179.
16. Kostenko, V.A., Romanov, V.G., and Smelyanskii, R.L., An Algorithm for Minimization of Hardware Resources in Computer Systems, Iskusstvennyi Intellekt (Artificial Intelligence), Donetsk: 2000, no. 2, pp. 383-388.
17. 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.
18. Batishchev, D.I., Gudman, E.D., Norenkov, I.P., and Prilutskii, M.Kh., Combining Heuristics for Solving Combinatorial Problems of Ordering and Distribution of Resources, Inf. Tekhnol., 1997, no. 2, pp. 29-32.
19. Norenkov, I.P., Heuristics and Their Combination in Genetic Methods of Discrete Optimization, Inf. Tekhnol., 1999, no. 1.
20. Holland, J.N., Adaptation in Natural and Artificial Systems, Ann Arbor: Univ. of Michigan Press, 1975.
21. Michalcwicz, Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer, 1999, third edition.
22. Kostenko, V.A., Principles for the Construction of Genetic Algorithms and Application to Optimization Problems, Proc. IV Int. Conf. Discrete Models in Control System Theory, Moscow: MAKS, 2000, pp. 49-55.
23. Obozrenie prikladnoi matematiki. Evolyntsionnye vychisleniya i geneticheskie algoritmy (Survey of Applied Mathematics: Evolution Computations and Genetic Algorithms), Ser. Melody optimizatsii (Optimization Methods), 1996, vol. 3, issue 5.
24. 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.
25. 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.
26. Kostenko, V.A., Optimization Algorithms Based on Trial-and-Error Approach in Joint Design of Hardware and Software, Trudy Vserossiiskoi nauchnoi konferentsii "Vysokoproizvoditel'nye vychisleniya i ikh prilozheniya," (All-Russia Conf. on High-Performance Computations and Their Applications), Chernogolovka, Mosk. Gos. Univ., 2000, pp. 123-127.
27. Rastrigin, L.A., Statisticheskie melody poiska, (Statistical Search Methods), Moscow: Nauka, 1968.