Distributed Scheduling of Parallel Jobs in a Heterogeneous Grid Environment

1
A Characterization of Approaches to Parrallel Job
Scheduling
Gerald Sabin Rajkumar Kettimuthu Arun
Rajan P SadayappanSupporte
d in part by Sandia National Laboratory
Metrics

• We use the following metrics for evaluating the
  proposed schemes
• Average Slowdown
• Average Turnaround Time
• Utilization
• Effective Utilization

Backfilling

• Backfilling
• A later arriving job is allowed to leap frog
  previously queued jobs

Aggressive vs. Conservative
Processors
Processors
Time
Time
Processors
Time

• Jobs are processed in arrival order by the
  meta-scheduler
• In a heterogeneous context, the site where the
  job starts the earliest may not be the best site
• In order to get the completion of a job at a
  particular site, conservative backfilling has to
  be employed at the local site
• Conservative performs better than aggressive in
  all case, quite the opposite of a homogenous
  context
• Improved backfilling caused by holes created due
  to the dynamic removal of replicated jobs at each
  site, and an increased number of jobs to attempt
  to backfill at each site

• Conservative
• Every job is given a reservation when it enters
  the system and a job is allowed to backfill only
  if it does not violate any of the previous
  reservations.
• EASY
• Only the job at the head of the queue is given a
  reservation and a job is allowed to backfill if
  it does not violate this reservation