Performance of Heuristics for a Computer Resource Allocation Problem

DOI10.1137/0605017zbMATH Open0531.68006OpenAlexW2034640505MaRDI QIDQ3313258FDOQ3313258

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-packingworst-case analysismultiprocessor schedulingstorage allocation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Bounds for Multifit Scheduling on Uniform Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Bin packing: Maximizing the number of pieces packed
• Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

Cited In (3)

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

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)