Scholarlink

<p>We consider the multiprocessors scheduling problem, where a set of jobs V is performed on <i>m</i> identical parallel processors and it is to be repeated an infinitely number of times. Precedence constraints between jobs are represented by a uniform graph <i>G</i>. 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 <i>G</i>. We propose cyclic scheduling algorithms for four problems with parallel processors. Bibliography: 18 titles.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

OPTIMAL CYCLIC SCHEDULING ON PARALLEL PROCESSORS WITH SPECIAL PRECEDENCE CONSTRAINS

  • 期刊论文

  • 发表日期：

    2026年1月1日

查看全文
  • N. S. Grigoreva

摘要

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.