任务图的英文

• artifact
• task image

• "任务"英文翻译    task; job
• "图"英文翻译    picture; chart; drawing; map
• "任务图象" 英文翻译 :    task image
• "可处理任务图" 英文翻译 :    processable task graph
• "事务图" 英文翻译 :    transaction diagram
• "邮务图" 英文翻译 :    postal map
• "事务图形" 英文翻译 :    business graphics
• "业务图表" 英文翻译 :    business graphics
• "任务" 英文翻译 :    assignment; mission; task; duties; job 接受任务 receive an assignment; accept an assignment; 担负艰巨的任务 shoulder heavy responsibilities; 我们保证完成任务。 we guarantee to fulfil [complete] our mission. 任务重, 时间紧。 the task is hard and we are pressed for time.; 任务观点 get-it-over-and-done-with attitude; perfunctory attitude; routinist point of view
• "财务图像处理程序" 英文翻译 :    finance image processor
• "铁路客运服务图形标志" 英文翻译 :    pictograns used in railway passenger service
• "网络信息服务图书馆员" 英文翻译 :    networked information service librarian
• "任务 任务、工作" 英文翻译 :    task
• "单任务" 英文翻译 :    single task
• "多任务" 英文翻译 :    multitasking; multitask◇多任务操作 [自动化] multi-job [multitask] operation; 多任务程序 multitask program; 多任务功能 multitask function; 多任务监督程序 multitask monitor
• "非任务" 英文翻译 :    non task
• "副任务" 英文翻译 :    sub-mission
• "赶任务" 英文翻译 :    rush one
• "链任务" 英文翻译 :    estt
• "能率，任务" 英文翻译 :    duty
• "前任务" 英文翻译 :    pre-task
• "任务,作业" 英文翻译 :    assignment
• "任务1" 英文翻译 :    task1:aroundthecity
• "任务3" 英文翻译 :    task3:asmallertown
• "任务4" 英文翻译 :    task4:headingnorth

• Proposed a duplication based task scheduling algorithm with communication limits for general task graph , tdmscl
  给出针对普通任务图带通信限制的基于复制调度算法tdmscl 。
• The paper presented task graph clustering algorithm , system graph clustering algorithm and mapping algorithm respectively , as well as their applications
  文中分别给出了任务图的分簇算法，系统图的分簇算法和映射算法及实例。
• It converts the ordinary task graph into fork and join graph , then apply the optimized result of fork and join graph to the scheduling of general task graph . tdmscl converts task scheduling process into the process of optimizing a topological sequence
  该算法把普通任务图转换为join与fork等基本形状,然后运用对join图与fork图的优化调度研究结果对这些基本形状进行任务调度。
• Theoretical proof and simulation suggests that this constructive function has stronger heuristic power , and has better effectiveness for scheduling dag a task - replication based heuristic static scheduling algorithm is also proposed ( namely processor pre - allocation algorithm for dag tasks , ppa ) , utilizing the aforementioned heuristic function aimed at rtrpmt
  通过理论证明与模拟实验表明：本文构造的启发函数具有较强的启发能力，对dag图的调度具有较优的效果。利用本文所构造的启发函数，针对相关周期性多任务，提出了一种基于任务复制的启发式静态调度算法( dag任务图的处理器预分配算法ppa ) 。
• Finally it describes a new network task scheduling algorithm which considers both throughput and latency . the contributions of this paper are as below : proposed a new duplication based task scheduling algorithm for fork - join graph considering the communication limits between different processors , named tdc _ fj . the test results show that tdc _ fj is flexible and effective for fork - join graph and it achieves good performance and reduces the requirements of processors
  本文主要贡献如下:提出了满足通信限制的基于复制的优化fork - join调度算法tdc _ fj , tdc _ fj利用基于复制的fork - join最优化调度结果来对fork - join任务图进行调度,并且在调度过程中加入处理器之间的通信限制,也就是一条通信信道不能同时被两个通信事件占用。