Scheduling independent jobs on partitionable hypercubes

DOI10.1016/0743-7315(91)90031-4zbMath0753.68013OpenAlexW2029242390MaRDI QIDQ1177086

Guan-Ing Chen, Ten-Hwang Lai

Publication date: 25 June 1992

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(91)90031-4

zbMATH Keywords

largest dimension longest processing time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68M99)

Related Items

Maximizing the throughput of parallel jobs on hypercubes, Scheduling DAGs with random parallel tasks on binarily partitionable systems, Scheduling multiprocessor tasks -- An overview, The master-slave paradigm in parallel computer and industrial settings