skip to main content
10.1145/3578338.3593538acmconferencesArticle/Chapter ViewAbstractPublication PagesmetricsConference Proceedingsconference-collections
abstract

Dynamic Bin Packing with Predictions

Published: 19 June 2023 Publication History

Abstract

The MinUsageTime Dynamic Bin Packing (DBP) problem aims to minimize the accumulated bin usage time for packing a sequence of items into bins. It is often used to model job dispatching for optimizing the busy time of servers, where the items and bins match the jobs and servers respectively. It is known that the competitiveness of MinUsageTime DBP has tight bounds of Θ(√, log μ) and Θ(μ) in the clairvoyant and non-clairvoyant settings respectively, where μ is the max/min duration ratio of all items. In practice, the information about items' durations (i.e., job lengths) obtained via predictions is usually prone to errors. In this paper, we study the MinUsageTime DBP problem with predictions of items' durations. We find that an existing O(√ log μ)-competitive clairvoyant algorithm, if using predicted durations rather than real durations for packing, does not provide any bounded performance guarantee when the predictions are adversarially bad. We develop a new online algorithm with a competitive ratio of {O(∈2 √ log(∈2 μ)}, O(μ) (where ε is the maximum multiplicative error of prediction among all items), achieving O(√ log μ) consistency (competitiveness under perfect predictions where ∈ = 1) and O(μ) robustness (competitiveness under terrible predictions), both of which are asymptotically optimal.

References

[1]
Yossi Azar and Danny Vainstein. 2017. Tight Bounds for Clairvoyant Dynamic Bin Packing. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 77--86.
[2]
Yossi Azar and Danny Vainstein. 2019. Tight Bounds for Clairvoyant Dynamic Bin Packing. ACM Transactions on Parallel Computing, Vol. 6, 3, Article 15 (2019), 21 pages.
[3]
Shahin Kamali and Alejandro López-Ortiz. 2015. Efficient Online Strategies for Renting Servers in the Cloud. In SOFSEM 2015: Theory and Practice of Computer Science. Springer, 277--288.
[4]
Ravi Kumar, Manish Purohit, and Zoya Svitkina. 2018. Improving online algorithms via ML predictions. In Proceedings of the 32nd Conference on Neural Information Processing Systems. 9661--9670.
[5]
Yusen Li, Xueyan Tang, and Wentong Cai. 2014. On Dynamic Bin Packing for Resource Allocation in the Cloud. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 2--11.
[6]
Yusen Li, Xueyan Tang, and Wentong Cai. 2016. Dynamic Bin Packing for On-Demand Cloud Resource Allocation. IEEE Transactions on Parallel and Distributed Systems, Vol. 27, 1 (2016), 157--170.
[7]
Mozhengfu Liu and Xueyan Tang. 2022. Dynamic Bin Packing with Predictions. Proceedings of the ACM on Measurement and Analysis of Computing Systems, Vol. 6, 3, Article 45 (2022), 24 pages.
[8]
Runtian Ren, Xueyan Tang, Yusen Li, and Wentong Cai. 2017. Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation. IEEE/ACM Transactions on Networking, Vol. 25, 3 (2017), 1324--1331.
[9]
Xueyan Tang, Yusen Li, Runtian Ren, and Wentong Cai. 2016. On First Fit Bin Packing for Online Cloud Server Allocation. In Proceedings of the 30th IEEE International Parallel and Distributed Processing Symposium (IPDPS). 323--332.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMETRICS '23: Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems
June 2023
123 pages
ISBN:9798400700743
DOI:10.1145/3578338
  • cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 51, Issue 1
    SIGMETRICS '23
    June 2023
    108 pages
    ISSN:0163-5999
    DOI:10.1145/3606376
    Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 June 2023

Check for updates

Author Tags

  1. algorithms with predictions
  2. busy time
  3. competitive ratio
  4. consistency
  5. dynamic bin packing
  6. robustness
  7. scheduling

Qualifiers

  • Abstract

Funding Sources

  • Singapore Ministry of Education Academic Research Fund Tier 1
  • Singapore Ministry of Education Academic Research Fund Tier 2

Conference

SIGMETRICS '23
Sponsor:

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 67
    Total Downloads
  • Downloads (Last 12 months)33
  • Downloads (Last 6 weeks)2
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media