article

Proportionate progress: A notion of fairness in resource allocation

Authors:

S. K. Baruah,

N. K. Cohen,

C. G. Plaxton,

D. A. VarvelAuthors Info & Claims

Algorithmica, Volume 15, Issue 6

Pages 600 - 625

https://doi.org/10.1007/BF01940883

Published: 01 June 1996 Publication History

Abstract

Given a set ofn tasks andm resources, where each taskx has a rational weightx.w=x.e/x.p,0

References

[1]

S.K. Baruah, R. R. Howell, and L. E. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems , 2:301-324, 1990.

Digital Library

Google Scholar

[2]

M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences , 7:448-461, 1973.

Digital Library

Google Scholar

[3]

X. Deng. Mathematical Programming: Complexity and Applications. Ph.D. thesis, Department of Operations Research, Stanford University, Stanford, CA, September 1989.

Crossref

Google Scholar

[4]

L.R. Ford, Jr., and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.

Google Scholar

[5]

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.

Digital Library

Google Scholar

[6]

D.S. Hirschberg and C. K. Wong. A polynomial-time algorithm for the knapsack problem with two variables. Journal of the Association for Computing Machinery , 23:147-154, 1976.

Digital Library

Google Scholar

[7]

W.A. Horn. Some simple scheduling algorithms. Naval Research Logistics Quarterly , 21:177-185, 1974.

Crossref

Google Scholar

[8]

R. Kannan. A polynomial algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery , 27:118-122, 1980.

Digital Library

Google Scholar

[9]

H.W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research , 8:538-548, 1983.

Digital Library

Google Scholar

[10]

J.Y.-T. Leung. A new algorithm for scheduling periodic, real-time tasks. Algorithmica , 4:209-219, 1989.

Crossref

Google Scholar

[11]

C.L. Liu. Scheduling Algorithms for Multiprocessors in a Hard-Real-Time Environment. JPL Space Programs Summary 37-60, vol. II, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, pages 28-37, November, 1969.

Google Scholar

[12]

C.L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the Association for Computing Machinery , 20:46-61, 1973.

Digital Library

Google Scholar

[13]

H.E. Scarf. Production sets with indivisibilities, Part I: Generalities. Econometrica , 49:1-32, 1981.

Crossref

Google Scholar

[14]

H.E. Scarf. Production sets with indivisibilities, Part II: The case of two activities. Econometrica , 49:395-423, 1981.

Crossref

Google Scholar

Cited By

View all

Kawamura AMohar BShinkar IO'Donnell R(2024)Proof of the Density Threshold Conjecture for Pinwheel SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649757(1816-1819)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649757
Lyu YLu HLee MSchmitt GLim B(2024)IF-City: Intelligible Fair City Planning to Measure, Explain and Mitigate InequalityIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.323990930:7(3749-3766)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1109/TVCG.2023.3239909
Gąsieniec LJurdziński TKlasing RLevcopoulos CLingas AMin JRadzik T(2024)Perpetual maintenance of machines with different urgency requirementsJournal of Computer and System Sciences10.1016/j.jcss.2023.103476139:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.jcss.2023.103476
Show More Cited By

Proportionate progress: A notion of fairness in resource allocation
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Multi-layer Resources Fair Allocation in Big Data with Heterogeneous Demands

The resource fair allocation is very important for the most systems. This paper focuses on the resource allocation in a big data system. This system has the characteristics of multiple resources owning and heterogeneous resource demanding. Firstly, a ...
Fairness Guaranteed Cooperative Resource Allocation in Femtocell Networks

User-deployed low-power femtocell access points (FAPs) can provide better indoor coverage and higher data rates than conventional cellular networks. However, a major problem in this uncoordinated frequency reuse scenario is the inter-cell interference. ...
Improving Radio Resource Utilization and User Level Fairness in OFDMA Femtocell Networks

Poor indoor coverage and high cost of cellular network operators are among the main motivations for the employment of femtocell networks. Since femto access points (FAPs) and macrocells share same spectrum resources, radio resource allocation is an ...

Comments

Information & Contributors

Information

Published In

Algorithmica Volume 15, Issue 6

June 1996

140 pages

ISSN:0178-4617

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 June 1996

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

166
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kawamura AMohar BShinkar IO'Donnell R(2024)Proof of the Density Threshold Conjecture for Pinwheel SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649757(1816-1819)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649757
Lyu YLu HLee MSchmitt GLim B(2024)IF-City: Intelligible Fair City Planning to Measure, Explain and Mitigate InequalityIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.323990930:7(3749-3766)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1109/TVCG.2023.3239909
Gąsieniec LJurdziński TKlasing RLevcopoulos CLingas AMin JRadzik T(2024)Perpetual maintenance of machines with different urgency requirementsJournal of Computer and System Sciences10.1016/j.jcss.2023.103476139:COnline publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1016/j.jcss.2023.103476
Chen WWu PHuang PMok AHan S(2023)Regular Composite Resource Partitioning and Reconfiguration in Open SystemsACM Transactions on Embedded Computing Systems10.1145/360942422:5(1-29)Online publication date: 26-Sep-2023
https://dl.acm.org/doi/10.1145/3609424
Zhan JTang JPan QLi H(2023)Improved particle swarm optimization algorithm based on grouping and its application in hyperparameter optimizationSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-023-08039-627:13(8807-8819)Online publication date: 30-Mar-2023
https://dl.acm.org/doi/10.1007/s00500-023-08039-6
Chakraborty DDas SKhan ASubramanian AKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Fair rank aggregationProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602010(23965-23978)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602010
Islam MWei DSchieber BRoy S(2022)Satisfying complex top-k fairness constraints by preference substitutionsProceedings of the VLDB Endowment10.14778/3565816.356583216:2(317-329)Online publication date: 23-Nov-2022
https://dl.acm.org/doi/10.14778/3565816.3565832
Wei DIslam MSchieber BBasu Roy SIves ZBonifati AEl Abbadi A(2022)Rank Aggregation with Proportionate FairnessProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517865(262-275)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517865
Kuszmaul JAgrawal KLee I(2022)Bamboo Trimming RevisitedProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538580(411-417)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538580
Bilò DGualà LLeucci SProietti GScornavacca G(2022)Cutting bamboo down to sizeTheoretical Computer Science10.1016/j.tcs.2022.01.027909:C(54-67)Online publication date: 28-Mar-2022
https://dl.acm.org/doi/10.1016/j.tcs.2022.01.027
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Multi-layer Resources Fair Allocation in Big Data with Heterogeneous Demands

Fairness Guaranteed Cooperative Resource Allocation in Femtocell Networks

Improving Radio Resource Utilization and User Level Fairness in OFDMA Femtocell Networks

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations