论文标题
从沙面到面粉：纳米园粒状计算中的下一个飞跃
From Sand to Flour: The Next Leap in Granular Computing with NanoSort
论文作者
论文摘要
分布式计算的粒度受到通信时间的限制：如果由于增加的并行性而占主导地位的处理时间减少，那么耕种越来越小的任务是没有意义的。在这项工作中，我们利用了新的NIC/CPU硬件设计Nanopu的低通信潜伏期来探索分布式计算中粒度的新极端，在该计算中，问题将问题分为数万纳米尺度任务。 为了评估极端细粒度计算的可行性和实用性，我们构建了Nanosort，这是一种在Nanopu上运行的分布式排序算法。使用65,536个纳米核的循环精确的燃料模拟，我们表明纳米园可以在68 $μ$ s中对1M键进行排序，该键比当前的最新时间更快的数量级。
The granularity of distributed computing is limited by communication time: there is no point in farming out smaller and smaller tasks if the communication overhead dominates the decrease in processing time due to the added parallelism. In this work, we leverage the low communication latency of a new NIC/CPU hardware design, the nanoPU, to explore a new extreme of granularity in distributed computation, where a problem is partitioned into tens of thousands of nanosecond-scale tasks. To evaluate the feasibility and practicality of extremely fine-grained computing, we built NanoSort, a distributed sorting algorithm running on the nanoPU. Using cycle-accurate FireSim simulations of 65,536 nanoPU cores, we show that NanoSort can sort 1M keys in 68$μ$s, an order of magnitude faster than MilliSort, the current state-of-the-art.
