Distributed Algorithms: A Case Study of the Java Memory Model
Uložené v:
| Názov: | Distributed Algorithms: A Case Study of the Java Memory Model |
|---|---|
| Autori: | Glavan, Paola, Botinčan, Matko |
| Informácie o vydavateľovi: | 2007. |
| Rok vydania: | 2007 |
| Predmety: | Abstract state machines, Distributed algorithms, Java memory model |
| Popis: | 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. |
| Druh dokumentu: | Conference object |
| Prístupová URL adresa: | http://ikt.hia.no/asm07/ |
| Prístupové číslo: | edsair.dris...01492..d9d5fe0f6254f6686a43842cb2e683ef |
| Databáza: | OpenAIRE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://explore.openaire.eu/search/publication?articleId=dris___01492%3A%3Ad9d5fe0f6254f6686a43842cb2e683ef Name: EDS - OpenAIRE (s4221598) Category: fullText Text: View record at OpenAIRE – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Glavan%20P Name: ISI Category: fullText Text: Nájsť tento článok vo Web of Science Icon: https://imagesrvr.epnet.com/ls/20docs.gif MouseOverText: Nájsť tento článok vo Web of Science |
|---|---|
| Header | DbId: edsair DbLabel: OpenAIRE An: edsair.dris...01492..d9d5fe0f6254f6686a43842cb2e683ef RelevancyScore: 775 AccessLevel: 3 PubType: Conference PubTypeId: conference PreciseRelevancyScore: 774.7470703125 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Distributed Algorithms: A Case Study of the Java Memory Model – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Glavan%2C+Paola%22">Glavan, Paola</searchLink><br /><searchLink fieldCode="AR" term="%22Botinčan%2C+Matko%22">Botinčan, Matko</searchLink> – Name: Publisher Label: Publisher Information Group: PubInfo Data: 2007. – Name: DatePubCY Label: Publication Year Group: Date Data: 2007 – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Abstract+state+machines%22">Abstract state machines</searchLink><br /><searchLink fieldCode="DE" term="%22Distributed+algorithms%22">Distributed algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Java+memory+model%22">Java memory model</searchLink> – Name: Abstract Label: Description Group: Ab Data: 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. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Conference object – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="http://ikt.hia.no/asm07/" linkWindow="_blank">http://ikt.hia.no/asm07/</link> – Name: AN Label: Accession Number Group: ID Data: edsair.dris...01492..d9d5fe0f6254f6686a43842cb2e683ef |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.dris...01492..d9d5fe0f6254f6686a43842cb2e683ef |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: Undetermined Subjects: – SubjectFull: Abstract state machines Type: general – SubjectFull: Distributed algorithms Type: general – SubjectFull: Java memory model Type: general Titles: – TitleFull: Distributed Algorithms: A Case Study of the Java Memory Model Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Glavan, Paola – PersonEntity: Name: NameFull: Botinčan, Matko IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2007 Identifiers: – Type: issn-locals Value: edsair |
| ResultId | 1 |
Nájsť tento článok vo Web of Science