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 8 of 8 for “"resource augmentation"”.

  1. Design of Scheduling Algorithms Using Game Theoretic Ideas

    … for minimizing the weighted flow-time in the resource augmentation model. Our work introduces iterated rounding technique for the offline flow-time optimization, and gives the first framework to analyze non-clairvoyant algorithms for unrelated machines.</p><p>2. Polytope Scheduling Problem: To …

    duke Repository record for Design of Scheduling Algorithms Using Game Theoretic Ideas (opens in a new tab)

  2. Online optimization in routing and scheduling

    … new online routing problems. We then consider resource augmentation, where we give the online algorithm additional resources: faster servers, larger capacities, more servers, less restrictive constraints and advanced information. We derive new worst-case bounds that are relaxations of the …

    mit Repository record for Online optimization in routing and scheduling (opens in a new tab)

  3. Global EDF Scheduling for Parallel Real-Time Tasks

    … model, we prove that GEDF provides a capacity augmentation bound of 4-2/m and a resource augmentation bound of 2-1/m. The capacity augmentation bound acts as a linear-time schedulability test since it guarantees that any task set with total utilization of at most m/(4-2/m) where each task's …

    wustl Repository record for Global EDF Scheduling for Parallel Real-Time Tasks (opens in a new tab)

  4. Architectural constructs for time-critical networking in the smart city

    … reassignment, load-balancing, and/or temporary resource augmentation) in anticipation.

    mit Repository record for Architectural constructs for time-critical networking in the smart city (opens in a new tab)

  5. Online Scheduling on Identical Machines Using SRPT

    Item withdrawn by Alexis Thompson (athmpsn1@illinois.edu) on 2010-12-03T19:33:24Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 4 jeffe.sty: 24412 bytes, checksum: 7ff608a5b6c12b98320e3fb918b076e5 (MD5) SRPTidentical.tex: 41117 bytes, checksum: …

    uiuc Repository record for Online Scheduling on Identical Machines Using SRPT (opens in a new tab)

  6. Online scheduling algorithms for average flow time and its variants

    … server needs to satisfy the requests using its resources. This setting is prevalent in many applications including multiuser operating systems, web servers, database servers, and so on. A natural objective for each client is to minimize the flow time (or equivalently response time) of her …

    uiuc Repository record for Online scheduling algorithms for average flow time and its variants (opens in a new tab)

  7. Bidirectional interactions between behavior and disease in banded mongooses (Mungos mungo) infected with Mycobacterium mungi

    … habitats, presumably due to the concentration of resources at this highly modified habitat. Overall, my results on how behavior can influence disease in this system suggest that anthropogenic supplementation of food, albeit inadvertent in this system, augments aggression levels in banded mongooses …

    vt Repository record for Bidirectional interactions between behavior and disease in banded mongooses (Mungos mungo) infected with Mycobacterium mungi (opens in a new tab)

  8. Online packet buffering

    … of online algorithms that are granted more resources than the optimal offline algorithm they are compared to. We consider resource augmentation with respect to memory and speed. <br>Eventually, we present an optimal offline algorithm with a linear running time. <br> <br>The analysis of …

    freiburg-diss Repository record for Online packet buffering (opens in a new tab)