Making the fast case common and the uncommon case simple in unbounded transactional memory

Colin Blundell, Joe Devietti, E. Christopher Lewis, Milo M. K. Martin. Making the fast case common and the uncommon case simple in unbounded transactional memory. In Dean M. Tullsen, Brad Calder, editors, 34th International Symposium on Computer Architecture (ISCA 2007), June 9-13, 2007, San Diego, California, USA. pages 24-34, ACM, 2007. [doi]

@inproceedings{BlundellDLM07,
  title = {Making the fast case common and the uncommon case simple in unbounded transactional memory},
  author = {Colin Blundell and Joe Devietti and E. Christopher Lewis and Milo M. K. Martin},
  year = {2007},
  doi = {10.1145/1250662.1250667},
  url = {http://doi.acm.org/10.1145/1250662.1250667},
  researchr = {https://researchr.org/publication/BlundellDLM07},
  cites = {0},
  citedby = {0},
  pages = {24-34},
  booktitle = {34th International Symposium on Computer Architecture (ISCA 2007), June 9-13, 2007, San Diego, California, USA},
  editor = {Dean M. Tullsen and Brad Calder},
  publisher = {ACM},
  isbn = {978-1-59593-706-3},
}