Ronald G. Dreslinski

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 Jason B. Akers

> Home > Persons > Ronald G. Dreslinski

Publications

2023
[i11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2305-01515
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2305-01515
Hiwot Tadese Kassa, Paul Johnson, Jason Akers, Mrinmoy Ghosh, Andrew Tulloch, Dheevatsa Mudigere, Jongsoo Park, Xing Liu, Ronald G. Dreslinski, Ehsan K. Ardestani:
MTrainS: Improving DLRM training efficiency using heterogeneous memories. CoRR abs/2305.01515 (2023)
2022
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/tos/KassaAGCGD22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tos/KassaAGCGD22
Hiwot Tadese Kassa, Jason Akers, Mrinmoy Ghosh, Zhichao Cao, Vaibhav Gogte, Ronald G. Dreslinski:
Power-optimized Deployment of Key-value Stores Using Storage Class Memory. ACM Trans. Storage 18(2): 13:1-13:26 (2022)
2021
[c77]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/usenix/KassaAGCGD21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/usenix/KassaAGCGD21
Hiwot Tadese Kassa, Jason Akers, Mrinmoy Ghosh, Zhichao Cao, Vaibhav Gogte, Ronald G. Dreslinski:
Improving Performance of Flash Based Key-Value Stores Using Storage Class Memory as a Volatile Memory Extension. USENIX ATC 2021: 821-837

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.