Performance of Heuristics for a Computer Resource Allocation Problem

DOI10.1137/0605017MaRDI QIDQ3313258zbMATH OpenOpenAlexFDO

Authors Michael A. Langston

Publication date 1984

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsbin-packingmultiprocessor schedulingstorage allocationworst-case analysis

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 563208
• Publication:4205077
• The maximum resource bin packing problem
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 3952477

Cites work

• An Application of Bin-Packing to Multiprocessor Scheduling
• Bin packing: Maximizing the number of pieces packed
• Bounds for Multifit Scheduling on Uniform Processors
• Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System

Cited in

(3)

• Optimizing personal computer configurations with heuristic-based search methods
• Lower bounds and algorithms for the minimum cardinality bin covering problem
• Heuristic methods and applications: A categorized survey

This page was built for publication: Performance of Heuristics for a Computer Resource Allocation Problem

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