首页> 外文会议>The 8th international conference on optimization: Techniques and Applications >Scheduling Flexible Multiprocessor Tasks:Performance Guarantees and Polynomially Solvable Cases
【24h】

Scheduling Flexible Multiprocessor Tasks:Performance Guarantees and Polynomially Solvable Cases

机译:安排灵活的多处理器任务:性能保证和多项式可解决的案例

获取原文
获取原文并翻译 | 示例

摘要

The talk is concerned with scheduling partially ordered flexible multiprocessor tasks on parallel machines. A task is a flexible multiprocessor task if it can be processed by several machines simultaneously and the number of machines can be changed at any point in time. The goal is to minimise the criterion of maximum lateness. The considered problem is a generalisation of the classical parallel machine scheduling problem with preemptions. The presented results were unknown even for the above mentioned classical problem. This includes a new worst case performance guarantee and new conditions for polynomial solvability.
机译:演讲涉及在并行计算机上安排部分排序的灵活多处理器任务。如果一个任务可以同时由多台计算机处理,并且可以在任何时间点更改计算机数量,则它是一种灵活的多处理器任务。目的是最小化最大延迟的标准。所考虑的问题是带抢占的经典并行机调度问题的推广。即使对于上述经典问题,所给出的结果也是未知的。这包括新的最坏情况性能保证和多项式可解性的新条件。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号