Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

DOI10.1137/0208016MaRDI QIDQ3208073zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung, E. G. jun. Coffman

Publication date 1979

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0208016

zbMATH Keywords

approximation algorithmsbin-packingcombinatorial algorithmsNp-completenessprocessor and storage allocationschedulingworst- case performance boundsworst-case time complexity

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Bin packing with divisible item sizes
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Probabilistic analysis of a heuristic for the dual bin packing problem
• Bin packing with restricted piece sizes
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• Performance of Heuristics for a Computer Resource Allocation Problem
• A state-of-the-art review of parallel-machine scheduling research

This page was built for publication: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208073)