节能算法
Energy-Efficient Algorithms
摘要:
基于物理学中的Landauer原理,我们对算法的能量复杂度(除了时间和空间复杂度之外)进行了系统的研究。Landauer原理给出了一个系统在破坏信息时必须消耗的能量的下限。我们提出了三种标准计算模型的能量感知变体:电路RAM,字RAM和transdichotomous RAM。在这些模型之上,我们建立了熟悉的高级原语,如控制逻辑,内存分配,和垃圾回收与零能量复杂度和空间和时间复杂度只有常数因子开销,使简单的表达节能算法。我们分析了几个经典的算法在我们的模型和开发低能耗的变化:比较排序,插入排序,计数排序,广度优先搜索,贝尔曼-福特,Floor-Warshall,矩阵所有对最短路径,AVL树,二叉堆,和动态数组。我们探讨了时间/空间/能源的权衡,并开发了几种通用的技术分析算法,降低其能源的复杂性。这些结果为半可逆计算的新领域奠定了理论基础,并为算法的研究提供了新的框架。
英文摘要:
We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it destroys information. We propose energy-aware variations of three standard models of computation: circuit RAM, word RAM, and transdichotomous RAM. On top of these models, we build familiar high-level primitives such as control logic, memory allocation, and garbage collection with zero energy complexity and only constant-factor overheads in space and time complexity, enabling simple expression of energy-efficient algorithms. We analyze several classic algorithms in our models and develop low-energy variations: comparison sort, insertion sort, counting sort, breadth-first search, Bellman-Ford, Floyd-Warshall, matrix all-pairs shortest paths, AVL trees, binary heaps, and dynamic arrays. We explore the time/space/energy trade-off and develop several general techniques for analyzing algorithms and reducing their energy complexity. These results lay a theoretical foundation for a new field of semi-reversible computing and provide a new framework for the investigation of algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。