Оцінювання надійності паралельних обчислювальних систем під час виконання заданого комплексу взаємопов’язаних робіт

Simple item page
dc.citation.epage23
dc.citation.issue1
dc.citation.journalTitleКомп’ютерні системи та мережі
dc.citation.spage15
dc.citation.volume1
dc.contributor.affiliationНаціональний університет “Львівська політехніка”
dc.contributor.affiliationLviv Polytechnic National University
dc.contributor.authorКлушин, Ю. С.
dc.contributor.authorKlushyn, Y.
dc.coverage.placenameЛьвів
dc.coverage.placenameLviv
dc.date.accessioned2021-04-20T11:41:56Z
dc.date.available2021-04-20T11:41:56Z
dc.date.created2019-03-01
dc.date.issued2019-03-01
dc.description.abstractПід час проектування паралельної обчислювальної системи для виконання заданого комплексу взаємопов’язаних робіт важливою характеристикою є її надійність. Але крім основних показників надійності обчислювальної системи, забезпечених технічними засобами, існує ще показник надійності системи, який оцінює придатність паралельної обчислювальної системи до вирішення конкретних задач за визначений час. Це оцінювання безпосередньо пов’язане з ефективністю використання обчислювальних систем.
dc.description.abstractWhen designing a parallel computing system for completing a given set of interactions, the robot is an important characteristic of social security. As well as the basic indicators of the higher number of computing systems, to protect yourself from technical problems, the main indicator of the higher value of the system is to assess the accuracy of the parallel calculation system of specific tasks. Tsya otsinka seamlessly due to the effectiveness of vikoristannya obzumyudlyavnyh systems.
dc.format.extent15-23
dc.format.pages9
dc.identifier.citationКлушин Ю. С. Оцінювання надійності паралельних обчислювальних систем під час виконання заданого комплексу взаємопов’язаних робіт / Ю. С. Клушин // Комп’ютерні системи та мережі. — Львів : Видавництво Львівської політехніки, 2019. — Том 1. — № 1. — С. 15–23.
dc.identifier.citationenKlushyn Y. Assessment of reliability of parallel computer systems at performance of the chosen complex of related works / Y. Klushyn // Kompiuterni systemy ta merezhi. — Lviv : Lviv Politechnic Publishing House, 2019. — Vol 1. — No 1. — P. 15–23.
dc.identifier.issn2707-2371
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/56353
dc.language.isouk
dc.publisherВидавництво Львівської політехніки
dc.publisherLviv Politechnic Publishing House
dc.relation.ispartofКомп’ютерні системи та мережі, 1 (1), 2019
dc.relation.references1. Kuznetsov P. A. On the issue of analysis of the ef ectiveness of systems with full redundancy. Bulletin of SibSAU, t. 16, No. 2, p. 326–330, 2015.
dc.relation.references2. Pullum L. L. Software fault tolerance techniques and implementation. Artech House, 2001. 360 p.
dc.relation.references3. Roganov V. R., Grishko A. K., Kochegarov A. K. Three Approaches to evaluating the Performance of active Reservation Systems. DOI 10.21685/2307-4205-2019-2-2.
dc.relation.references4. Chu W. W., Leung K. K. Module replication and assignment for real-time distributed processing system // “Proc IEEE”. 1987. 75. Nо. 5. pp. 547–562.
dc.relation.references5. Khritankov A. S. Mathematical model of performance characteristics of distributed computing systems. Computer science, management, economics. WORKS OF MIPT. 2010. Volume 2, No. 1 (5), p. 110–115.
dc.relation.references6. Ivutin A. N., Larkin E. V. Prediction of the execution time of the algorithm. Magazine. News of TSU. Technical science. Issue number 3/2013. C. 301–315.
dc.relation.references7. Bocharov P. L., Ignatushchenko V. V. Mathematical models and methods for evaluating the ef ectiveness of parallel computing systems on complexes of interrelated works // Tez. report international conf, “High-Performance Computing Systems in Management and Scientific Research”, Alma-Ata, 1991.
dc.relation.references8. Margalitashvili A. L. Investigation of the effectiveness of the functioning of parallel computing resources on given complexes of interrelated works, Abstract of Cand. dis. M.: In-t prbblem management, 1990.
dc.relation.references9. Bocharov P. L., Preydunov Yu. V. Estimation of the execution time of a complex of works on a parallel computational system // System analysis and computer science. Sat scientific papers. M.: Publishing house DN, 1991. C. 29–41.
dc.relation.references10. Ingatushchenko V. V. Organization of structures for controlling multiprocessor computing systems. Moscow: Energoatomizdat, 1984.
dc.relation.references11. Kumar S., Cohen P. R. Towards a fault-tolerant multi-agent system architecture. In: Proceedings of the Fourth International Conference on Autonomous Agents. ACM, 2000, pp. 459–466. DOI:10.1145/336595.337570.
dc.relation.references12. Guessoum Z., Briot J. P., Faci N. Towards Fault-Tolerant Massively Multiagent Systems. In: Massively Multi-Agent Systems I. Springer Berlin Heidelberg, 2005. P. 55–69. (Ser. Lecture Notes in Computer Science; vol. 3446). DOI: 10.1007/11512073_5.
dc.relation.references13. Serugendo G. D.M., Romanovsky A. Designing Fault-Tolerant Mobile Systems. In: Scientific Engineering for Distributed Java Applications. Springer Berlin Heidelberg, 2003. P. 185–201. (Ser. Lecture Notes in Computer Science; vol. 2604). DOI: 10.1007/3-540-36520-6_17.
dc.relation.references14. Mellouli S. A Reorganization Strategy to Build Fault-Tolerant Multi-Agent Systems. In: Advances in Artificial Intelligence. Springer Berlin Heidelberg, 2007. P. 61–72. (Ser. Lecture Notes in Computer Science; vol. 4509). DOI: 10.1007/978-3-540-72665-4_6.
dc.relation.references15. Ignatushchenko V. V., Klushin Y. S. Prediction of the implementation of complex software systems on parallel computers: direct stochastic modeling // Automation and Remote Control. 1994. N 12, p. 142–157.
dc.relation.references16. Klushin, Y. S. Prediction of the implementation of complex software systems on parallel computers // Proc. Report Second Ukrainian Conference on Automatic Control “Automation-95”. Lviv, 1995, vol. 2, p. 100.
dc.relation.references17. Ignatushchenko V. V., Klushin Yu. S. Forecasting the implementation of complex software systems on control parallel computers: exact methods // Scientific works of the International Symposium “Automated Control Systems”, Tbilisi: ed. Intellect, 1996, p. 23–28.
dc.relation.references18. Klushin Y. S. Evaluation of the ef ectiveness of various dispatching disciplines for reducing the time to perform complex software systems on parallel computing systems / Bulletin of National University “Lviv Polytechnic” No. 413. Computer engineering and information technology. Lviv: NU “LP”, 2000. p. 19–23.
dc.relation.references19. Gross, D., Miller, D., Transition Markov processes // Operations Research. 1984. Vol. 32. No. 4. P. 334–361.
dc.relation.references20. Reibman A. L., Trivedi K. S. Numerical transient analysis of Markov models // Computers and Operations Research. 1988. Vol. 15. No. 1. P. 19–36.
dc.relation.references21. Klushin, Y. S. Software implementation of mathematical models, methods and algorithms for estimating the time of execution of complex software complexes in multiprocessor computer systems. Bulletin of NU “Lviv Polytechnic” № 905. Computer systems and networks. Lviv: NU “LP”, 2018.
dc.relation.references22. Klushin, Y. S. Improving the accuracy of estimating the execution time of folding software systems in multiprocessor computer systems for belt stochastic modeling. Bulletin of NU “Lviv Polytechnic” No. 881. Computer systems and networks. Lviv: NU “LP”, 2017.
dc.relation.referencesen1. Kuznetsov P. A. On the issue of analysis of the ef ectiveness of systems with full redundancy. Bulletin of SibSAU, t. 16, No. 2, p. 326–330, 2015.
dc.relation.referencesen2. Pullum L. L. Software fault tolerance techniques and implementation. Artech House, 2001. 360 p.
dc.relation.referencesen3. Roganov V. R., Grishko A. K., Kochegarov A. K. Three Approaches to evaluating the Performance of active Reservation Systems. DOI 10.21685/2307-4205-2019-2-2.
dc.relation.referencesen4. Chu W. W., Leung K. K. Module replication and assignment for real-time distributed processing system, "Proc IEEE". 1987. 75. No. 5. pp. 547–562.
dc.relation.referencesen5. Khritankov A. S. Mathematical model of performance characteristics of distributed computing systems. Computer science, management, economics. WORKS OF MIPT. 2010. Volume 2, No. 1 (5), p. 110–115.
dc.relation.referencesen6. Ivutin A. N., Larkin E. V. Prediction of the execution time of the algorithm. Magazine. News of TSU. Technical science. Issue number 3/2013. P. 301–315.
dc.relation.referencesen7. Bocharov P. L., Ignatushchenko V. V. Mathematical models and methods for evaluating the ef ectiveness of parallel computing systems on complexes of interrelated works, Tez. report international conf, "High-Performance Computing Systems in Management and Scientific Research", Alma-Ata, 1991.
dc.relation.referencesen8. Margalitashvili A. L. Investigation of the effectiveness of the functioning of parallel computing resources on given complexes of interrelated works, Abstract of Cand. dis. M., In-t prbblem management, 1990.
dc.relation.referencesen9. Bocharov P. L., Preydunov Yu. V. Estimation of the execution time of a complex of works on a parallel computational system, System analysis and computer science. Sat scientific papers. M., Publishing house DN, 1991. P. 29–41.
dc.relation.referencesen10. Ingatushchenko V. V. Organization of structures for controlling multiprocessor computing systems. Moscow: Energoatomizdat, 1984.
dc.relation.referencesen11. Kumar S., Cohen P. R. Towards a fault-tolerant multi-agent system architecture. In: Proceedings of the Fourth International Conference on Autonomous Agents. ACM, 2000, pp. 459–466. DOI:10.1145/336595.337570.
dc.relation.referencesen12. Guessoum Z., Briot J. P., Faci N. Towards Fault-Tolerant Massively Multiagent Systems. In: Massively Multi-Agent Systems I. Springer Berlin Heidelberg, 2005. P. 55–69. (Ser. Lecture Notes in Computer Science; vol. 3446). DOI: 10.1007/11512073_5.
dc.relation.referencesen13. Serugendo G. D.M., Romanovsky A. Designing Fault-Tolerant Mobile Systems. In: Scientific Engineering for Distributed Java Applications. Springer Berlin Heidelberg, 2003. P. 185–201. (Ser. Lecture Notes in Computer Science; vol. 2604). DOI: 10.1007/3-540-36520-6_17.
dc.relation.referencesen14. Mellouli S. A Reorganization Strategy to Build Fault-Tolerant Multi-Agent Systems. In: Advances in Artificial Intelligence. Springer Berlin Heidelberg, 2007. P. 61–72. (Ser. Lecture Notes in Computer Science; vol. 4509). DOI: 10.1007/978-3-540-72665-4_6.
dc.relation.referencesen15. Ignatushchenko V. V., Klushin Y. S. Prediction of the implementation of complex software systems on parallel computers: direct stochastic modeling, Automation and Remote Control. 1994. N 12, p. 142–157.
dc.relation.referencesen16. Klushin, Y. S. Prediction of the implementation of complex software systems on parallel computers, Proc. Report Second Ukrainian Conference on Automatic Control "Automation-95". Lviv, 1995, vol. 2, p. 100.
dc.relation.referencesen17. Ignatushchenko V. V., Klushin Yu. S. Forecasting the implementation of complex software systems on control parallel computers: exact methods, Scientific works of the International Symposium "Automated Control Systems", Tbilisi: ed. Intellect, 1996, p. 23–28.
dc.relation.referencesen18. Klushin Y. S. Evaluation of the ef ectiveness of various dispatching disciplines for reducing the time to perform complex software systems on parallel computing systems, Bulletin of National University "Lviv Polytechnic" No. 413. Computer engineering and information technology. Lviv: NU "LP", 2000. p. 19–23.
dc.relation.referencesen19. Gross, D., Miller, D., Transition Markov processes, Operations Research. 1984. Vol. 32. No. 4. P. 334–361.
dc.relation.referencesen20. Reibman A. L., Trivedi K. S. Numerical transient analysis of Markov models, Computers and Operations Research. 1988. Vol. 15. No. 1. P. 19–36.
dc.relation.referencesen21. Klushin, Y. S. Software implementation of mathematical models, methods and algorithms for estimating the time of execution of complex software complexes in multiprocessor computer systems. Bulletin of NU "Lviv Polytechnic" No 905. Computer systems and networks. Lviv: NU "LP", 2018.
dc.relation.referencesen22. Klushin, Y. S. Improving the accuracy of estimating the execution time of folding software systems in multiprocessor computer systems for belt stochastic modeling. Bulletin of NU "Lviv Polytechnic" No. 881. Computer systems and networks. Lviv: NU "LP", 2017.
dc.rights.holder© Національний університет “Львівська політехніка”, 2019
dc.rights.holder© Клушин Ю. С., 2019
dc.subjectпаралельні обчислювальні системи
dc.subjectкомплекс взаємопов’язаних робіт
dc.subjectпряме стохастичне моделювання
dc.subjectмарківський процес
dc.subjectфункція розподілу випадкової величини
dc.subjectнадійність системи
dc.subjectвідмова
dc.subjectparallel computing systems
dc.subjectcomplex of interconnected works
dc.subjectdirect stochastic modeling
dc.subjectMarkov process
dc.subjectfunction of distribution of random variable
dc.subjectsystem reliability
dc.subjectfailure
dc.subject.udc004.021
dc.subject.udc004.383
dc.titleОцінювання надійності паралельних обчислювальних систем під час виконання заданого комплексу взаємопов’язаних робіт
dc.title.alternativeAssessment of reliability of parallel computer systems at performance of the chosen complex of related works
dc.typeArticle

Files

Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
2019v1n1_Klushyn_Y-Assessment_of_reliability_15-23.pdf
Size:
1021.14 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
2019v1n1_Klushyn_Y-Assessment_of_reliability_15-23__COVER.png
Size:
374.09 KB
Format:
Portable Network Graphics
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.96 KB
Format:
Plain Text
Description:
Download

Collections

Комп'ютерні системи та мережі. – 2019. – Том 1, № 1