How much power is needed for a billion-thread high-throughput server?

被引:7
作者
Xu, Zhiwei [1 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China
关键词
high-throughput computing; billion-thread servers; power consumption; waiting time and latency; performance formulation; Little's law; TIME AVERAGES; CUSTOMER; QUEUES;
D O I
10.1007/s11704-012-2071-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the advent of Internet services, big data and cloud computing, high-throughput computing has generated much research interest, especially on high-throughput cloud servers. However, three basic questions are still not satisfactorily answered: (1) What are the basic metrics (what throughput and high-throughput of what)? (2) What are the main factors most beneficial to increasing throughput? (3) Are there any fundamental constraints and how high can the throughput go? This article addresses these issues by utilizing the fifty-year progress in Little's law, to reveal three fundamental relations among the seven basic quantities of throughput (lambda), number of active threads (L), waiting time (W), system power (P), thread energy (E), Watts per thread omega, threads per Joule theta. In addition to Little's law L = lambda W, we obtain P = lambda E and lambda = L omega I, under reasonable assumptions. These equations help give a first order estimation of performance and power consumption targets for billion-thread cloud servers.
引用
收藏
页码:339 / 346
页数:8
相关论文
共 10 条
[1]  
Barroso L. A., 2009, Synthesis Lectures on Computer Architecture, V4, P1, DOI DOI 10.2200/S00193ED1V01Y200905CAC006
[2]   RELATION BETWEEN CUSTOMER AND TIME AVERAGES IN QUEUES [J].
BRUMELLE, SL .
JOURNAL OF APPLIED PROBABILITY, 1971, 8 (03) :508-&
[3]  
El-Taha M., 1999, SAMPLE PATH ANAL QUE
[4]   Understanding Throughput-Oriented Architectures [J].
Garland, Michael ;
Kirk, David B. .
COMMUNICATIONS OF THE ACM, 2010, 53 (11) :58-66
[5]  
Glanz J, 2011, N Y Times
[6]  
Hanlon C, 2006, ACM QUEUE, V4, P14
[7]   THE RELATION BETWEEN CUSTOMER AND TIME AVERAGES IN QUEUES [J].
HEYMAN, DP ;
STIDHAM, S .
OPERATIONS RESEARCH, 1980, 28 (04) :983-994
[8]   A PROOF FOR THE QUEUING FORMULA - L=LAMBDA-W [J].
LITTLE, JDC .
OPERATIONS RESEARCH, 1961, 9 (03) :383-387
[9]   Little's Law as Viewed on Its 50th Anniversary [J].
Little, John D. C. .
OPERATIONS RESEARCH, 2011, 59 (03) :536-549
[10]  
Little JDC, 2008, INT SER OPER RES MAN, V115, P81