A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of
The central hypothesis of this work is that programmers prefer to reason about sequentially consistent memory, rather than having to think about weaker memory, or even write buffers. Following this hypothesis, we re-define weak ordering as a contract between software and hardware. By this contract, software agrees to some formally specified constraints, and hardware agrees to appear sequentially consistent to at least the software that obeys those constraints. We illustrate the power of the new definition with a set of software constraints that forbid data races and an implementation for cache-coherent systems that is not allowed by the old definition.
程序员通常且经常隐式假定的用于共享内存,多处理器的内存模型是 这项工作的中心假设是程序员更喜欢推理顺序一致的内存,而不是不得不考虑较弱的内存甚至是写缓冲区。根据这个假设,我们将弱排序重新定义为软件和硬件之间的契约。根据此合同,软件同意某些正式规定的约束,而硬件同意至少与遵守这些约束的软件相继出现。我们通过一组禁止数据争用的软件约束以及旧定义所不允许的高速缓存一致性系统的实现,来说明新定义的强大功能。 P>
机译:弱理理论的证明理论优势
机译:关于二元Muckenhoupt和反向Holder类的等效定义,涉及Carleson序列,弱类以及二元L log L和A(无限)常数的可比性
机译:确定性和算术准归纳定义的弱系统
机译:回顾性:弱排序---新定义
机译:标准定义与修订定义:中国成人英语学习者在理解单词含义方面的有效性。
机译:成本效益分析包括方程式两边的弱定义(Lowell Levin)
机译:弱理理论的证明理论优势,阳性归纳定义