抽象图机
Abstract Graph Machine
摘要：
抽象图机（AGM）是分布式存储并行稳定图算法的抽象模型。稳定化算法从一个特定的初始状态开始，经过一系列不同的状态变化，直到收敛。AGM将工作依赖性添加到稳定算法。工作是在处理函数中处理的。系统中的所有进程执行相同的处理功能。在将工作馈送到处理函数之前，使用严格弱排序关系对工作进行排序。严格弱序关系将工作划分为等价类，因此单个等价类中的工作可以并行处理，但不同等价类中的工作必须按照它们在等价类中出现的顺序执行。本文给出了几种分布式存储并行图算法的AGM模型、语义和AGM模型。
英文摘要：
An Abstract Graph Machine(AGM) is an abstract model for distributed memory parallel stabilizing graph algorithms. A stabilizing algorithm starts from a particular initial state and goes through series of different state changes until it converges. The AGM adds work dependency to the stabilizing algorithm. The work is processed within the processing function. All processes in the system execute the same processing function. Before feeding work into the processing function, work is ordered using a strict weak ordering relation. The strict weak ordering relation divides work into equivalence classes, hence work within a single equivalence class can be processed in parallel, but work in different equivalence classes must be executed in the order they appear in equivalence classes. The paper presents the AGM model, semantics and AGM models for several existing distributed memory parallel graph algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
