Location:
Search - lqx10002
Search list
Description: 最佳高度问题。
问题描述：
假设有n个任务由K个可并行工作的机器完成。完成任务i需要的时间为t(i)。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-best height of the problem. Problem description : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the time t (i). Try to find an algorithm designed to complete tasks n the best scheduling, made to complete all tasks in the first.
Platform: |
Size: 1342 |
Author: 卢起雪 |
Hits:
Description: 最佳高度问题。
问题描述：
假设有n个任务由K个可并行工作的机器完成。完成任务i需要的时间为t(i)。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-best height of the problem. Problem description : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the time t (i). Try to find an algorithm designed to complete tasks n the best scheduling, made to complete all tasks in the first.
Platform: |
Size: 1024 |
Author: 卢起雪 |
Hits: