Onur Mutlu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Brandon Lucia

> Home > Persons > Onur Mutlu

Publications

2019
[c189]
- view
  authority control:
- export record
  dblp key:
  - conf/isca/BoroumandGPHLAH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isca/BoroumandGPHLAH19
Amirali Boroumand, Saugata Ghose, Minesh Patel, Hasan Hassan, Brandon Lucia, Rachata Ausavarungnirun, Kevin Hsieh, Nastaran Hajinazar, Krishna T. Malladi, Hongzhong Zheng, Onur Mutlu:
CoNDA: efficient cache coherence support for near-data accelerators. ISCA 2019: 629-642
2017
[j52]
- view
  authority control:
- export record
  dblp key:
  - journals/cal/BoroumandGPHLHM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cal/BoroumandGPHLHM17
Amirali Boroumand, Saugata Ghose, Minesh Patel, Hasan Hassan, Brandon Lucia, Kevin Hsieh, Krishna T. Malladi, Hongzhong Zheng, Onur Mutlu:
LazyPIM: An Efficient Cache Coherence Mechanism for Processing-in-Memory. IEEE Comput. Archit. Lett. 16(1): 46-50 (2017)
[i24]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/BoroumandGPHLHH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BoroumandGPHLHH17
Amirali Boroumand, Saugata Ghose, Minesh Patel, Hasan Hassan, Brandon Lucia, Nastaran Hajinazar, Kevin Hsieh, Krishna T. Malladi, Hongzhong Zheng, Onur Mutlu:
LazyPIM: Efficient Support for Cache Coherence in Processing-in-Memory Architectures. CoRR abs/1706.03162 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.