A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES

DOI10.1142/S0129054109006590zbMath1178.68111OpenAlexW1977652337MaRDI QIDQ3634187

Ondřej Zajíček

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.1142/s0129054109006590

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

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

Cites Work

• Maximizing the throughput of parallel jobs on hypercubes
• On maximizing the throughput of multiprocessor tasks.
• A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness

This page was built for publication: A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES