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.

With the development of information systems, data has become one of the most important sources of organizations. Therefore, methods and techniques are needed to efficiently access data, share data, extract data from data, and use this information. By creating and expanding the Web and a significant increase in the volume of information and web development, the need for methods and techniques that can provide data efficiently and extract information from them is felt more than ever. Web mining is one of the areas of research that uses data mining techniques to automatically discover information from web services and documents. In fact, Web mining is a process of discovery of unknown and useful information from web data. Web mining methods are categorized into three types of web content exploration, exploration of Web structures, and exploration of the use of the Web, based on what type of data they are exploring. This research investigates the relationship between the idea of mining and other research fields and examines some of the previous methods used. Finally, a method is proposed based on two decision tree and machine model algorithms that will improve the results of the idea of mining. The results of the simulation of the proposed method were evaluated and compared with the previous methods. The results show that the proposed method has higher accuracy and speed