An Effective Process Schedule by Clustered Servers

Abstract

With the tremendous growth of the network services, the problem rate also gets increased. In order to overcome these obstacles, enormous technologies have been developed. In this article, a better solution is proposed to increase the server performance. In networking, the client sends the request to server; the server processes the request and sends back the response to the client. When the number of client request increases, the burden for server also gets increased which leads to lower performance. To overcome this problem, we use the distributed networking techniques. With the help of this concept, the client‘s work is distributed among several servers and thus the performance increases. This can be done by using large number of techniques such as software based, hardware based and network based technology. But these techniques have several problems such as high cost requirement and some implementation problems. In our article, we use a special technique to distribute the work to clustered server and calculate the execution time and the time to be consumed. We also implement the constraint to search whether the server already executes the request. If so, the response is stored in memory and it is retrieved in short time. This project is used to handle the client request efficiently by balancing the work load across the replicated web server dynamically.