Optimal policies for load balancing for distributed and strategic agents (more technically, optimal coordination mechanisms for machine scheduling)
    1.
    发明授权
    Optimal policies for load balancing for distributed and strategic agents (more technically, optimal coordination mechanisms for machine scheduling) 有权
    用于分布式和战略代理的负载平衡的最优策略(技术上更为机器调度的最佳协调机制)

    公开(公告)号:US08028293B2

    公开(公告)日:2011-09-27

    申请号:US11770667

    申请日:2007-06-28

    IPC分类号: G06F9/46 G06F15/173

    摘要: Providing for scheduling tasks in a distributed system based on an inefficiency of each task on a particular machine as compared with available networked machines is described herein. By way of example, a distribution component can receive a plurality of tasks at a machine assigned by at least one independent agent. In addition, an ordering component can schedule each task on a machine as a function of non-decreasing inefficiency. Such a policy can be implemented locally at the machine, minimizing inter-device communication, while only marginally increasing completion time for the set of tasks. In such a manner, the subject disclosure provides for load balancing of distributed systems in a manner that utilizes fewer resources than conventional approaches.

    摘要翻译: 这里描述了与可用的联网机器相比,基于特定机器上的每个任务的低效率来提供分布式系统中的调度任务。 作为示例,分发组件可以在由至少一个独立代理分配的机器上接收多个任务。 此外,订购组件可以将机器上的每个任务作为不降低的无效率的函数进行调度。 这样的策略可以在机器本地实现,从而最小化设备间通信,同时仅稍微增加该组任务的完成时间。 以这种方式,主题公开以与传统方法相比较少的资源的方式提供分布式系统的负载平衡。

    OPTIMAL POLICIES FOR LOAD BALANCING FOR DISTRIBUTED AND STRATEGIC AGENTS (MORE TECHNICALLY, OPTIMAL COORDINATION MECHANISMS FOR MACHINE SCHEDULING)
    2.
    发明申请
    OPTIMAL POLICIES FOR LOAD BALANCING FOR DISTRIBUTED AND STRATEGIC AGENTS (MORE TECHNICALLY, OPTIMAL COORDINATION MECHANISMS FOR MACHINE SCHEDULING) 有权
    用于分布式和策略性代理的负载均衡的最佳政策(更具技术性的是机器调度的最佳协调机制)

    公开(公告)号:US20090007101A1

    公开(公告)日:2009-01-01

    申请号:US11770667

    申请日:2007-06-28

    IPC分类号: G06F9/455 G06F9/46

    摘要: Providing for scheduling tasks in a distributed system based on an inefficiency of each task on a particular machine as compared with available networked machines is described herein. By way of example, a distribution component can receive a plurality of tasks at a machine assigned by at least one independent agent. In addition, an ordering component can schedule each task on a machine as a function of non-decreasing inefficiency. Such a policy can be implemented locally at the machine, minimizing inter-device communication, while only marginally increasing completion time for the set of tasks. In such a manner, the subject disclosure provides for load balancing of distributed systems in a manner that utilizes fewer resources than conventional approaches.

    摘要翻译: 这里描述了与可用的联网机器相比,基于特定机器上的每个任务的低效率来提供分布式系统中的调度任务。 作为示例,分发组件可以在由至少一个独立代理分配的机器上接收多个任务。 此外,订购组件可以将机器上的每个任务作为不降低的无效率的函数进行调度。 这样的策略可以在机器本地实现,从而最小化设备间通信,同时仅稍微增加该组任务的完成时间。 以这种方式,主题公开以与传统方法相比较少的资源的方式提供分布式系统的负载平衡。