Current processor allocation techniques for highly parallel systems are typically restricted to
contiguous allocation strategies for which performance suffers significantly due to the …

Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in
a program to processors, so as to minimize the makespan. This formulation assumes that the …

Managing computing resources in a hypercube entails two steps. First, a job must be chosen
to execute from among those waiting (job scheduling). Next a particular subcube within the …

Актуальность исследования. Надежность является важнейшим аспектом при
использовании вычислительных систем в критических областях. Авиация, энергетика …

This introduction to networking large scale parallel computer systems acts as a primary
resource for a wide readership, including network systems engineers, electronics engineers …

In this paper we evaluate the performance implications of using a buddy scheme for
contiguous node allocation, in conjunction with a backfilling job scheduler for clusters. When …

In this paper, we examine three general classes of space-sharing scheduling policies under
a workload representative of large-scale scientific computing. These policies differ in the …

Until now little research has addressed the problem of on line scheduling of sporadic
parallel tasks with hard deadlines in partitionable multiprocessor systems In this paper we …

In hypercube computers that support a multiuser environment, it is important for the
operating system to be able to allocate subcubes of different dimensions. Previously …

In this paper, we evaluate the performance implications of using a buddy scheme for
contiguous node allocation, in conjunction with a backfilling job scheduler for clusters. When …