Assignment of independent tasks to minimize completion time

  • Blake B
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 10

    Citations

    Citations of this article.

Abstract

The task of scheduling dynamic applications that consist of single process tasks on a non-shared memory multicomputer is examined in this paper. Each task of the application is assumed to (1) require execution on a single processor, (2) have an estimate of its maximum execution time, and (3) not wait on communications with other tasks. The objective of the studied schedulers is to map an application's tasks onto the underlying hardware in such a way that the application's completion time is minimized. Experimental evaluation of the schedulers indicate that in many situations, a more sophisticated scheduler fails to outperform simpler schedulers.

Author-supplied keywords

  • Distributed scheduling
  • Dynamic applications
  • Independent tasks
  • Preemption
  • Task migration

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Ben A. Blake

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free