Stability and Distributed Scheduling Algorithms
IEEE Transactions on Software Engineering
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Approximate analysis of open networks of queues with blocking: Tandem configurations
IEEE Transactions on Software Engineering
OSF DCE application development reference, revision 1.0
OSF DCE application development reference, revision 1.0
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
IEEE Transactions on Computers
IEEE Transactions on Computers
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
TOWARDS A THREAD-BASED PARALLEL DIRECT EXECUTION SIMULATOR
TOWARDS A THREAD-BASED PARALLEL DIRECT EXECUTION SIMULATOR
Cloud computing - The business perspective
Decision Support Systems
Hi-index | 0.00 |
In the client/server model for distributed on-line requests processing, the concept of a server class that consists of multiple identical servers is often provided for the fast response time, high fault-tolerance, or continuous availability. As far as we are aware of, there is no concrete formulation that provides the optimal number of servers of a server class in distributed client/ server systems. The number of servers has been usually chosen only by heuristic methods or statistics after monitoring system behavior for some periods of time.In this paper, we propose a method based on queuing theory that determines the optimal number of servers in a server class for a general distributed client/server model that encompasses the state-of-the-art on-line transaction processing environment described in the literature.