Dynamic Bin Packing with Predictions
Abstract
References
Index Terms
- Dynamic Bin Packing with Predictions
Recommendations
Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions
SPAA '24: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and ArchitecturesMinUsageTime DBP is a variant of the Dynamic Bin Packing (DBP) problem that seeks to minimize the accumulated length of time for which bins are used in packing a sequence of items. This paper studies the MinUsageTime DBP problem with predictions about ...
Dynamic Bin Packing with Predictions
POMACSThe 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 ...
Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesThe MinUsageTime Dynamic Bin Packing (DBP) problem targets at minimizing the accumulated usage time of all the bins in the packing process. It models the server acquisition and job scheduling issues in many cloud-based systems. Earlier work has studied ...
Comments
Information & Contributors
Information
Published In
- General Chair:
- Evgenia Smirni,
- Program Chairs:
- Konstantin Avrachenkov,
- Phillipa Gill,
- Bhuvan Urgaonkar
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Abstract
Funding Sources
- Singapore Ministry of Education Academic Research Fund Tier 1
- Singapore Ministry of Education Academic Research Fund Tier 2
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 67Total Downloads
- Downloads (Last 12 months)33
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in