Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems

DOI10.1007/BF01074716zbMath0608.68024OpenAlexW2053836063MaRDI QIDQ3747714

A. G. Chefranov, V. Yu. Bakenrot

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01074716

zbMATH Keywords

MIMD multiprocessor computer systems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A 2.5 times optimal algorithm for packing in two dimensions
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• Orthogonal Packings in Two Dimensions
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems