About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ACM/IEEE SC 1993
Conference paper
Performance analysis of job scheduling policies in parallel supercomputing environments
Abstract
In this paper we analyze three general classes of scheduling policies under a workload of large-scale scientific computing. These policies differ int eh manner in which processors are partitioned among the jobs as well as the way in which jobs are prioritized for execution on the partitions. Our results indicate that existing static schemes do not perform well under varying workloads. Adaptive policies tend to make better scheduling decisions, but their ability to adjust to workload changes is limited. Dynamic partitioning policies, on the other hand, yield the best performance and can be tuned to provide desired performance differences among jobs with varying resource demands.