助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   completion time 在 互联网技术 分类中 的翻译结果: 查询用时:0.173秒
图标索引 在分类学科中查询
所有学科
互联网技术
数学
计算机软件及计算机应用
企业经济
工业通用技术及设备
中国通史
中国文学
更多类别查询

图标索引 历史查询
 

completion time
相关语句
  完成时间
    The results of experiment show that the improved algorithm can increase the average usage of processors 7.1 percent, 12.5 percent, 12.8 percent when the speed of network flow distinguishly is 5000 packages per second, 7500 packages per second, 10000 packages per second and decrease the completion time of the whole tasks, which improves the performance of intrusion detection system.
    实验可以从处理器的平均利用率和任务的整体完成时间随着任务数的增加而变化两方面来分析,分析结果表明改进后的新算法当网络速度为5000分组/秒、7500分组/秒、10000分组/秒时,处理器的平均利用率分別提高了7.1%、12.5%、12.8%,同时,降低了任务的整体完成时间,从而提高了入侵检测系统的整体性能。
短句来源
    Thirdly, it analyses prediction technology in scheduling, and proposes prediction model to predict task expected completion time using subtasks with maximum mathematical expectation.
    在此基础上,建立基于数学期望的任务预期完成时间预测模型,用具有最大期望完成时间的子任务预测任务预期完成时间;
短句来源
    In this paper, aiming at the fact that some large subtasks in the DAG scheduling could delay the completion time of application task, the definitions of key task and resource-reserving opportunity along with the idea of dynamically reserving resources for key tasks was brought forward, which could actually reduce the completion time of application task. In this paper, on the basis of dynamical resource reservation, a task-mapping algorithm based on DAG in Grid environment named KtRR is provided.
    针对DAG调度中个别大子任务制约任务完成时间的情况,本文提出了关键任务和资源预留时机的定义,以及为关键任务动态预留资源的思想,并提出了一种网格环境中基于DAG的任务映射算法—KtRR,从而达到有效缩短任务的执行时间的目的。
短句来源
    It is demonstrated that algorithm can reduce the completion time of the parallel program.
    研究表明该算法能减少此类并行程序的完成时间 .
短句来源
    Focusing on both the job completion time and the cost of the tasks, an explicit model to schedule independent tasks was presented.
    重点考虑工作完成时间和所耗费用 ,给出确定的模型以调度独立的任务。
短句来源
更多       
  “completion time”译为未确定词的双语例句
    Based on batch mode and remapping principle, a time balancing based scheduling (TBBS for short) algorithm is proposed to minimize the completion time of tasks for high-throughput computing.
    采用批模式和重复调度策略,提出基于时间均衡的任务调度算法(Time-Balancing Based Schedul ing Algorithm,简称TBBS算法)。
短句来源
    Based on the research of the advantage and disadvantage of the resource management techniques in using now in the Grid, This article import economic principles to Grid Computing, apply price mechanism to Grid Computing and focus on the task scheduling under the limit of job completion time and the cost of the tasks. Aim to independent and parallel tasks, this article present a task scheduling model and transform Grid task scheduling to tree traversal problem.
    本文根据当前网格任务调度相关研究的长处和不足,将经济学原理引入网格,应用价格机制,将任务调度的重点放在了任务的时间截止期和费用约束上,针对相互独立的并行任务,给出了任务调度模型,将网格中的任务调度问题转化成树的遍历问题。
短句来源
    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.
    通过分析比较当前多种环境下任务调度策略的基础之上,提出了一种适用于网格资源管理系统的多次映射任务调度策略。
短句来源
    The performance of this new scheduling algorithm,achieving lower job completion time and sat- isfying user's QoS demand,is demonstrated by its implementation on Gridsim.
    通过在Gridsim环境下的分析与比较,该算法在满足用户要求的QoS需求同时,能够以尽可能少的时间完成任务.
短句来源
    Simulation results show that the algorithm can achieve less completion time and lower cost which can meet requirements in practical applications.
    模拟结果显示该调度算法符合计算网格的复杂环境,能够更好地满足不同用户的实际需要。
短句来源
更多       
查询“completion time”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  completion time
The objective functions are the minimizing of makespan and total weighted completion time.
      
The objective is to minimize the maximum job completion time.
      
The objective is to minimize the longest job completion time (makespan).
      
Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines
      
The reaction completion time was directly proportional to the initial concentration of Ca(OH)2 in slurry above 0.5 wt%.
      
更多          


With enough resources and fixed completion time in a given flow-shop system ,the working time of every process ranges from the earliest to the latest .As a result ,the schedules of Jobs in the system are formed . This essay deals with effects of the schedules of jobs in the static flow-shop system on the capacity of buffers size ,and it indicates the calculating method that the schedules of jobs decide the capacity of buffers size .

给定一个Flow -Shop网络 ,在资源具备且输出时间一定的条件下 ,网络中的各道工序的开工时间仍可在其最早开工时间和最迟开工时间之间变动 [2 ],由此构成网络中的各种不同的作业计划。本文分析了Flow -Shop网络静态系统不同作业计划对缓冲区容量的影响 ,给出了作业计划确定缓冲区容量的计算方法

Clusters of workstations on common network are much increasing being used as cost effective parallel computing platforms. Task scheduling is one of the crucial problems in cluster computing. A new scheduling graph model is developed to present a kind of special parallel program, which solves synchronous working problem among coarse grained tasks in message passing system. A scheduling algorithm that maps this kind of program onto a cluster is provided, which consists of some idle workstations in a LAN for...

Clusters of workstations on common network are much increasing being used as cost effective parallel computing platforms. Task scheduling is one of the crucial problems in cluster computing. A new scheduling graph model is developed to present a kind of special parallel program, which solves synchronous working problem among coarse grained tasks in message passing system. A scheduling algorithm that maps this kind of program onto a cluster is provided, which consists of some idle workstations in a LAN for parallel computing. It is demonstrated that algorithm can reduce the completion time of the parallel program.

利用网上空闲处理机组成机群并行计算环境是快速增长的研究领域 ,任务调度是其中最关键性的问题之一 .在基于消息传递机制的网络并行计算环境下 ,针对一类大粒度计算任务并行时协同同步工作问题 ,发展了一种新的静态调度模型 ,提出了调度算法 ,它映射一类特殊的并行程序任务到由网络上若干空闲处理机组成的机群中 .研究表明该算法能减少此类并行程序的完成时间 .

In network planning, for dealing with the uncertainty of activity duration, a finish-time membership function for activity is provided, and a method to get project completion-time membership function is given. In this paper, a sample is adopted to show how to analysis the critical path in network planning with project completion-time membership function.

文中为处理网络计划模型中工序作业时间的不确定性,提出了用工序完工隶属函数描述作业时间不确定性,并给出了求工程的完工隶属函数的方法,最后说明了利用工程的完工隶属函数进行关键路线分析。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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