知识管理的IT实现IBM知识管理解决方案.pptVIP

* * * * * * * * * * * * * * * * * * * * * Dynamic Programming based Deterministic Scheduling for Task i For a solution in time window i, energy consumption e and cost c uniquely characterize its state. For pruning: {e1, c1} will dominate solution {e2, c2}, if e1= e2 and c1= c2 . * (15, 20) (11, 22) (1,2) (2,4) (3,6) (1,1) (2,2) (3,3) 0 t1 t2 (6, 9) (5, 8) (4, 7) (5, 7) (4, 6) (3, 5) (4, 5) (3, 4) (2, 3) (0,0) (0,0) (3, 3) (2, 2) (1, 1) # of distinct power levels = k # time slots = m Runtime : Price Time Dynamic Programming returns optimal solution Handling Multiple Tasks According an order of tasks Perform the dynamic programming algorithm on each task *  The Proposed Scheme Outline * Variation impacts the Scheme t2 t3 t4 Worst case design Evaluate Best case can be improved t1 Best Price Window Cost can be reduced * Best Case Design t1 t2 t3 t4 * Variation Aware Design An adaptation variable β is introduced to utilize the load variation. t1 t2 t3 t4 * Monte Carlo Simulation It takes 5000 different task sets, to evaluate a β value. Evaluate how many samples do not violate trip rate requirement. Trip rate = trip out event / total event * Uncertainty Aware Algorithm Algorithmic Flow Output: Schedule Input: Task set with tasks which can be scheduled Yes up date task load based on β Generate appliances schedule by solving the LP Derive current trip rate using Monte Carlo simulation Current trip rate ≤ Target Update β No Core 1 up date task load based on β Generate appliances schedule by solving the LP Derive current trip rate using Monte Carlo simulation Current trip rate ≤ Target Update β No Yes up date task load based on β Generate appliances schedule by solving the LP Derive current trip rate using Monte Carlo simulation Current trip rate ≤ Target Update β No up date task load based on β Generate appliances schedule by solving the LP Derive current trip rate using Monte Carlo simulation Cur