Worst-case analysis of scheduling heuristics of parallel systems

DOI10.1016/S0167-8191(98)00037-4MaRDI QIDQ1274368zbMATH OpenFDO

Authors Zhen Liu

Publication date 12 January 1999

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(98)00037-4

zbMATH Keywords

heuristics for multiprocessor schedulinginterprocessor communicationmakespanmultiprocessor taskparallel computationparallel tasktask duplicationworst-care error bound

Mathematics Subject Classification ID

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

Recommendations

• A Heuristic of Scheduling Parallel Tasks and Its Analysis
• Worst-case analysis of a scheduling algorithm
• scientific article; zbMATH DE number 1998822
• Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
• The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
• Evaluating scheduling heuristics for non-identical parallel processors
• An analysis of parallel heuristics for task allocation in multicomputers
• An analysis of heuristics for the parallel-machine flexible-resource scheduling problem
• scientific article; zbMATH DE number 3898232
• scientific article; zbMATH DE number 1375583

Cited in

(4)

• On the worst-case ratio of a compound multiprocessor scheduling algorithm
• Worst-case analysis of heuristics for the local microcode optimization problem
• A Heuristic of Scheduling Parallel Tasks and Its Analysis
• On the price of heterogeneity in parallel systems

This page was built for publication: Worst-case analysis of scheduling heuristics of parallel systems

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