Skip to main content

Decomposition Method for Synthesizing the Computer System Architecture

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 938))

Abstract

The paper considers the problem of synthesizing the architecture of a modern computer system (CS) for managing a complex distributed object. The main stages of the architecture synthesis are analyzed. The necessity of preliminary decomposition, structurization and formalization of the system is substantiated. The main stages of the hierarchical sequence of the decomposition process are given. The decomposition method for synthesizing the architecture of a computer system is developed on the basis of the stratification of the directed graph of CS implementation options. The simulation model of this process was developed. The modelling results showed the feasibility of using the developed method for synthesizing the architecture of a computer system with a large number of nodes. It is shown that the use of the decomposition method is unpractical when there are less than 60 nodes. Using more than 100 nodes is practically advantageous. This method, unlike the existing ones, enables getting results in a reasonable time when using more than 1000 nodes. These results are particularly significant in the context of operational reconfiguration of a system with a large number of nodes. Moreover, the more the number of nodes, the greater the advantage of the method of decomposition. Thus, while synthesizing the computer system architecture to control a complex distributed object at the stage of developing the relationship among the components, the method of decomposition should be used to reduce the time of the process.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Dinari, H.: A survey on graph queries processing: techniques and methods. Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 9(4), 48–56 (2017). https://doi.org/10.5815/ijcnis.2017.04.06

    Article  Google Scholar 

  2. Hu, Z., Mukhin, V., Kornaga, Y., Lavrenko, Y., Barabash, O., Herasymenko, O.: Analytical assessment of security level of distributed and scalable computer systems. Int. J. Intell. Syst. Appl. (IJISA) 8(12), 57–64 (2016). https://doi.org/10.5815/ijisa.2016.12.07

    Article  Google Scholar 

  3. Mukhin, V.Ye.: Adaptive approach to safety control and security system modification in computer systems and networks. In: Proceedings of the 5-th IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS’2009), Rende (Cosenza), Italy, 21–23 September 2009, pp. 212–217 (2009)

    Google Scholar 

  4. Hu, Z., Mukhin, V., Kornaga, Y., Lavrenko, Y., Herasymenko, O.: Distributed computer system resources control mechanism based on network-centric approach. Int. J. Intell. Syst. Appl. (IJISA) 9(7), 41–51 (2017). https://doi.org/10.5815/ijisa.2017.07.05

    Article  Google Scholar 

  5. Kuchuk, G.A., Akimova, Yu.A., Klimenko, L.A.: Method of optimal allocation of relational tables. Eng. Simul. 17, 681–689 (2000)

    Google Scholar 

  6. Gelenbe, E., Pujolle, G.: Analysis and Synthesis of Computer Systems, 2nd edn. Advances in Computer Science and Engineering, Texts, vol. 4, 309 p. (2010)

    Google Scholar 

  7. Ageev, D.V., Ignatenko, A.A., Kopylev, A.N.: Method for determination of flow parameters in different parts of multiservice telecommunications network, taking into account the effect of self-similarity. Electron. Sci. Spec. Ed.- J. “Probl. Telecommun.” 3(5), 8–37 (2011). http://pt.journal.kh.ua/2011/3/1/113_ageyev_method.pdf. Accessed 23 Mar2017

    Google Scholar 

  8. Kuchuk, N., Mozhaiev, O., Mozhaiev, M., Kuchuk, H.: Method for calculating of R-learning traffic peakedness. In: 2017 4th International Scientific-Practical Conference Problems of Infocommunications Science and Technology, PIC S and T 2017 – Proceedings, pp. 359–362 (2017). https://doi.org/10.1109/infocommst.2017.8246416

  9. Mukhin, V., et al.: The method of variant synthesis of information and communication network structures on the basis of the graph and set-theoretical models. Int. J. Intell. Syst. Appl. (IJISA) 9(11), 42–51 (2017). https://doi.org/10.5815/ijisa.2017.11.06

    Article  Google Scholar 

  10. Akande, A.J., Fidge, C., Foo, E.: Limitations of passively mapping logical network topologies. Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 9(2), 1–11 (2017). https://doi.org/10.5815/ijcnis.2017.02.01

    Article  Google Scholar 

  11. Mozhaev, O., Kuchuk, H., Kuchuk, N., Mykhailo, M., Lohvynenko, M.: Multiservice network security metric. In: 2nd International Conference on Advanced Information and Communication Technologies, AICT 2017 – Proceedings, pp. 133–136 (2017)

    Google Scholar 

  12. Mukhin, V.Ye., Bidkov, A.Ye., Thinh, V.D.: The forming of trust level to the nodes in the distributed computer systems. In: Proceedings of XIth International Conference “Modern Problems of Radio Engineering, Telecommunications and Computer Science TCSET’2012”, Lvov, Slavsko, 21–24 February 2012, p. 362 (2012)

    Google Scholar 

  13. Mukhin, V.Ye.: The security mechanisms for grid computers. In: Proceedings of the 4-th IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS’2007), Dortmund, Germany, 6–8 September 2007, pp. 584–589 (2007)

    Google Scholar 

  14. Zhang, S., Hu, M., Yang, J.: TreePi: a novel graph indexing method. In: IEEE 23rd International Conference on Data Engineering, Istanbul, pp. 966–975 (2007)

    Google Scholar 

  15. Kuchuk, G., Kharchenko, V., Kovalenko, A., Ruchkov, E.: Approaches to selection of combinatorial algorithm for optimization in network traffic control of safety-critical systems. In: Proceeding of IEEE East-West Design and Test Symposium (EWDTS’2016), pp. 384–389 (2016). https://doi.org/10.1109/ewdts.2016.7807655

  16. Kuchuk, G., Nechausov, S., Kharchenko, V.: Two-stage optimization of resource allocation for hybrid cloud data store. In: 2015 International Conference on Information and Digital Technologies, IDT 2015, Zilina, Slovakia (2015). https://doi.org/10.1109/dt.2015.7222982

  17. Yan, X., Yu, S.P., Han, J.: Graph indexing: a frequent structure-based approach. In: ACM SIGMOD International Conference on Management of Data 2004, pp. 335–346 (2004)

    Google Scholar 

  18. Khan, Z.A., Siddiqui, J., Samad, A.: Linear crossed cube (LCQ): a new interconnection network topology for massively parallel system. IJCNIS 7(3), 18–25 (2015). https://doi.org/10.5815/ijcnis.2015.03.03

    Article  Google Scholar 

  19. Meligy, A.M., Ibrahem, H.M., Othman, E.A.: Communication centrality in dynamic networks using time-ordered weighted graph. IJCNIS 6(12), 21–27 (2014). https://doi.org/10.5815/ijcnis.2014.12.03

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vadym Mukhin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mukhin, V. et al. (2020). Decomposition Method for Synthesizing the Computer System Architecture. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds) Advances in Computer Science for Engineering and Education II. ICCSEEA 2019. Advances in Intelligent Systems and Computing, vol 938. Springer, Cham. https://doi.org/10.1007/978-3-030-16621-2_27

Download citation

Publish with us

Policies and ethics