A Historical Application Profiler for Use by Parallel Schedulers

DMCA

A Historical Application Profiler for Use by Parallel Schedulers (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Richard Gibbons

Venue:	In Job Scheduling Strategies for Parallel Processing
Citations:	82 - 0 self

BibTeX

@INPROCEEDINGS{Gibbons97ahistorical,
    author = {Richard Gibbons},
    title = {A Historical Application Profiler for Use by Parallel Schedulers},
    booktitle = {In Job Scheduling Strategies for Parallel Processing},
    year = {1997},
    pages = {58--77},
    publisher = {Springer Verlag}
}

OpenURL

Abstract

Scheduling algorithms that use application and system knowledge have been shown to be more effective at scheduling parallel jobs on a multiprocessor than algorithms that do not. This paper focuses on obtaining such information for use by a scheduler in a network of workstations environment. The log files from three parallel systems are examined to determine both how to categorize parallel jobs for storage in a job database and what job information would be useful to a scheduler. A Historical Profiler is proposed that stores information about programs and users, and manipulates this information to provide schedulers with execution time predictions. Several preemptive and non-preemptive versions of the FCFS, EASY and Least Work First scheduling algorithms are compared to evaluate the utility of the profiler. It is found that both preemption and the use of application execution time predictions obtained from the Historical Profiler lead to improved performance.

Keyphrases

parallel scheduler historical application profiler parallel job job database execution time prediction application execution time prediction store information least work first historical profiler parallel system workstation environment historical profiler lead log file system knowledge job information non-preemptive version

DMCA