Skip to content
naulon
Not checkedNot checked for notices yet.

Multi-Criteria Optimization in the Design of High-Load Systems

Yaroslav Tupalo

Кібернетика та комп'ютерні технології · 2021

doi:10.34229/2707-451x.21.4.5 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The current stage of development of science and technology is characterized by a significant complication of the tasks. The development of the economy to produce a situation where the development, implementation and operation of complex technical and socio-technical systems have to be in conditions of fierce competition. This is necessary to reduce the time of development and implementation of new technologies, especially in high-load systems. Highly loaded systems are, by and large, the same websites, only with a very large audience, and as a consequence with a large load, which requires an optimized server part of the site. A qualitative characteristic for a highly loaded system is the bandwidth of this system, it describes the amount of work that must be able to perform the system per unit time. The development of highly loaded systems is time consuming and poorly formalized. Since the production of high-load systems is one of the most dynamically developing areas in the field of information technology, which is demonstrated by a significant annual increase in volumes. In the practical task of decision-making, there is often a situation where you cannot limit yourself to considering a single criterion for choosing a decision. An attempt at mathematical formalization of such problems has led to the creation of the Theory of Multicriteria Optimization, which is used in the development of methods, intended for support of decision makers, in the presence of several criteria. The steps for construction of algorithm of multicriteria optimization in designing of highly loaded systems, carries out search of solutions of a maximum in a multicriteria problem are resulted. The algorithm was based on the descent method in Simplex problems. Simplex method - an algorithm for solving the optimization problem of linear programming by searching the vertices of a convex polyhedron in multidimensional space. Multicriteria optimization is based on finding solutions in problems with a large number of options. Now the type of tasks is very resource-intensive and is calculated using computers. Keywords: high-load data systems, high-load computing system.

Abstract licence: CC BY-NC-SA

References1

    1 more reference, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.