作者: Dazhang Gu , F. Drews , L. Welch
关键词:
摘要: Some distributed real-time systems interact with external environments that change dynamically, and it is necessary to take the variables into account when performing task allocation. We developed an approximation algorithm for allocation, finds allocations are maximally robust against dynamic changes in multiple variables. Such will help reduce expensive reallocations triggered by unpredictable environments. The has a polynomial running time, its robustness optimality given ratio, which equals 2.41 asymptotically, workloads large workload independent utilization of tasks insignificant