xiaoshier

摘要： Key Tech: allocate a tailored number of map/reduce slots to job, when the job profiling info is availableNew idea:1.Makespan theorem:two bound for the makespan of greedy task assignment lower bound = n.avg/k uppper bound: (n-1).avg/k + max where avg : average duration of n tasks　... 阅读全文