• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
【24h】

A Game Theory-Based Pricing Strategy to Support Single/Multiclass Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems

机译：基于博弈论的定价策略，用于带宽受限的分布式计算系统的单/多类作业分配方案

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Today's distributed computing systems incorporate different types of nodes with varied bandwidth constraints which should be considered while designing cost-optimal job allocation schemes for better system performance. In this paper, we propose a fair pricing strategy for job allocation in bandwidth-constrained distributed systems. The strategy formulates an incomplete information, alternating-offers bargaining game on two variables, such as price per unit resource and percentage of bandwidth allocated, for both single and multiclass jobs at each node. We present a cost-optimal job allocation scheme for single-class jobs that involve communication delay and, hence, the link bandwidth. For fast and adaptive allocation of multiclass jobs, we describe three efficient heuristics and compare them under different network scenarios. The results show that the proposed algorithms are comparable to existing job allocation schemes in terms of the expected system response time over all jobs.
机译：当今的分布式计算系统结合了具有不同带宽约束的不同类型的节点，在设计成本最优的作业分配方案以提高系统性能时应考虑这些问题。在本文中，我们提出了一种在带宽受限的分布式系统中分配工作的公平定价策略。该策略针对每个节点上的单类和多类作业，针对两个变量（例如，每单位资源的价格和分配的带宽百分比）制定了不完整的信息，交替报价的讨价还价博弈。我们为涉及通信延迟和链接带宽的单类作业提出了一种成本最优的作业分配方案。为了快速，自适应地分配多类作业，我们描述了三种有效的启发式方法，并在不同的网络场景下进行了比较。结果表明，就所有作业的预期系统响应时间而言，所提出的算法与现有的作业分配方案具有可比性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号