Development of an Anomaly Detection Algorithm in Distributed Systems based on Runtime and System Status

Abstract

Computational grades have emerged as a new approach to solving large-scale problems in the fields of science, engineering, and commerce. The computing grid is a hardware and software infrastructure that provides affordable, reliable, comprehensive, and affordable access to the computational abilities of others. A computational grid is associated with a set of resources on a large scale. Computational grades have emerged as a new approach to solving large-scale problems in the fields of science, engineering, and commerce. The computing grid is a hardware and software infrastructure that provides affordable, reliable, comprehensive, and affordable access to the computational abilities of others. A computational grid is associated with a set of resources on a large scale. The purpose of this thesis is to provide a method that optimizes resource management and scheduling in at least one direction. The main focus of the research is on the time criterion, the deadline for doing things and receiving the response from the grid are parameters that can be examined. From a more general perspective, the aim of the research is to get the answer as quickly as possible from the calculation grid. The proposed algorithm improves the scheduling and resource management of the grid in the direction of improvement, and the structure and form of this problem have not yet been resolved. The proposed solution has been considered hypothesis and removed some of the definitions of grid scheduling, such as cost, quality of service, architectures, and others, but ultimately heed it and timed the grid in some ways.

Keywords

• Anomaly Detection Algorithm
• Distributed Systems
• System Status