Performance of Heuristics for a Computer Resource Allocation Problem
From MaRDI portal
Publication:3313258
DOI10.1137/0605017zbMath0531.68006MaRDI QIDQ3313258
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
multiprocessor scheduling; worst-case analysis; approximation algorithms; bin-packing; storage allocation
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Lower bounds and algorithms for the minimum cardinality bin covering problem, Heuristic methods and applications: A categorized survey
Cites Work
- Unnamed Item
- Bin packing: Maximizing the number of pieces packed
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
- Bounds for Multifit Scheduling on Uniform Processors
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- An Application of Bin-Packing to Multiprocessor Scheduling