On a special case of uniform processor scheduling

DOI10.1016/0196-6774(88)90043-0MaRDI QIDQ3777448zbMATH OpenOpenAlexFDO

Authors Michael A. Langston, Jin-Ming Liu, Manfred Kunde

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90043-0

zbMATH Keywords

bin-packingschedulingsystem of uniform processorsworst-case performance bound

Mathematics Subject Classification ID

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

Recommendations

• First fit decreasing scheduling on uniform multiprocessors
• Tighter bound for MULTIFIT scheduling on uniform processors
• scientific article; zbMATH DE number 3843135
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Tighter Bounds for LPT Scheduling on Uniform Processors

Cited in

(11)

• First fit decreasing scheduling on uniform multiprocessors
• Scheduling on uniform processors with at most one downtime on each machine
• Scheduling imprecise computation tasks on uniform processors
• SPT is optimally competitive for uniprocessor flow
• scientific article; zbMATH DE number 3843135 (Why is no real title available?)
• scientific article; zbMATH DE number 4162635 (Why is no real title available?)
• Uniform processor scheduling problem with nonsimultaneous available time
• A Generalized Uniform Processor System
• scientific article; zbMATH DE number 4089308 (Why is no real title available?)
• Scheduling on uniform nonsimultaneous parallel machines
• Fuzzy bin packing problem.

This page was built for publication: On a special case of uniform processor scheduling

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