Transistency Models: Memory Ordering at the Hardware-OS Interface

Modern computer systems include numerous compute elements, from CPUs to GPUs to accelerators. Harnessing their full potential requires well-defined, properly-implemented memory consistency models and virtual memory subsystems. Unfortunately, it is difficult to specify and implement hardware-OS inter...

Full description

Saved in:
Bibliographic Details
Published in:IEEE MICRO p. 1
Main Authors: Lustig, Daniel, Sethi, Geet, Bhattacharjee, Abhishek, Martonosi, Margaret
Format: Journal Article
Language:English
Published: IEEE 14.06.2017
Subjects:
Analytical models
B Hardware
B.3 Memory Structures
B.3.2 Design Styles
B.3.2.g Shared memory
C Computer Systems Organization
C.0 General
C.0.d Modeling of computer architecture
Computational modeling
D Software/Software Engineering
D.2 Software Engineering
D.2.5 Testing and Debugging
D.2.5.r Testing tools
D.4 Operating Systems
D.4.2 Storage Management
D.4.2.i Virtual memory
D.4.5 Reliability
D.4.5.f Verification
Hardware
Microarchitecture
Object recognition
Operating systems
ISSN:0272-1732
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Modern computer systems include numerous compute elements, from CPUs to GPUs to accelerators. Harnessing their full potential requires well-defined, properly-implemented memory consistency models and virtual memory subsystems. Unfortunately, it is difficult to specify and implement hardware-OS interactions correctly; in the past, many hardware and OS specification mismatches have resulted in implementation bugs in commercial processors.To resolve this verification gap, this paper makes the following contributions. First, we present COATCheck, an address translation-aware framework for specifying and statically verifying memory ordering enforcement at the microarchitecture and operating system levels. We develop a domain-specific language for specifying ordering enforcement, for including ordering-related OS events and hardware micro-operations, and for programmatically enumerating happens-before graphs. Using a fast and automated static constraint solver, COATCheck can efficiently analyze interesting and important memory ordering scenarios for modern, high-performance, out-of-order processors. Second, we show that previous work on Virtual Address Memory Consistency (VAMC) does not capture every translation-related ordering scenario of interest, and that some such cases even fall outside the traditional scope of consistency. We therefore introduce the term "transistency model" to describe the superset of consistency which captures all translation-aware sets of ordering rules.
ISSN:0272-1732
DOI:10.1109/MM.2017.265090228