Malleable parallelism with minimal effort for maximal throughput and maximal hardware load.

05 February 2019, Version 2
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

A new parallel high-performance computing setup, which can use every little bit of computing resources left over by traditional scheduling, regardless how small or big it may be. This enables HPC providers to achieve 100 percent load on their machines at all times, and it enables HPC users to get substantial computing time on HPC systems that are "full" with traditional jobs.

Keywords

adaptive parallelism
malleable parallelism
scheduling
genetic algorithms
non-deterministic global optimization
OGOLEM software
Chemistry

Supplementary materials

Title
Description
Actions
Title
loadCAU171222
Description
Actions
Title
loadAK171212
Description
Actions
Title
load171027
Description
Actions
Title
filluprmi2
Description
Actions

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.