Inhomogeneous graph sorting and job distribution between two processors

DOI10.1007/BF01069117zbMath0454.68020OpenAlexW2086122447MaRDI QIDQ3902471

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

multiprocessor systemsinhomogeneous graph sortingoptimum scheduling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimal scheduling for two-processor systems
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Paths, Trees, and Flowers
• Optimal Sequencing of Two Equivalent Processors
• Inhomogeneous sorting

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