uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Non-Speculative Load Reordering in Total Store Ordering
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Natl Univ Singapore, Dept Comp Sci, Singapore, Singapore.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Univ Murcia, Comp Engn Dept, Murcia, Spain.
2018 (English)In: IEEE Micro, ISSN 0272-1732, E-ISSN 1937-4143, Vol. 38, no 3, p. 48-57Article in journal (Refereed) Published
Abstract [en]

Load reordering is important for performance. It allows a core to continue performing accesses to the memory system even when there are older, in-program-order, unperformed accesses (for example, due to long latency misses). The only known solution to allow such reordering in a strong consistency model such as total store ordering (TSO) has been to reorder speculatively and squash-and-re-execute if caught. We show, for the first time, that we can do the load reordering non-speculatively and leave it to the coherence protocol to handle conflicts. We can do this efficiently (without perceptible hardware or performance cost) and without deadlocks or livelocks. The important new result is that we can now irrevocably bind speculative loads. Our solution allows us to commit reordered loads out of order without having to wait (for the loads to become non-speculative) or checkpoint committed state (and rollback if needed), just to ensure correctness in the rare case of another core seeing the reordering.

Place, publisher, year, edition, pages
IEEE COMPUTER SOC , 2018. Vol. 38, no 3, p. 48-57
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-356322DOI: 10.1109/MM.2018.032271061ISI: 000432316500007OAI: oai:DiVA.org:uu-356322DiVA, id: diva2:1235444
Funder
Swedish Research Council, 621-2012-5332Available from: 2018-07-25 Created: 2018-07-25 Last updated: 2018-07-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Kaxiras, StefanosAlipour, Mehdi

Search in DiVA

By author/editor
Kaxiras, StefanosAlipour, Mehdi
By organisation
Computer Systems
In the same journal
IEEE Micro
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 85 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf