Search Algorithms for Discrete Optimization Problems Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar


We must quantify the total number of requests in the system



Yüklə 0,99 Mb.
səhifə15/23
tarix26.12.2016
ölçüsü0,99 Mb.
#3369
1   ...   11   12   13   14   15   16   17   18   ...   23

We must quantify the total number of requests in the system.



Analyzing DFS: Assumptions

  • Work at any processor can be partitioned into independent pieces as long as its size exceeds a threshold ε.

  • A reasonable work-splitting mechanism is available.

  • If work w at a processor is split into two parts ψw and (1 - ψ)w, there exists an arbitrarily small constant α (0 < α ≤ 0.5), such that ψw > αw and (1 - ψ)w > αw.

  • The costant α sets a lower bound on the load imbalance from work splitting.



Analyzing DFS

1   ...   11   12   13   14   15   16   17   18   ...   23




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©azkurs.org 2024
rəhbərliyinə müraciət

gir | qeydiyyatdan keç
    Ana səhifə


yükləyin