More and more parallel and distributed systems (cluster, grid and global computing) are
both becoming available all over the world, and opening new perspectives for developers of …

We propose a two-step algorithm that efficiently constructs a schedule of minimum
makespan for the precedence multiprocessor constrained scheduling problem in the …

More and more parallel and distributed systems (cluster, grid and global computing) are
both becoming available all over the world, and opening new perspectives for developers of …

Актуальность темы. Объектом исследования настоящей диссертации являются задачи
теории расписаний. Это широкий круг, как правило, NP-трудных задач комбинаторной …

Until recently, the standard communication model for scheduling the task of a parallel
program has been the homogeneous communication model (also known as the delay …

We investigate on the issue of minimizing the makespan (resp. the sum of the completion
times) for the multiprocessor scheduling problem in presence of hierarchical …

Using dUJ)lication for the mnltiiπocessoi· scheduling problem with lιierarclιical
commnnications Page 1  …

We investigate the problem of minimizing the makespan (resp. the sum of the completion
time) for the multiprocessor scheduling problem in presence of hierarchical communications …

We study the hierarchical multiprocessor scheduling problem with a constant number of
clusters. We show that the problem of deciding whether there is a schedule of length three …

Эви а ж вианИ и зи в ж гббйв и гв бг а гж з Й йа в и и з з г д ж аа а джг ж б з в и гЙ бг в гйз
гббйв и гв бг а Д азг вглв з и Й а н бг аЕ вижг й н Ъ нл ж ЙЫб и гж йв иЙ м йи гвЙ и б зИ йв …