时间状态机:使用时间记忆缝合基于时间的图形计算
Temporal State Machines: Using temporal memory to stitch time-based graph computations
摘要:
竞赛逻辑,一个到达时间编码逻辑家族,已经证明了从动态规划到机器学习的应用的能量和性能改进。然而,算法到硬件的自组织映射导致自定义架构,使其难以推广。我们将种族逻辑的发展与称为热带代数的数学领域联系起来。热带代数和广义种族逻辑计算的数学原语之间的这种关联指导了时间编码热带电路的设计。它也作为一个框架,表达高层次的基于时间的算法。这种抽象,当与时间记忆相结合时,允许通过将前馈计算划分为阶段并将其组织成状态机来系统地概括竞赛逻辑。我们利用模拟忆阻器为基础的时间存储器设计这样一个状态机,纯粹的时间编码波前上运行。我们实现了一个版本的Dijkstra的算法来评估这个时间状态机。这个演示展示了扩展时态计算的可表达性的前景,使其能够提供显着的能源和吞吐量优势。
英文摘要:
Race logic, an arrival-time-coded logic family, has demonstrated energy and performance improvements for applications ranging from dynamic programming to machine learning. However, the ad hoc mappings of algorithms into hardware result in custom architectures making them difficult to generalize. We systematize the development of race logic by associating it with the mathematical field called tropical algebra. This association between the mathematical primitives of tropical algebra and generalized race logic computations guides the design of temporally coded tropical circuits. It also serves as a framework for expressing high level timing-based algorithms. This abstraction, when combined with temporal memory, allows for the systematic generalization of race logic by making it possible to partition feed-forward computations into stages and organizing them into a state machine. We leverage analog memristor-based temporal memories to design a such a state machine that operates purely on time-coded wavefronts. We implement a version of Dijkstra's algorithm to evaluate this temporal state machine. This demonstration shows the promise of expanding the expressibility of temporal computing to enable it to deliver significant energy and throughput advantages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。