{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:43Z","timestamp":1757629543310,"version":"3.44.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0743-7315(92)90047-q","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"305-331","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["The weakest memory-access order"],"prefix":"10.1016","volume":"15","author":[{"given":"Philip","family":"Bitar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(92)90047-Q_BIB1","series-title":"Proc. 17th International Symposium on Computer Architecture","first-page":"2","article-title":"Weak ordering \u2014 a new definition","author":"Adve","year":"1990"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB2","series-title":"Proc. 1st Symposium on Parallel Algorithms and Architectures","first-page":"209","article-title":"A lazy cache algorithm","author":"Afek","year":"1989"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB3","series-title":"Presented at architecture workshop 1989","article-title":"A critique of trace-driven simulation for shared-memory multiprocessors","author":"Bitar","year":"1990"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB4","series-title":"Presented at architecture workshop 1990","article-title":"Combining windows: The key to managing MIMD combining trees","author":"Bitar","year":"1992"},{"article-title":"MIMD synchronization and coherence","year":"1990","author":"Bitar","key":"10.1016\/0743-7315(92)90047-Q_BIB5_1"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB6","series-title":"Proc. 13th International Symposium on Computer Architecture","first-page":"424","article-title":"Multiprocessor cache synchronization: Issues, innovations, evolution","author":"Bitar","year":"1986"},{"year":"1992","series-title":"Reasoning About Parallel Architectures","author":"Collier","key":"10.1016\/0743-7315(92)90047-Q_BIB7"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01589410","article-title":"Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem","volume":"42","author":"De Leone","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB9","series-title":"Ada 9X Project Report","article-title":"Shared variables and Ada 9X issues","author":"Dewar","year":"1990"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB10_1","series-title":"Tech. Rep. EWD-123","article-title":"Cooperating sequential processes","author":"Dijkstra","year":"1965"},{"year":"1968","series-title":"Programming Languages","key":"10.1016\/0743-7315(92)90047-Q_BIB10_2"},{"issue":"9","key":"10.1016\/0743-7315(92)90047-Q_BIB11","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","article-title":"Solution of a problem in concurrent programming control","volume":"8","author":"Dijkstra","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB12","series-title":"Presented at architecture workshop 1990","article-title":"Delayed consistency","author":"Dubois","year":"1992"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB13_1","series-title":"Proc. 13th International Symposium on Computer Architecture","first-page":"434","article-title":"Memory access buffering in multiprocessors","author":"Dubois","year":"1986"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB13_2","first-page":"660","article-title":"Memory access dependencies in shared-memory multiprocessors","volume":"16","author":"Dubois","year":"1990"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB14","series-title":"Proc. 17th International Symposium on Computer Architecture","first-page":"15","article-title":"Memory consistency and event ordering in scalable shared-memory multiprocessors","author":"Gharachorloo","year":"1990"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB15_1","series-title":"Tech. Rep. 61","article-title":"Cache consistency and sequential consistency","author":"Goodman","year":"1989"},{"year":"1991","key":"10.1016\/0743-7315(92)90047-Q_BIB15_2"},{"issue":"3","key":"10.1016\/0743-7315(92)90047-Q_BIB16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","article-title":"Linearizability: A correctness condition for concurrent objects","volume":"12","author":"Herlihy","year":"1990","journal-title":"ACM Trans. Prog. Lang. Sys."},{"key":"10.1016\/0743-7315(92)90047-Q_BIB17","series-title":"Presented at architecture workshop 1990","article-title":"An example of correct global trace generation","author":"Holliday","year":"1992"},{"key":"10.1016\/0743-7315(92)90047-Q_BIB18","series-title":"The Structure of Computers and Computations, I","first-page":"135","article-title":"Program dependence and transformation: Sec. 2.4","author":"Kuck","year":"1978"},{"issue":"7","key":"10.1016\/0743-7315(92)90047-Q_BIB19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"issue":"9","key":"10.1016\/0743-7315(92)90047-Q_BIB20","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"C-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0743-7315(92)90047-Q_BIB21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","article-title":"The mutual exclusion problem","volume":"33","author":"Lamport","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(92)90047-Q_BIB22","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication","volume":"1","author":"Lamport","year":"1986","journal-title":"Dist. Comput."},{"key":"10.1016\/0743-7315(92)90047-Q_BIB23","series-title":"Proc. 18th International Symposium on Computer Architecture","first-page":"106","article-title":"Race-free interconnection networks and multiprocessor consistency","author":"Landin","year":"1991"},{"issue":"1","key":"10.1016\/0743-7315(92)90047-Q_BIB24","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/5001.5007","article-title":"Axioms for memory access in asynchronous hardware systems","volume":"8","author":"Misra","year":"1986","journal-title":"ACM Trans. Prog. Lang. & Sys."},{"issue":"3","key":"10.1016\/0743-7315(92)90047-Q_BIB25_1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","article-title":"Myths about the mutual exclusion problem","volume":"12","author":"Peterson","year":"1981","journal-title":"In-form. Process. Lett."},{"key":"10.1016\/0743-7315(92)90047-Q_BIB25_2","first-page":"332","article-title":"Operating System Concepts","author":"Peterson","year":"1985"},{"issue":"2","key":"10.1016\/0743-7315(92)90047-Q_BIB26","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/42190.42277","article-title":"Efficient and correct execution of parallel programs that share memory","volume":"10","author":"Shasha","year":"1988","journal-title":"ACM Trans. Prog. Lang. & Sys."},{"key":"10.1016\/0743-7315(92)90047-Q_BIB27","series-title":"Presented at architecture workshop 1990","article-title":"Formal specification of memory models","author":"Sindhu","year":"1992"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290047Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290047Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:08Z","timestamp":1757514548000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290047Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["074373159290047Q"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90047-q","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The weakest memory-access order","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90047-Q","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}