Task allocation method and task allocation apparatus
    1.
    发明授权
    Task allocation method and task allocation apparatus 有权
    任务分配方法和任务分配装置

    公开(公告)号:US07930339B2

    公开(公告)日:2011-04-19

    申请号:US11559458

    申请日:2006-11-14

    IPC分类号: G06F9/46

    摘要: A distributed processing system includes plural nodes each provided with a processor and communicably connected to each other. A task information obtaining unit obtains antecedent dependency between tasks. A node information obtaining unit obtains a time constraint imposed on the tasks. A start time computing unit computes an absolute earliest start time at which a task can be started and an absolute latest start time allowed in order to complete the task within the time constraint, by referring to the time constraint. A node selector selects a destination node to which a target task not yet allocated to a node should be allocated, by referring to the absolute earliest start time and the absolute latest start time. A task placement unit causes the task to be executed in the selected node.

    摘要翻译: 分布式处理系统包括多个节点,每个节点设置有处理器并且彼此可通信地连接。 任务信息获取单元获得任务之间的依赖关系。 节点信息获取单元获得施加在任务上的时间约束。 开始时间计算单元通过参考时间约束来计算允许任务开始的绝对最早开始时间和允许绝对最新开始时间,以便在时间约束内完成任务。 节点选择器通过参考绝对最早的开始时间和绝对最新的开始时间来选择尚未分配给节点的目标任务应当被分配的目的地节点。 任务放置单元导致在所选节点中执行任务。

    Task Allocation Method And Task Allocation Apparatus
    2.
    发明申请
    Task Allocation Method And Task Allocation Apparatus 有权
    任务分配方法和任务分配装置

    公开(公告)号:US20070110094A1

    公开(公告)日:2007-05-17

    申请号:US11559458

    申请日:2006-11-14

    IPC分类号: H04L12/42

    摘要: A distributed processing system includes plural nodes each provided with a processor and communicably connected to each other. A task information obtaining unit obtains antecedent dependency between tasks. A node information obtaining unit obtains a time constraint imposed on the tasks. A start time computing unit computes an absolute earliest start time at which a task can be started and an absolute latest start time allowed in order to complete the task within the time constraint, by referring to the time constraint. A node selector selects a destination node to which a target task not yet allocated to a node should be allocated, by referring to the absolute earliest start time and the absolute latest start time. A task placement unit causes the task to be executed in the selected node.

    摘要翻译: 分布式处理系统包括多个节点,每个节点设置有处理器并且彼此可通信地连接。 任务信息获取单元获得任务之间的依赖关系。 节点信息获取单元获得施加在任务上的时间约束。 开始时间计算单元通过参考时间约束来计算允许任务开始的绝对最早开始时间和允许绝对最新开始时间,以便在时间约束内完成任务。 节点选择器通过参考绝对最早的开始时间和绝对最新的开始时间来选择尚未分配给节点的目标任务应当被分配的目的地节点。 任务放置单元导致在所选节点中执行任务。