助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   minimum completion time 的翻译结果: 查询用时:0.192秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
自动化技术
更多类别查询

图标索引 历史查询
 

minimum completion time
相关语句
  最小完成时间
     Based on genetic algorithm and MCT(minimum completion time) algorithm, a new hybrid genetic algorithm was presented for independent tasks scheduling in heterogeneous computing systems. Genetic algorithm was used to evolve a priority queue first, and then the priority queue was mapped to a schedule using MCT algorithm. The simulation results comparing with other scheduling algorithm show that it produces better results in terms of schedule length, and it has good convergent speed.
     针对异构计算系统的独立任务调度问题 ,基于遗传算法和最小完成时间算法MCT(MinimumCompletionTime) ,提出一种新的混合遗传算法 ,它采用遗传算法来进化任务调度的优先队列 ,然后再使用MCT算法把优先队列解码为一个有效的调度 ,与文献中其它算法进行比较表明 ,它不但能产生更好的调度结果 ,而且有很好的收敛速度 .
短句来源
  “minimum completion time”译为未确定词的双语例句
     In this paper, We discuss the identical parallel machine scheduling with nonsimultaneous machine availeble time. Since it is NP-hard, We give the worst case analysis of LPT algorithm so as to minimize makespan or maximize minimum completion time.
     本文讨论带机器准备时间的平行机排序问题.由于它是NP-hard的,我们讨论近似算法LPT,研究它在使makespan达到最小和minimumcompletiontime达到最大两个目标下的近似程度.
短句来源
     Based on the analysis of some task scheduling strategies under different environments,a repeated mapping scheduling strategy for gird resource management system,which considers the Minimum Completion Time of mapping a set of tasks to resources,is presented.
     通过分析比较当前多种环境下任务调度策略的基础之上,提出了一种适用于网格资源管理系统的多次映射任务调度策略。
短句来源
  相似匹配句对
     Completion of Codes
     码的完全化
短句来源
     b)the principle of completion;
     完备性原则 ;
短句来源
     The single scheduling problem of minimum total completion times with discounted weight
     一类带折扣加权总完工时间单机排序问题
短句来源
     The goal is to minimize the maximum machine completion time and to maximize the minimum machine completion time.
     目标是极小化最大的机器完工时间(C_(max))和极大化最小的机器完工时间(C_(min))。
短句来源
     Linear Algorithms for Maximizing the Minimum Machine Completion Time on Two and Three Parallel Machines
     使两台和三台平行机的最小完工时间为最大的线性算法
短句来源
查询“minimum completion time”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  minimum completion time
The optimality criterion considered is the minimum completion time.
      
Two objectives are considered, maximizing the minimum completion time and minimizing the maximum completion time (makespan).
      
Fuzzy arithmetic on fuzzy numbers is used to determine the minimum completion time (Cmax).
      
For the problem of maximizing the minimum completion time, we develop an algorithm, such that the minimum completion time in the schedule produced by this algorithm is at least 2/3 times the minimum completion time in the optimum schedule.
      
The task is then assigned to the machine in the set with the minimum completion time for the task.
      
更多          


In this paper, We discuss the identical parallel machine scheduling with nonsimultaneous machine availeble time. Since it is NP-hard, We give the worst case analysis of LPT algorithm so as to minimize makespan or maximize minimum completion time.

本文讨论带机器准备时间的平行机排序问题.由于它是NP-hard的,我们讨论近似算法LPT,研究它在使makespan达到最小和minimumcompletiontime达到最大两个目标下的近似程度.

Efficient tasks scheduling is critical for achieving high performance in heterogeneous computing systems. The tasks scheduling problem is NP-hard in general. In order to obtain better solutions, many scheduling heuristics were presented in the literature. Based on genetic algorithm and MCT(minimum completion time) algorithm, a new hybrid genetic algorithm was presented for independent tasks scheduling in heterogeneous computing systems. Genetic algorithm was used to evolve a priority queue first, and then...

Efficient tasks scheduling is critical for achieving high performance in heterogeneous computing systems. The tasks scheduling problem is NP-hard in general. In order to obtain better solutions, many scheduling heuristics were presented in the literature. Based on genetic algorithm and MCT(minimum completion time) algorithm, a new hybrid genetic algorithm was presented for independent tasks scheduling in heterogeneous computing systems. Genetic algorithm was used to evolve a priority queue first, and then the priority queue was mapped to a schedule using MCT algorithm. The simulation results comparing with other scheduling algorithm show that it produces better results in terms of schedule length, and it has good convergent speed.

有效的任务调度是异构计算系统获取高性能的关键因素之一 ,由于任务调度问题是NP 困难的 ,为了获取尽可能好的解 ,文献中存在许多启发式调度算法 .针对异构计算系统的独立任务调度问题 ,基于遗传算法和最小完成时间算法MCT(MinimumCompletionTime) ,提出一种新的混合遗传算法 ,它采用遗传算法来进化任务调度的优先队列 ,然后再使用MCT算法把优先队列解码为一个有效的调度 ,与文献中其它算法进行比较表明 ,它不但能产生更好的调度结果 ,而且有很好的收敛速度 .

Grid Computing is the third wave of information technology after Internet and Web technology.As the resources under the grid environment are heterogeneous,dynamic and widely distributed,the resource management and scheduling are very complicated.Based on the analysis of some task scheduling strategies under different environments,a repeated mapping scheduling strategy for gird resource management system,which considers the Minimum Completion Time of mapping a set of tasks to resources,is presented.Incorporated...

Grid Computing is the third wave of information technology after Internet and Web technology.As the resources under the grid environment are heterogeneous,dynamic and widely distributed,the resource management and scheduling are very complicated.Based on the analysis of some task scheduling strategies under different environments,a repeated mapping scheduling strategy for gird resource management system,which considers the Minimum Completion Time of mapping a set of tasks to resources,is presented.Incorporated with the demands of different users,the repeated mapping algorithm is more suitable for the dynamic adaptability and domain autonomy in the gird.

网格计算是继Internet和W eb技术之后,又一次信息技术浪潮。由于资源具有广域分布、异构、动态等特性,网格环境下的资源管理和调度是一个非常复杂且具有挑战性的问题。通过分析比较当前多种环境下任务调度策略的基础之上,提出了一种适用于网格资源管理系统的多次映射任务调度策略。该策略在追求最短任务完成时间的同时,兼顾到了不同用户的需求,从而更好的适应了网格资源动态变化的特性。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关minimum completion time的内容
在知识搜索中查有关minimum completion time的内容
在数字搜索中查有关minimum completion time的内容
在概念知识元中查有关minimum completion time的内容
在学术趋势中查有关minimum completion time的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社