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 Thomas Mullins

> Home > Persons > Onur Mutlu

Publications

2017
[c149]
- view
  authority control:
- export record
  dblp key:
  - conf/micro/SeshadriLMHBKKM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/micro/SeshadriLMHBKKM17
Vivek Seshadri, Donghyuk Lee, Thomas Mullins, Hasan Hassan, Amirali Boroumand, Jeremie S. Kim, Michael A. Kozuch, Onur Mutlu, Phillip B. Gibbons, Todd C. Mowry:
Ambit: in-memory accelerator for bulk bitwise operations using commodity DRAM technology. MICRO 2017: 273-287
2016
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/SeshadriLMHBKKM16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/SeshadriLMHBKKM16
Vivek Seshadri, Donghyuk Lee, Thomas Mullins, Hasan Hassan, Amirali Boroumand, Jeremie S. Kim, Michael A. Kozuch, Onur Mutlu, Phillip B. Gibbons, Todd C. Mowry:
Buddy-RAM: Improving the Performance and Efficiency of Bulk Bitwise Operations Using DRAM. CoRR abs/1611.09988 (2016)
2015
[c110]
- view
  authority control:
- export record
  dblp key:
  - conf/micro/SeshadriMBMGKM15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/micro/SeshadriMBMGKM15
Vivek Seshadri, Thomas Mullins, Amirali Boroumand, Onur Mutlu, Phillip B. Gibbons, Michael A. Kozuch, Todd C. Mowry:
Gather-scatter DRAM: in-DRAM address translation to improve the spatial locality of non-unit strided accesses. MICRO 2015: 267-280

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.