Resource Augmentation

07/26/2020
by   Tim Roughgarden, et al.
0

This chapter introduces resource augmentation, in which the performance of an algorithm is compared to the best-possible solution that is handicapped by less resources. We consider three case studies: online paging, with cache size as the resource; selfish routing, with capacity as the resource; and scheduling, with processor speed as the resource. Resource augmentation bounds also imply "loosely competitive" bounds, which show that an algorithm's performance is near-optimal for most resource levels.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2021

Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints

We study flow scheduling under node capacity constraints. We are given c...
research
12/08/2017

Priority-Aware Near-Optimal Scheduling for Heterogeneous Multi-Core Systems with Specialized Accelerators

To deliver high performance in power limited systems, architects have tu...
research
09/24/2022

The Online Knapsack Problem with Departures

The online knapsack problem is a classic online resource allocation prob...
research
10/04/2022

Scheduling with Many Shared Resources

Consider the many shared resource scheduling problem where jobs have to ...
research
07/17/2023

Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem

We consider the online transportation problem set in a metric space cont...
research
03/31/2022

Optimal Resource Scheduling and Allocation under Allowable Over-Scheduling

This paper studies optimal scheduling and resource allocation under allo...
research
12/04/2021

Resource Theories as Quantale Modules

We aim to counter the tendency for specialization in science by advancin...

Please sign up or login with your details

Forgot password? Click here to reset