A unified approach to approximating resource allocation and scheduling

@article{BarNoy2001AUA,
  title={A unified approach to approximating resource allocation and scheduling},
  author={Amotz Bar-Noy and Reuven Bar-Yehuda and Ari Freund and Joseph Naor and Baruch Schieber},
  journal={J. ACM},
  year={2001},
  volume={48},
  pages={1069-1090}
}
We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum loss by a constant factor. Our approximation factors apply to many problems, among which are: (i) real-time scheduling of jobs on parallel machines, (ii) bandwidth allocation for sessions between two endpoints, (iii) general caching, (iv) dynamic storage allocation, and (v) bandwidth allocation on… 

Allocation of bandwidth and storage

This paper provides polynomial-time algorithms for solving various special cases, and develops polynometric-time approximation algorithms for very general NP-hard cases with good performance guarantees.

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

The problem we consider is motivated by allocating bandwidth slots to communication requests on a satellite channel under real time constraints. Accepted requests must be scheduled on nonintersecting

Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract)

Two scheduling problems are introduced, the flexible bandwidth allocation problem (FBAP) and the flexible storage allocation problems (FSAP), which generalize the classic bandwidth allocationproblem and storage allocation problem and are therefore NP-Hard.

Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks

This work studies two variants of the classic job interval scheduling problem, where a reusable resource is allocated to competing job intervals in a flexible manner, and derives the best possible positive result for such instances, namely, a polynomial time approximation scheme (PTAS).

Improved algorithms for resource allocation under varying capacity

Improved algorithms based on the primal–dual paradigm are presented, where the improvements are in terms of approximation ratio, running time and simplicity.

Fast primal-dual distributed algorithms for scheduling and matching problems

Efficient distributed algorithms computing approximate solutions to general scheduling and matching problems as well as the first deterministic distributed algorithm for weighted matching with poly-logaritmic running time are given.

Dynamic resource allocation: A flexible and tractable modeling framework

Scheduling Resources for Throughput Maximization

A constant factor randomized approximation algorithm is given for the problem of scheduling a set of resources over time, and it is shown that without these assumptions, the problem is as hard as the independent set problem.

Resource allocation problem under single resource assignment

This paper proposes an algorithm with approximation ratio of 12.5 and refers to the problem as the S_RA problem, a NP-hard resource allocation problem of allocating a set of resources to meet demands over a time period at the minimum cost.

Flexible Resource Allocation for Clouds and All-Optical Networks

This work studies two variants of the classic job interval scheduling problem, where a reusable resource is allocated to competing job intervals in a flexible manner, and uncovers an interesting relation to the paging problem that leads to a simple algorithm for uniform profit instances of n jobs.
...

References

SHOWING 1-10 OF 29 REFERENCES

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

The problem we consider is motivated by allocating bandwidth slots to communication requests on a satellite channel under real time constraints. Accepted requests must be scheduled on nonintersecting

Off-line admission control for general scheduling problems

This work gives a pseudopolynomial-time algorithm that, given an n-job instance whose optimal schedule has optimality criterion of value OPT, schedules a constant fraction of the n jobs within a constant factor times OPT.

Approximating the Throughput of Multiple Machines in Real-Time Scheduling

This work considers the following fundamental scheduling problem, and gives constant factor approximation algorithms for four variants of the problem, depending on the type of the machines and the weight of the jobs (identical vs. arbitrary).

Improvements in Throughput Maximization for Real-Time Scheduling

This work considers the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit, and provides algorithms that do not use linear programming, are simple and much faster than the corresponding ones proposed in [3], while either having the same quality of approximation or improving it.

On the approximability of an interval scheduling problem

In this paper we consider a general interval scheduling problem. The problem is a natural generalization of finding a maximum independent set in an interval graph. We show that, unless =, this

Page replacement for general caching problems

This paper seeks to develop good oflline page replacement policies for the general caching problem, with the hope that any insight gained here may lead to good online algorithms.

One for the Price of Two: a Unified Approach for Approximating Covering Problems

A modified greedy algorithm is developed, which for Vertex Cover gives an expected performance ratio ≤ 2, based on a formal definition for covering problems, which includes all the above fundamental problems and others.

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem