...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Automatic Control >On a conjecture about assigning jobs to processors of differing speeds
【24h】

On a conjecture about assigning jobs to processors of differing speeds

机译：关于将作业分配给不同速度的处理器的猜想

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

摘要

A difficult control problem concerning jobs that arrive to a buffer in a Poisson process and are to be assigned to m processors of different speeds is treated. The processors operate in parallel, and processing times are independent and exponentially distributed. Once a job is assigned to a free processor, it occupies that processor until completed and may not be reassigned to a faster processor if one becomes free. A reasonable conjecture that remains unproved for more than two processors is that the policy that minimizes the mean waiting time is of threshold type. This conjecture is discussed, and it is shown that whether or not a job should be assigned to a processor can depend not only on the number in the queue and the speed of the fastest-available processor, but also on whether slower processors are busy or idle. A strengthened form of the conjecture is proposed.
机译：处理了一个困难的控制问题，该问题涉及在泊松过程中到达缓冲区并分配给m个不同速度处理器的作业。处理器并行运行，处理时间是独立的并且呈指数分布。将作业分配给空闲处理器后，它将占用该处理器，直到完成为止，并且如果一个空闲，则可能不会将其重新分配给速度更快的处理器。对于两个以上的处理器，仍然没有得到证明的合理推测是，使平均等待时间最小化的策略是阈值类型。讨论了这个猜想，结果表明，是否应将作业分配给处理器，不仅取决于队列中的数目和最快可用处理器的速度，还取决于较慢的处理器是否忙碌或繁忙。闲。提出了一种强化形式的猜想。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号