Towards a Study of Synchronization: Abstractions, Implementations, and Translations

尽管存在各种各样的同步问题及其广泛的解决方案，但是关于同步的性质和分类的一些基本问题仍然没有得到解答。由于观察到任何同步都必然涉及参与进程之间的某种仲裁。作为仲裁基础的程序的“等级”的概念已经形成，并且已经确定了一个称为“等级”的基本机制，用于计算程序的等级。为了进行任何一种仲裁，排名模块计算出的排名应该满足一定的要求。通过识别这些属性，获得了rank模块的四种不同规格；这四个等级形成一个等级。基于同步问题与可用于解决同步问题的最弱排序之间的对应关系，得到了同步问题的分类。这种分类包含了文献中提出的其他分类。将考虑在各种体系结构上实现排名的问题，该项目打算设计跨不同体系结构翻译程序的算法。

In spite of the wide variety of synchronization problems and their broad-ranging solutions, some fundamental questions regarding the nature and classification of synchronization have remained unanswered. Led by the observation that any synchronization necessarily involves some kind of arbitration among the participating processes. The notion of the "rank" of a process that serves as the basis for arbitration has been formulated, and an underlying mechanism, called the "ranker", that computes the ranks for the processes has been identified. In order to carry out any kind of arbitration, the ranks that are computed by the ranker module should satisfy certain requirements. By identifying these properties, four different specifications are obtained for the ranker module; these four rankers form a hierarchy. Based on the correspondence between a synchronization problem and the weakest ranker that can be used to solve it, a classificiation of synchronization problems is obtained. This classification subsumes the other classification proposed in the literature. The problem of implementing rankers on various architectures will be considered and the project intends to devise algorithms for translating programs across different architectures.