default search action
Clem Dickey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c10]Daniel G. Waddington, Moshik Hershcovitch, Swaminathan Sundararaman, Clem Dickey:
A case for using cache line deltas for high frequency VM snapshotting. SoCC 2022: 526-539 - 2021
- [c9]Daniel G. Waddington, Moshik Hershcovitch, Clem Dickey:
PyMM: Heterogeneous Memory Programming for Python Data Science. PLOS@SOSP 2021: 31-37 - [i2]Daniel G. Waddington, Clem Dickey, Moshik Hershcovitch, Sangeetha Seshadri:
An Architecture for Memory Centric Active Storage (MCAS). CoRR abs/2103.00007 (2021) - [i1]Daniel G. Waddington, Clem Dickey, Luna Xu, Moshik Hershcovitch, Sangeetha Seshadri:
A High-Performance Persistent Memory Key-Value Store with Near-Memory Compute. CoRR abs/2104.06225 (2021) - 2020
- [c8]Daniel G. Waddington, Clem Dickey, Luna Xu, Travis Janssen, Jantz Tran, Kshitij A. Doshi:
Evaluating Intel 3D-Xpoint NVDIMM Persistent Memory in the Context of a Key-Value Store. ISPASS 2020: 202-211
2010 – 2019
- 2019
- [c7]Daniel G. Waddington, Mark Kunitomi, Clem Dickey, Samyukta Rao, Amir Abboud, Jantz Tran:
Evaluation of intel 3D-xpoint NVDIMM technology for memory-intensive genomic workloads. MEMSYS 2019: 277-287 - 2014
- [j2]Hyojun Kim, Sangeetha Seshadri, Clement L. Dickey, Lawrence Chiu:
Phase change memory in enterprise storage systems: silver bullet or snake oil? ACM SIGOPS Oper. Syst. Rev. 48(1): 82-89 (2014) - [j1]Hyojun Kim, Sangeetha Seshadri, Clement L. Dickey, Lawrence Chiu:
Evaluating Phase Change Memory for Enterprise Storage Systems: A Study of Caching and Tiering Approaches. ACM Trans. Storage 10(4): 15:1-15:21 (2014) - [c6]Hyojun Kim, Sangeetha Seshadri, Clement L. Dickey, Lawrence Chiu:
Evaluating phase change memory for enterprise storage systems: a study of caching and tiering approaches. FAST 2014: 33-45 - [c5]Hyojun Kim, Ioannis Koltsidas, Nikolas Ioannou, Sangeetha Seshadri, Paul Muench, Clement L. Dickey, Lawrence Chiu:
How Could a Flash Cache Degrade Database Performance Rather Than Improve It? Lessons to be Learnt from Multi-Tiered Storage. INFLOW 2014 - [c4]Hyojun Kim, Ioannis Koltsidas, Nikolas Ioannou, Sangeetha Seshadri, Paul Muench, Clement L. Dickey, Lawrence Chiu:
Flash-Conscious Cache Population for Enterprise Database Workloads. ADMS@VLDB 2014: 45-56 - 2013
- [c3]Hyojun Kim, Sangeetha Seshadri, Clement L. Dickey, Lawrence Chiu:
Phase change memory in enterprise storage systems: silver bullet or snake oil? INFLOW@SOSP 2013: 2:1-2:8 - 2010
- [c2]Gong Zhang, Lawrence Chiu, Clem Dickey, Ling Liu, Paul Muench, Sangeetha Seshadri:
Automated lookahead data migration in SSD-enabled multi-tiered storage systems. MSST 2010: 1-6
2000 – 2009
- 2008
- [c1]Sangeetha Seshadri, Lawrence Chiu, Cornel Constantinescu, Subashini Balachandran, Clem Dickey, Ling Liu, Paul Muench:
Enhancing Storage System Availability on Multi-Core Architectures with Recovery-Conscious Scheduling. FAST 2008: 143-158
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint