hadoop-分布式-系统-存储-数据库-云计算-(6).ppt

Experiment-driven System Management Shivnath Babu Duke University Joint work with Songyun Duan, Herodotos Herodotou, and Vamsidhar Thummala Managing DBs in Small to Medium Business Enterprises (SMBs) Peter is a system admin in an SMB Manages the database (DB) SMB cannot afford a DBA Suppose Peter has to tune a poorly-performing DB Design advisor may not help Maybe the problem is with DB configuration parameters Problem Abstraction Unknown response surface: y = F(X) X = Parameters x1, x2, …, xm Each experiment gives a Xi,yi sample Set DB to conf Xi Run workload that needs tuning Measure performance yi at Xi Goal: Find high performance setting with low total cost of running experiments Example Goal: Compute the potential utility of candidate experiments iTuned’s Adaptive Sampling Algorithm for Experiment Planning // Phase I: Bootstrapping Conduct some initial experiments // Phase II: Sequential Sampling Loop: Until stopping condition is reached Identify candidate experiments to do next Based on current samples, estimate the utility of each candidate experiment Conduct the next experiment at the candidate with highest utility Utility of an Experiment Let X1,y1--Xn,yn be the samples from n experiments done so far Let X*,y* be the best setting so far (i.e., y* = mini yi) wlg assuming minimization U(X), Utility of experiment at X is // y = F(X) y* - y if y* y 0 otherwise However, U(X) poses a chicken-and-egg problem y will be known only after experiment is run at X Goal: Compute expected utility EU(X) Expected Utility of an Experiment Suppose we have the probability density function of y (y is the perf at X) Prob(y = v | Xi,yi for i=1,…,n) Then, EU(X) = sv=-1 U(X) Prob(y = v) dv EU(X) = sv=-1 (y* - v) Prob(y = v) dv Goal: Compute Prob(y = v | Xi,yi for i=1,…,n) Model: Gaussian Process Representation (GRS) of a Response Surface GRS models the response surface as: y(X) = g(X)? + Z(X) (+ ?(X) for measurement error) E.