DeepAI AI Chat
Log In Sign Up

Adaptive parallelism with RMI: Idle high-performance computing resources can be completely avoided

by   Florian Spenke, et al.

In practice, standard scheduling of parallel computing jobs almost always leaves significant portions of the available hardware unused, even with many jobs still waiting in the queue. The simple reason is that the resource requests of these waiting jobs are fixed and do not match the available, unused resources. However, with alternative but existing and well-established techniques it is possible to achieve a fully automated, adaptive parallelism that does not need pre-set, fixed resources. Here, we demonstrate that such an adaptively parallel program can indeed fill in all such scheduling gaps, even in real-life situations on large supercomputers.


page 6

page 8


Multi-Resource List Scheduling of Moldable Parallel Jobs under Precedence Constraints

The scheduling literature has traditionally focused on a single type of ...

Benchmarking Parallelism in FaaS Platforms

Serverless computing has seen a myriad of work exploring its potential. ...

Efficient Scheduling for Scalable Bioinformatics Analysis Platform with Microservices

With the advancement of biology and computer science, amount of bioinfor...

Improving the Effective Utilization of Supercomputer Resources by Adding Low-Priority Containerized Jobs

We propose an approach to utilize idle computational resources of superc...

LFTL: A multi-threaded FTL for a Parallel IO Flash Card under Linux

New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now avai...

Comparison of Three Job Mapping Algorithms for Supercomputer Resource Managers

Performance of supercomputer depends on the quality of resource manager,...