Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories

DOI10.1080/00207168508803466zbMath0565.68038OpenAlexW2005789350MaRDI QIDQ3680272

Constantine D. Spyropoulos, David J. Evans

Publication date: 1985

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168508803466

zbMATH Keywords

performancealgorithmscheduling independent jobsminimum mean-flow time

Mathematics Subject Classification ID

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

Related Items (2)

Multipurpose machine scheduling with rejection and identical job processing times ⋮ Faster Algorithms for Semi-Matching Problems

Cites Work

• Unnamed Item
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Task Scheduling on a Multiprocessor System with Independent Memories
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories