The most commonly used scheduling algorithm for parallel supercomputers is FCFS with
backfilling, as originally introduced in the EASY scheduler. Backfilling means that short jobs …

The popularity of research on the scheduling of parallel jobs demands a periodic review of
the status of the field. Indeed, several surveys have been written on this topic in the context …

The preemptive real-time scheduling of sporadic parallel task systems is studied. We
present an algorithm, called gang EDF, which applies the earliest deadline first (EDF) policy …

Approximating general distributions by phase-type (PH) distributions is a popular technique
in stochastic analysis, since the Markovian property of PH distributions often allows …

As we continue to evolve into large-scale parallel systems, many of them employing
hundreds of computing engines to take on mission-critical roles, it is crucial to design those …

The cloud computing paradigm is attracting an increased number of complex applications to
run in remote data centers. Many complex applications require parallel processing …

Existing multicore systems already provide deep levels of thread parallelism; hybrid
programming models and composability of parallel libraries are very active areas of …

Gang scheduling has long been adopted by the high-performance computing community as
a way to reduce the synchronization overhead between related threads. It allows for several …

To fully exploit multicore processors, applications are expected to provide a large degree of
thread-level parallelism. While adequate for low core counts and their typical workloads, the …

Approximating general distributions by phase-type (PH) distributions is a popular technique
in queueing analysis, since the Markovian property of PH distributions often allows …