DocumentCode :
1034355
Title :
Mathematical server sizing
Author :
Brodine, Dick
Author_Institution :
Nat. Comput. Group, Pittsburg, PA
Volume :
39
Issue :
7
fYear :
2006
fDate :
7/1/2006 12:00:00 AM
Firstpage :
91
Lastpage :
93
Abstract :
Queuing theory offers a more practical option for formulating a solution to the server-size problem. Such an approach provides a mathematical, closed-form solution that is provably and exactly correct, not tightly tied to one piece of hardware, and captures the scaling characteristic of a set of servers when system usage is high
Keywords :
client-server systems; performance evaluation; queueing theory; closed-form solution; mathematical server; queuing theory; server-size problem; Application software; Computer science; Delay; Mathematical model; Probability; Queueing analysis; Reliability theory; Statistics; Throughput; Yarn; Application server software; IT Systems; Queuing theory;
fLanguage :
English
Journal_Title :
Computer
Publisher :
ieee
ISSN :
0018-9162
Type :
jour
DOI :
10.1109/MC.2006.240
Filename :
1657920
Link To Document :
بازگشت