Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Heavy traffic Optimal"”.

  1. Near-data scheduling for data centers with multiple levels of data locality

    … et al., where the former is both throughput and heavy-traffic optimal, while the latter is only throughput optimal, but heavy-traffic optimal in only a special traffic load. We show that an extension of the JSQ-MW algorithm for a system with thee levels of data locality is throughput optimal, but …

    uiuc Repository record for Near-data scheduling for data centers with multiple levels of data locality (opens in a new tab)

  2. Optimal resource allocation algorithms for cloud computing

    … a system. An algorithm is said to be throughput-optimal if it can stabilize the system whenever the load is within the capacity region. We show that the widely-used Best-Fit scheduling algorithm is not throughput-optimal. We first consider the problem where the jobs need to be scheduled …

    uiuc Repository record for Optimal resource allocation algorithms for cloud computing (opens in a new tab)