• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the complexity of list scheduling algorithms for distributed-memory systems.

Andrei RadulescuArjan J. C. van Gemund
Published in: International Conference on Supercomputing (1999)
Keyphrases
  • scheduling algorithm
  • distributed memory
  • resource requirements
  • scientific computing
  • multiprocessor systems
  • scheduling strategy
  • computational complexity
  • computing systems
  • shared memory
  • ibm sp