Runtime estimation and scheduling on parallel processing supercomputers via instance-based learning and swarm intelligence

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Supercomputing has been indispensable in the unstoppable trend of high-speed computing evolution. This work aims at improving its running efficacy by introducing a new two-step scheduling approach. Based on the analysis of large historical data, we provide an accurate runtime estimation scheme using Instance-Based Learning (IBL) in the first step. Then a swarm intelligence based scheduling (SIBS) method is proposed to optimize the scheduling performance in terms of total runtime makespan and fair resource allocation. A method comparison on a dataset from the ALPS supercomputer, which consists of 804k workload data in 2016, shows that our proposed method outperforms the most commonly used strategy-Extensible Argonne Scheduling System (EASY).

Cite

CITATION STYLE

APA

Lin, F. P. C., & Phoa, F. K. H. (2019). Runtime estimation and scheduling on parallel processing supercomputers via instance-based learning and swarm intelligence. International Journal of Machine Learning and Computing, 9(5), 592–598. https://doi.org/10.18178/ijmlc.2019.9.5.845

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free