Maximizing the throughput of parallel jobs on hypercubes

DOI10.1016/j.ipl.2007.01.005zbMath1184.68063OpenAlexW2011956346MaRDI QIDQ846023

Deshi Ye, Guo-Chuan Zhang

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.01.005

zbMATH Keywords

analysis of algorithmshypercubesparallel jobs

Mathematics Subject Classification ID

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

Related Items (1)

A NOTE ON SCHEDULING PARALLEL UNIT JOBS ON HYPERCUBES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiprocessor scheduling with communication delays
• Scheduling independent jobs on partitionable hypercubes
• Scheduling multiprocessor tasks -- An overview
• Dynamic scheduling on parallel machines
• On maximizing the throughput of multiprocessor tasks.
• Complexity of Scheduling Parallel Task Systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Algorithms and Computation
• Algorithm Theory - SWAT 2004

This page was built for publication: Maximizing the throughput of parallel jobs on hypercubes