首页> 外国专利> Scheduling Method in Real-Time Multiprocessor System

Scheduling Method in Real-Time Multiprocessor System

机译:实时多处理器系统中的调度方法

摘要

The present invention performs periodic conversion by allocating a newly transformed period to a new basic number during the period conversion of a task, thereby converting the period close to the original period, and in the order of tasks in which the difference between the converted period and the raw period is minimum. It is an object of the present invention to provide a scheduling method for scheduling by allocation.;According to the present invention, a first step of initializing an index value of a task and designating a period of the minimum value among the task periods in the input task set as a base number, and multiplying the specified base number by an arbitrary natural number k, than the raw period After selecting a small maximum value as a conversion period, the second step of designating the converted current period as a new basis number, and increasing the index value until the conversion process is completed for the period of all the input tasks; A third step of repeating the steps below, a fourth step of checking whether a processor capable of scheduling is present when the periodic conversion process for all periodic tasks is completed, and a whole of the periodic task if scheduling is not possible in the fourth step A fifth step of repeating the fourth step after increasing the minimum integer value greater than the load, and a processor capable of scheduling in the fourth step Is present, a scheduling method in a real-time multiprocessor system is provided, comprising a sixth step of allocating a task with a minimum difference between a task's original period and a conversion period to a processor.
机译:本发明通过在任务的时间段转换期间将新转换的时间段分配给新的基数来执行周期性转换,从而转换接近原始时间段的时间段,并且按照任务的顺序进行转换,其中转换后的时间段与原始时间最少。本发明的目的是提供一种用于通过分配进行调度的调度方法。根据本发明,第一步是初始化任务的索引值并在任务周期中的任务周期中指定最小值的周期。将输入任务设置为基数,并将指定基数乘以任意自然数k,然后将其与原始周期相乘选择较小的最大值作为转换周期后,第二步将转换后的当前周期指定为新的基数,并增加索引值,直到在所有输入任务期间完成转换过程为止;重复以下步骤的第三步;检查所有周期性任务的周期性转换过程是否完成时,检查是否存在能够进行调度的处理器的第四步;如果在第四步中无法进行调度,则检查整个周期性任务在增加大于负载的最小整数值之后重复第四步骤的第五步骤,以及存在能够在第四步骤中进行调度的处理器,提供了一种实时多处理器系统中的调度方法,包括第六步骤:将任务的原始时间段与转换时间段之间的差异最小的任务分配给处理器。

著录项

  • 公开/公告号KR19990073758A

    专利类型

  • 公开/公告日1999-10-05

    原文格式PDF

  • 申请/专利权人 윤덕용;

    申请/专利号KR19980006861

  • 发明设计人 이흥규;이귀영;

    申请日1998-03-03

  • 分类号G05B19/414;

  • 国家 KR

  • 入库时间 2022-08-22 02:16:39

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号