论文标题
图像问题的低功率网格算法
Low Power Mesh Algorithms for Image Problems
论文作者
论文摘要
我们分析了一个有力动机的精细网状连接计算机模型，假设信息词需要一个固定的区域，并且单位时间和单位能量才能移动单个单位距离。这是用无数微小处理器排列为网格的芯片上计算的表示。虽然大多数网格算法都认为所有处理器始终处于活动状态，但我们提供的算法在任何时候都只有几个处理器，从而降低了所需的功率。我们将这种方法应用于涉及图像的基本问题，表明峰值功率只有很小的时间（如果有的话）可能会大幅减少所需的时间。我们还表明，这些算法在有更多功率时提供了一种更有效的方法来利用电源。
We analyze a physically motivated fine-grained mesh-connected computer model, assuming that a word of information takes a fixed area and that it takes unit time and unit energy to move a word unit distance. This is a representation of computing on a chip with myriad tiny processors arranged as a mesh. While most mesh algorithms assume all processors are active at all times, we give algorithms that have only a few processors on at any one time, which reduces the power required. We apply this approach to basic problems involving images, showing that there can be dramatic reductions in the peak power with only small, if any, changes in the time required. We also show that these algorithms give a more efficient way to utilize power when more power is available.
