Elsevier

Information Processing Letters

Volume 40, Issue 6, 30 December 1991, Pages 323-328
Information Processing Letters

Scheduling on a hypercube

https://doi.org/10.1016/0020-0190(91)90201-RGet rights and content

Abstract

We present a Θ(n2) worst-case-time algorithm to determine the minimum finishing time for a preemptive schedule of n independent jobs on a hypercube of fixed dimension.

References (9)

There are more references available in the full text version of this article.

Cited by (3)

  • Scheduling multiprocessor tasks - An overview

    1996, European Journal of Operational Research
  • Scheduling parallel tasks — algorithms and complexity

    2004, Handbook of Scheduling: Algorithms, Models, and Performance Analysis
View full text