Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/15405
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dongol, B | - |
dc.contributor.author | JAGADEESAN, R | - |
dc.contributor.author | RIELY, J | - |
dc.coverage.spatial | Los Angeles, California, USA | - |
dc.date.accessioned | 2017-11-09T12:25:04Z | - |
dc.date.available | 2017-11-09T12:25:04Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | POPL Conference, (2017) | en_US |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/15405 | - |
dc.description.abstract | The integration of transactions into hardware relaxed memory architectures is a topic of current research both in industry and academia. In this paper, we provide a general architectural framework for the introduction of transactions into models of relaxed memory in hardware, including the sc, tso, armv8 and ppc models. Our framework incorporates flexible and expressive forms of transaction aborts and execution that have hitherto been in the realm of software transactional memory. In contrast to software transactional memory, we account for the characteristics of relaxed memory as a restricted form of distributed system, without a notion of global time. We prove abstraction theorems to demonstrate that the programmer API matches the intuitions and expectations about transactions. | en_US |
dc.language.iso | en | en_US |
dc.source | POPL | - |
dc.source | POPL | - |
dc.subject | Relaxed Memory Models | en_US |
dc.subject | Hardware Transactional Memory | en_US |
dc.title | Transactions in Relaxed Memory Architectures | en_US |
dc.type | Conference Paper | en_US |
pubs.publication-status | Accepted | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 709.38 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.