天才排序算法:睡眠排序(二)

2014-11-24 11:20:09 · 作者: · 浏览: 9
ng algorithms can only utilize one core, sleep sort has the capacity to use the full power of a massively parallel execution environment.
Given that you need nearly no computing in each of the threads, you can implement them using low-power CPUs, so this is in fact a GREEN COMPUTING algorithm.
Oh, and did I mention that the algorithm can also run inside a cloud...
Sure, you're a genius!
我由衷的不同意那些低估sleepsort这个天才算法的举动,许多人可能忽略了一个重点那就是传统的排序只能利用一个核心,而sleepsort有这个能力充分利用可以做大量并行计算的环境。
在每个线程中给出你几乎不需要计算的部分,你可以用低性能CPU搞定它们,所以事实上,这是一个“绿色计算”算法。
还有我提到的这个方法能在云端运行不?
总之,你是个天才!
路人H:
pretty fucking cool
太TMD的cool了!