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 3 of 3 for “"Computer scheduling."”.

  1. Grain size management in repetitive task graphs for multiprocessor computer scheduling

    Optimal scheduling of parallel programs onto multiprocessor computers is an exponentially hard problem. Because of this, most scheduling algorithms in use today rely on heuristics to determine the best balance of computation and communication costs. However, because of the NP-hard nature of the …

    nps Repository record for Grain size management in repetitive task graphs for multiprocessor computer scheduling (opens in a new tab)

  2. Extending the range of linear scheduling in highway construction

    Linear Scheduling Method is a powerful graphical scheduling method which is best suited for scheduling projects involving repetitive activities. Highway construction projects are excellent examples of projects displaying repetitive characteristics. The research explores usefulness of linear …

    vt Repository record for Extending the range of linear scheduling in highway construction (opens in a new tab)

  3. Throughput optimization in MPR-capable multi-hop wireless networks

    … reception (MPR) capability, new routing and scheduling schemes must be designed. These schemes need to reformulate a historically underlying assumption in wireless networks which states that any concurrent transmission of two or more packets results in a collision and failure of all packet …

    unm Repository record for Throughput optimization in MPR-capable multi-hop wireless networks (opens in a new tab)