Distributed Algorithms: A Case Study of the Java Memory Model (CROSBI ID 533152)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Botinčan, Matko ; Glavan, Paola ; Runje, Davor
engleski
Distributed Algorithms: A Case Study of the Java Memory Model
The goal of this paper is to give a mathematically precise specification of the Java memory model and discuss its interpretation in the ASM context. We have refactored the original specification in order to clearly stipulate how it conditions the behavior of the environment. We show how each thread in a multithreaded Java program can be seen as an ordinary interactive small-step algorithm, and, consequently, how the Java program gives rise to a distributed ordinary interactive small-step ASM. Due to rather relaxed conditions on the environment imposed by the Java memory model, runs of such ASM may, however, exhibit behavior that is impossible to be observed in sequentially consistent settings. We hope that notions of run and environment capturing this kind of behavior will serve as a helpful insight for the theory of distributed algorithms developed so far.
Java memory model; Distributed algorithms; Abstract state machines
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
2007.
objavljeno
Podaci o matičnoj publikaciji
Andreas Prinz
Grimstad: Agder University College, Faculty of Engineering and Science, ICT Department
978-82-7117-627-3
Podaci o skupu
The 14th International ASM Workshop
predavanje
07.06.2007-09.06.2007
Grimstad, Norveška