TY - JOUR

T1 - Optimal Cyclic Scheduling on Parallel Processors with Special Precedence Constrains

AU - Григорьева, Наталья Сергеевна

PY - 2026/2/24

Y1 - 2026/2/24

N2 - We consider the multiprocessors scheduling problem, where a set of jobs V is performed on m identical parallel processors and it is to be repeated an infinitely number of times. Precedence constraints between jobs are represented by a uniform graph G. The goal is to generate a periodic schedule, which is a schedule of one iteration repeated within a fixed time interval called the period (cycle). Cyclic scheduling is aimed to find a periodic schedule with the minimum period. Precedence constraints between jobs are represented by a uniform graph G. We propose cyclic scheduling algorithms for four problems with parallel processors. Bibliography: 18 titles.

AB - We consider the multiprocessors scheduling problem, where a set of jobs V is performed on m identical parallel processors and it is to be repeated an infinitely number of times. Precedence constraints between jobs are represented by a uniform graph G. The goal is to generate a periodic schedule, which is a schedule of one iteration repeated within a fixed time interval called the period (cycle). Cyclic scheduling is aimed to find a periodic schedule with the minimum period. Precedence constraints between jobs are represented by a uniform graph G. We propose cyclic scheduling algorithms for four problems with parallel processors. Bibliography: 18 titles.

UR - https://www.mendeley.com/catalogue/e95c58cb-ffcf-3c46-aa78-87cf803404a1/

U2 - 10.1007/s10958-026-08234-4

DO - 10.1007/s10958-026-08234-4

M3 - Article

VL - 296

SP - 45

EP - 66

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 1

ER -