Memory-constrained task scheduling on a network of dual processors

DOI10.1145/2455.2456MaRDI QIDQ3771600zbMATH OpenOpenAlexFDO

Authors Ken Fuchs, Dennis Kafura

Publication date 1985

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2455.2456

zbMATH Keywords

deterministic schedulinglargest-memory-firstmemory managementnetworks of processorsscheduling algorithmshared memory

Mathematics Subject Classification ID

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

Recommendations

• Task scheduling with interprocessor communication delays
• scientific article; zbMATH DE number 541197
• Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
• scientific article; zbMATH DE number 2080862
• Optimum divisible load scheduling on heterogeneous stars with limited memory

Cited in

(4)

• Optimal task allocation in hyercube multiprocessor ensembles
• Benefits of speedup knowledge in memory-constrained multiprocessor scheduling
• scientific article; zbMATH DE number 541197 (Why is no real title available?)
• scientific article; zbMATH DE number 2080862 (Why is no real title available?)

This page was built for publication: Memory-constrained task scheduling on a network of dual processors

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