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 1 of 1 for “"Near-data scheduling"”.

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

    Data locality is a fundamental issue for data-parallel applications. Considering MapReduce in Hadoop, the map task scheduling part requires an efficient algorithm which takes data locality into consideration; otherwise, the system may become unstable under loads inside the system's capacity region …

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