首页> 外文期刊>International Journal of Electrical and Computer Engineering >A Prolific Scheme for Load Balancing Relying on Task Completion Time
【24h】

A Prolific Scheme for Load Balancing Relying on Task Completion Time

机译:一种基于任务完成时间的负载均衡解决方案

获取原文
           

摘要

In networks with lot of computation, load balancing gains increasing significance. To offer various resources, services and applications, the ultimate aim is to facilitate the sharing of services and resources on the network over the Internet. A key issue to be focused and addressed in networks with large amount of computation is load balancing. Load is the number of tasks‘t’ performed by a computation system. The load can be categorized as network load and CPU load. For an efficient load balancing strategy, the process of assigning the load between the nodes should enhance the resource utilization and minimize the computation time. This can be accomplished by a uniform distribution of load of to all the nodes. A Load balancing method should guarantee that, each node in a network performs almost equal amount of work pertinent to their capacity and availability of resources. Relying on task subtraction, this work has presented a pioneering algorithm termed as E-TS (Efficient-Task Subtraction). This algorithm has selected appropriate nodes for each task. The proposed algorithm has improved the utilization of computing resources and has preserved the neutrality in assigning the load to the nodes in the network.
机译:在具有大量计算的网络中,负载平衡的重要性日益提高。为了提供各种资源,服务和应用程序,最终目的是促进通过Internet在网络上共享服务和资源。在具有大量计算的网络中要重点解决的关键问题是负载平衡。负载是计算系统执行的“未完成”任务的数量。负载可以分为网络负载和CPU负载。对于有效的负载平衡策略,在节点之间分配负载的过程应提高资源利用率并最大程度地减少计算时间。这可以通过将负载的平均分配到所有节点来实现。负载平衡方法应确保网络中的每个节点执行与其容量和资源可用性相关的几乎相等的工作量。依靠任务减法,这项工作提出了一种开创性算法,称为E-TS(有效任务减法)。该算法已为每个任务选择了适当的节点。所提出的算法提高了计算资源的利用率,并且在将负载分配给网络中的节点时保持了中立性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号