An Operational Model for Multiprocessors with Caches - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

An Operational Model for Multiprocessors with Caches


Modern multiprocessors are equipped with local caches, to enhance program performance. However, the presence of caches can lead to the violation of sequential consistency [7] assumptions regarding program order and write atomicity. With respect to such relaxed memory models [1], we provide an operational description of program execution (in the style of [4]) that accounts for cache effects. In particular, we provide an operational characterization of cache invalidation and update policies and an abstract characterization of cache consistency. The programming model consists of a simple imperative language extended with common synchronization primitives such as locks or barrier instructions. The main results show that by precluding certain data races or by placing certain synchronization constraints, sequentially consistent behavior can be obtained for multiprocessor execution even in the presence of local caches.
Fichier principal
Vignette du fichier
03230370.pdf (222.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01054446 , version 1 (06-08-2014)





Salil Joshi, Sanjiva Prasad. An Operational Model for Multiprocessors with Caches. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.371-385, ⟨10.1007/978-3-642-15240-5_27⟩. ⟨hal-01054446⟩
92 View
99 Download



Gmail Facebook Twitter LinkedIn More