首页> 外国专利> TASK SCHEDULING DEVICE, TASK SCHEDULING METHOD, AND TASK SCHEDULING PROGRAM

TASK SCHEDULING DEVICE, TASK SCHEDULING METHOD, AND TASK SCHEDULING PROGRAM

机译:任务调度设备,任务调度方法和任务调度程序

摘要

PROBLEM TO BE SOLVED: To provide a task scheduling device which schedules tasks having more overlapping memory access regions than other tasks in such a way that they can be executed in succession.;SOLUTION: Task information including task specific information for identifying a task is acquired in plurality, and access information indicating the arrangement of memory regions to be accessed in the task is acquired, which information is stored in access region storage means after being correlated to the task specific information. From the access information on two of the tasks, task correlation indicating the overlapping amount of memory regions to be accessed in two of the tasks is calculated. To ensure that, among combinations of the task at the top or the end of a task queue which is the queue of the tasks in which order they are executed with any of the tasks not included in the task queue, the tasks of combinations where the task correlation is highest are contiguous, the tasks not included in the task queue are added to the task queue and information indicating the task queue is output.;COPYRIGHT: (C)2013,JPO&INPIT
机译:解决的问题:提供一种任务调度设备,该任务调度设备以比其他任务连续的方式调度具有比其他任务更多的重叠存储器访问区域的任务;解决方案:获得包括用于识别任务的任务特定信息的任务信息。然后,获取指示任务中要访问的存储区域的布置的访问信息,该信息在与任务特定信息相关联之后存储在访问区域存储装置中。根据关于两个任务的访问信息,计算指示在两个任务中要访问的存储器区域的重叠量的任务相关性。为了确保在任务队列的顶部或末端的任务组合(按任务顺序排列的任务队列)中执行的任务与未包含在任务队列中的任何任务一起,在组合任务中任务相关性最高的是连续的,未包含在任务队列中的任务会添加到任务队列中,并输出指示任务队列的信息。版权所有:(C)2013,JPO&INPIT

著录项

  • 公开/公告号JP2013150094A

    专利类型

  • 公开/公告日2013-08-01

    原文格式PDF

  • 申请/专利权人 NEC CORP;

    申请/专利号JP20120007856

  • 发明设计人 TAKANO FUMIYO;

    申请日2012-01-18

  • 分类号H04N7/32;G06F9/48;

  • 国家 JP

  • 入库时间 2022-08-21 17:00:44

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号