文章提出了一种处理机个数无限的任务分配的列表调度算法，称之为节点迁移调度算法(ntsa)。
This paper brings the list scheduling method into the tasking allocation problem on an unbounded number of processors. The proposed algorithm is called node - transferring scheduling algorithm (NTSA).
无限制的列表和任务的创建(我自己还没有完全测试过，但是我从来没有因为太多的任务和列表而带来问题)
“Unlimited” list and task creation (I haven’t fully tested this, but I have never had an issue with too many tasks or lists)
联合他们的目标，是他们的基本任务——如果世界要避免的灾难无限制的扩散的话。
Connecting their purposes, however, needs to be their ultimate task if the world is to avoid the catastrophe of unchecked proliferation.
进行调用的线程所用的CPU时间会非常少，而完成这个任务所需的时间可以无限长。
The CPU time used by the calling thread will be minimal, while the overall elapsed time to complete the task takes arbitrarily long.
这个时间表意味着，美军将投入近10万兵力的驻阿富汗任务，不会像驻阿最高指挥官麦克里斯特尔将军所要求的那样无限升级。
That timetable suggests the troop commitment, which will take U.S. forces to nearly 100,000, will not be the sort of open-ended increase requested by top U.S. commander Gen. Stanley A. McChrystal.
我们有无限制的能源，许许多多的飞船都能够执行任务。
We have unlimited resources and so many craft that can be applied to the tasks ahead.
这个时间表意味着，美军将投入近10万兵力的驻阿富汗任务，不会像驻阿最高指挥官麦克里斯特尔将军所要求的那样无限升级。
That timetable suggests the troop commitment, which will take U. S. forces to nearly 100,000, will not be the sort of open-ended increase requested by top U. S. commander Gen. Stanley A. McChrystal.
这个时间表意味着，美军将投入近10万兵力的驻阿富汗任务，不会像驻阿最高指挥官麦克里斯特尔将军所要求的那样无限升级。
That timetable suggests the troop commitment, which will take U. S. forces to nearly 100,000, will not be the sort of open-ended increase requested by top U. S. commander Gen. Stanley A. McChrystal.
应用推荐