AN INVESTIGATION INTO PARALLEL JOB SCHEDULING USING SERVICE LEVEL AGREEMENTS

Access to files

•   FULL-TEXT.PDF (pdf)

Abstract

A scheduler, as a central components of a computing site, aggregates computing resources and is responsible to distribute the incoming load (jobs) between the resources. Under such an environment, the optimum performance of the system against the service level agreement (SLA) based workloads, can be achieved by calculating the priority of SLA bound jobs using integrated heuristic. The SLA defines the service obligations and expectations to use the computational resources. The integrated heuristic is the combination of different SLA terms. It combines the SLA terms with a specific weight for each term. Theweights are computed by applying parameter sweep technique in order to obtain the best schedule for the optimum performance of the system under the workload. The sweepingof parameters on the integrated heuristic observed to be computationally expensive. The integrated heuristic becomes more expensive if no value of the computed weights result in improvement in performance with the resulting schedule. Hence, instead of obtaining optimum performance it incurs computation cost in such situations. Therefore, there is a need of detection of situations where the integrated heuristic can be exploited beneficially. For that reason, in this thesis we propose a metric based on the concept of utilization, to evaluate the SLA based parallel workloads of independent jobs to detect any impact of integrated heuristic on the workload.

Keyword(s)

Grid Scheduling; High Performance Computing; Parallel Job Scheduling; Parallel Workload; SLA based Scheduling; Scheduling Heuristics; Service Level Agreement; Workload Characterization

Bibliographic metadata

Institutional metadata

Record metadata