The performance of contiguous allocation strategies can be significantly affected by the type
of the distribution adopted for job execution times. In this paper, the performance of the …

We examine fast algorithms to allocate processors to compute jobs in mesh-connected
clusters. We find that a 1D curve-based strategy can give allocations of comparable quality …

In this study, the authors propose a processor allocation mechanism for run-time assignment
of a set of communicating tasks of input applications onto the processing nodes of a chip …

The performance of contiguous allocation strategies can be significantly affected by the
distribution of job execution times. In this paper, the performance of the existing contiguous …

Efficient processor allocation and job scheduling algorithms are critical if the full
computational power of large-scale multicomputers is to be harnessed effectively. Processor …

Many of the proposed algorithms for allocating processors to jobs in supercomputers choose
arbitrarily among potential allocations that are" equally good" according to the allocation …

The performance of the famous non-contiguous allocation algorithms (Paging (0), Multiple
Partner, and Random) proposed for k-ary n-cube connected multi computers have been …

Single-chip multicore processors and their network on chip interconnection mechanisms
have received extensive interest since the early 2000s. The mesh topology is popular in …

В данной работе описывается симулятор вычислительного кластера и его
управляющей системы, учитывающий его топологию, коммуникационные задержки при …

В данной работе представлены теоретические основы экспериментального
исследования алгоритмов планирования задач для вычислительного кластера …