AI 中文总结
本文将无锁和无等待计算的定义扩展到群组计算，通过遵循特定约束确保扩展定义与原始定义逻辑一致，并能在新域中特征化程序，还用示例进行说明。
AI 中文摘要
定义的域扩展是指拓宽定义范围，使其适用于比最初指定的更大的案例集。无锁和无等待计算的概念是为单个线程完成的任务域而设计的。本文的目标是将无锁和无等待的定义扩展到群组计算（表示为组无锁和组无等待），这需要多个线程协作来完成手头的任务。在扩展定义时，必须遵循某些约束：新域必须在逻辑上与原始含义一致，扩展不应引入矛盾或歧义，并且必须保留使定义有效和有用的基本属性。我们通过表明当群组由单个线程组成时，我们的扩展定义与原始定义一致来证明这一点。我们注意到扩展使我们能够在新域（分布式计算；NUMA计算系统；不同线程具有私有数据的系统等）中对程序进行特征化，而不是不顾程序的实际属性将它们归为同一类别（无死锁/无活锁）。我们还用各种示例说明了这个定义。
英文摘要
A domain extension of a definition refers to broadening the scope of a definition so that it applies to a larger set of cases than originally specified. The notion of lock-free and wait-free computation is designed for the domain of tasks that are completed by a single thread (in competition with other threads). The goal of this paper is to extend the definition of lock-freedom and wait-freedom to group-computations (denoted by gl-freedom and gw-freedom) that require that the task at hand must be completed by a collaboration between multiple threads. When extending a definition, certain constraints must be respected: the new domain must remain logically consistent with the original meaning, the extension should not introduce contradictions or ambiguities, and it must preserve the essential properties that make the definition valid and useful. We demonstrate this by showing that our extended definition is consistent with the original definition when the group consists of a single thread. We note that extension allows us to characterize programs in a new domain (distributed computing, NUMA computation systems, systems with private data for different threads, etc.) instead of relegating them to be in the same category (deadlock/livelock-free) without regard to the actual properties of that program. We also illustrate this definition with various examples.
