Ordering Constraints is a formal set of rules within memory consistency models that specifies the permissible sequences of memory operations as observed by threads in a concurrent system, thereby distinguishing how memory events are ordered relative to one another across different processors or cores.
98
Publications
4.6K
Citations
218
Authors
136
Institutions
Publications per year
2017–2026
14
Parents
Publications
98
The Application of Phonological Rules
Andreas Koutsoudas, Gerald A. Sanders, Craig Arthur Noll · Language · 1974 · 164 citations
Weak ordering-a new definition
Sarita V. Adve · 2002 · 126 citations
1–5 of 98
Authors
218
- IM
2
h-index
- RN
2
h-index
- MC
2
h-index
- JS
2
h-index
- XL
2
h-index
1–5 of 218
Institutions
136
University of Washington
Seattle, United States
3 h-index
5 publications
1.5K citations
Stanford University
Stanford, United States
3 h-index
5 publications
427 citations
University of Wisconsin–Madison
Madison, United States
3 h-index
6 publications
450 citations
University College Cork
Cork, Ireland
2 h-index
3 publications
81 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
3 publications
246 citations
University of Southern California
Los Angeles, United States
2 h-index
4 publications
812 citations
University of California San Diego
San Diego, United States
2 h-index
3 publications
322 citations
Western University
London, Canada
2 h-index
5 publications
176 citations
1–8 of 136
Venues
- European Journal of Operational Research
3 publications · 125 citations
3
h-index
- English Language and Linguistics
2 publications · 133 citations
2
h-index
- Theoretical Computer Science
2 publications · 125 citations
2
h-index
- Journal of Parallel and Distributed Computing
2 publications · 105 citations
2
h-index
- Computers & Chemical Engineering
1 publications · 41 citations
1
h-index
1–5