A unified approach to approximating resource allocation and scheduling

@article{BarNoy2001AUA,
  title={A unified approach to approximating resource allocation and scheduling},
  author={A. Bar-Noy and R. Bar-Yehuda and A. Freund and J. Naor and B. 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… Expand
Allocation of bandwidth and storage
TLDR
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. Expand
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 nonintersectingExpand
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract)
TLDR
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. Expand
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
TLDR
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). Expand
Improved algorithms for resource allocation under varying capacity
TLDR
Improved algorithms based on the primal–dual paradigm are presented, where the improvements are in terms of approximation ratio, running time and simplicity. Expand
Improved Algorithms for Resource Allocation under Varying Capacity
TLDR
Improved algorithms based on the primal-dual paradigm are presented, where the improvements are in terms of approximation ratio, running time and simplicity. Expand
Deadline-aware scheduling of big-data processing jobs
TLDR
A novel algorithm for scheduling big data jobs on large compute clusters which guarantees an expected constant approximation factor when the cluster capacity is sufficiently high, and is likely the first constant-factor approximation algorithm for the problem. Expand
Resource allocation problem under single resource assignment
TLDR
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. Expand
Flexible Resource Allocation for Clouds and All-Optical Networks
TLDR
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. Expand
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation
TLDR
This paper studies the resource augmentation setting in which the authors need to cover only a slightly smaller demand on each edge than the compared optimal solution, and presents a polynomial time (1 + )-approximation for UFP-cover. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 37 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 nonintersectingExpand
Off-line admission control for general scheduling problems
TLDR
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. Expand
Bandwidth Allocation with Preemption
TLDR
It is shown that the ability to preempt (i.e., abort) connections while in service in order to schedule "more valuable" connections substantially improves the throughput of some networks. Expand
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
TLDR
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). Expand
Improvements in Throughput Maximization for Real-Time Scheduling
We consider 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. Most of the versions of the problemExpand
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 =, thisExpand
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
TLDR
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, while either having the same quality of approximation or improving it. Expand
Page replacement for general caching problems
TLDR
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. Expand
A polynomial time approximation algorithm for dynamic storage allocation
Abstract We use an on-line algorithm for coloring interval graphs to construct a polynomial time approximation algorithm WIC for Dynamic Storage Allocation. The performance ratio for WIC is at mostExpand
One for the Price of Two: a Unified Approach for Approximating Covering Problems
TLDR
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. Expand
...
1
2
3
4
...