即使你知道最好最快的算法，解决了数据并行问题，但是它并不总是能够把这种以高效率的计划。

Even if you know the best and fastest algorithm for solving a data parallel problem, it isn't always possible to translate that to an efficient program.

youdao

通过上机实验对这些算法的性能进行分析，得出结论在这些单模式匹配算法中TUNED BM算法是最快的算法。

At the same time, the paper analyses the algorithms' performance through making experiment and reaches a conclusion that TUNEDBM algorithm is the quick among these algorithms.

youdao

这些模式匹配算法可以寻找并标识在内存转储之间增长最快的聚合数据结构(按照类似的所属权结构组合在一起)。

These pattern matching algorithms seek to identify aggregated data structures (grouped together by similarity of ownership structure) that are growing the most in between the memory dumps.

youdao

> So now that might not have felt like the fastest algorithm but think about what you could have done with that algorithm in each iteration, much like the phonebook up front here, you literally split that problem in two because on each iteration roughly half of you were sitting down and then another half and then another half.

虽然这并不是最快的算法,但如果把这种算法每次迭代,就像刚才查电话簿一样，你便将这个问题一分为二了,因为每一次迭代后只有一半坐下来,以此类推。

哈佛公开课 - 计算机科学课程节选