Balance Response Time in a Multiserver Information System Environment
Conference Proceeding Article
As information systems move from centralized to distributed systems, the distribution of the data files among the servers becomes a major issue. This paper reports on the results of a heuristic algorithm that is used to distribute the files among multiple heterogeneous servers interconnected by a fast network. The objective of our algorithm is to minimize the differences between response times of the servers (or in other words, to minimize the response imbalance factor). The servers are modeled using M/M/1 queues. In this paper, we first describe the problem, then the algorithm is presented and its bounds on the imbalance factor analyzed. The characteristics of our algorithm are also studied through simulation. Results are compared with the algorithms proposed by other researchers, which show a considerable improvement in the imbalance factor and only a slight increase in the average response time of the system.
File allocation, Load balancing, Multi-server information systems, Queuing theory, Optimization
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
Applied Informatics: Proceedings of the 15th IASTED International Conference, Innsbruck, Austria, 18-20 February 1997
City or Country
LEE, Francis Bu Sung; CAI, Wen Tong; and LIM, Ee Peng.
Balance Response Time in a Multiserver Information System Environment. (1997). Applied Informatics: Proceedings of the 15th IASTED International Conference, Innsbruck, Austria, 18-20 February 1997. 201-204. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1023
This document is currently not available here.