Inhomogeneous graph sorting and job distribution between two processors

DOI10.1007/BF01069117MaRDI QIDQ3902471zbMATH OpenOpenAlexFDO

Authors A. R. Airapetyan

Publication date 1980

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

inhomogeneous graph sortingmultiprocessor systemsoptimum scheduling

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Inhomogeneous sorting
• Optimal scheduling for two-processor systems
• Optimal Sequencing of Two Equivalent Processors
• Paths, Trees, and Flowers
• Scheduling Tasks with Nonuniform Deadlines on Two Processors

This page was built for publication: Inhomogeneous graph sorting and job distribution between two processors

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