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
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract)
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks
Deadline-aware scheduling of big-data processing jobs
Resource allocation problem under single resource assignment
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
On the approximability of an interval scheduling problem
Page replacement for general caching problems
A polynomial time approximation algorithm for dynamic storage allocation
Algorithmic graph theory and perfect graphs
What are “ A ” and “ B ” ?
Approx- imating the throughput of multiple machines in real-time scheduling
  • Proc. 31st Annual ACM Symposium on Theory of Computing, pp. 622{631
  • 1999