The advent of petascale computing has introduced new challenges (eg Heterogeneity,
system failure) for programming scalable parallel applications. Increased complexity and …

Building future generation supercomputers while constraining their power consumption is
one of the biggest challenges faced by the HPC community. For example, US Department of …

Datacenter operations today provide a plethora of new queueing and scheduling problems.
The notion of a “job” has become more general and multi-dimensional. The ways in which …

The throughput of supercomputers depends not only on efficient job scheduling but also on
the type of jobs that form the workload. Malleable jobs are most favourable for a cluster as …

The work in this paper focuses on providing malleability to MPI applications by using a novel
performance-aware dynamic reconfiguration technique. This paper describes the design …

Malleable jobs are those which can dynamically shrink or expand the number of processors
on which they are executing at runtime in response to an external command. Malleable jobs …

CFD users of supercomputers usually resort to rule-of-thumb methods to select the number
of subdomains (partitions) when relying on MPI-based parallelization. One common …

In the design of future HPC systems, research in resource management is showing an
increasing interest in a more dynamic control of the available resources. It has been proven …

Cluster batch systems usually support only static allocation of resources to applications
before job start. After job start, applications cannot increase or decrease their resource set …

In job scheduling, the concept of malleability has been explored since many years ago.
Research shows that malleability improves system performance, but its utilization in HPC …