Abstract

The problem of compiling an acceptable multiprocessor schedule without interruptions and switching is considered for the case when the set of partial relations is specified on the set of operations, all operations have a common deadline, and the distribution of tasks on the processors is specified. At some undetermined times, requests may be made to perform additional, higher priority operations, for which some processors are freed for a certain time. As a result, the execution of the initial set of tasks is postponed to a later time and thereby violates the schedule built for it. A strategy is developed for constructing an acceptable schedule in which the probability of its violation due to requests for additional operations is minimal.

中文翻译：

---

具有未指定运行准备时间的多处理器系统中的计划计算

摘要

当在一组操作中指定了部分关系集，所有操作具有共同的截止日期并指定了任务在处理器上的分配时，考虑了在不中断和切换的情况下编译可接受的多处理器调度程序的问题。在一些不确定的时间，可能会请求执行其他更高优先级的操作，某些处理器在一定时间内被释放。结果，将初始任务集的执行推迟到以后的时间，从而违反为其建立的时间表。开发了一种用于构造可接受的时间表的策略，其中由于对其他操作的请求而违反时间表的可能性最小。