首页> 外国专利> Scheduling jobs in a plurality of queues and dividing jobs into high and normal priority and calculating a queue selection reference value

Scheduling jobs in a plurality of queues and dividing jobs into high and normal priority and calculating a queue selection reference value

机译:在多个队列中调度作业并将作业分为高优先级和普通优先级,并计算队列选择参考值

摘要

A scheduling method for inputting jobs into queues provided for each of a plurality of information processing devices in a distributed processing system includes inputting jobs into each queue. A queue selection reference value is calculated for each queue, based on a predicted time at which processing of a job in execution in each information processing device is finished and a predicted time necessary for executing processing on high priority jobs input into the queue associated with the corresponding information processing device. A target job which was input into the corresponding queue at the earliest time is extracted from among the normal jobs input into all the queues. The target job is shifted to the queue having the smallest queue selection reference value. A new queue selection reference value of the queue to which the target job is shifted is calculated on the basis of a predicted time necessary for executing processing on the target job. Finally, a new target job is extracted.
机译:用于将作业输入到为分布式处理系统中的多个信息处理设备中的每一个提供的队列中的调度方法包括将作业输入到每个队列中。基于每个信息处理设备中正在执行的作业的处理的预测时间和对与该信息处理设备关联的队列中输入的高优先级作业执行处理所需的预测时间,针对每个队列计算队列选择参考值。相应的信息处理设备。从输入到所有队列中的正常作业中,提取最早输入到相应队列中的目标作业。目标作业转移到队列选择参考值最小的队列。基于对目标作业执行处理所需的预测时间,计算目标作业被移至的队列的新队列选择参考值。最后,提取新的目标作业。

著录项

  • 公开/公告号US8161485B2

    专利类型

  • 公开/公告日2012-04-17

    原文格式PDF

  • 申请/专利权人 AKIRA ISHISAKA;NAOYA TESHIMA;

    申请/专利号US20070905355

  • 发明设计人 AKIRA ISHISAKA;NAOYA TESHIMA;

    申请日2007-09-28

  • 分类号G06F9/46;

  • 国家 US

  • 入库时间 2022-08-21 17:28:20

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号