


default search action
Joseph Izraelevitz
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Samuel Thomas
, Kidus Workneh
, Ange-Thierry Ishimwe
, Zack McKevitt
, Phaedra S. Curlin
, R. Iris Bahar
, Joseph Izraelevitz
, Tamara Lehman
:
Baobab Merkle Tree for Efficient Secure Memory. IEEE Comput. Archit. Lett. 23(1): 33-36 (2024) - [c23]Samuel Thomas
, Kidus Workneh
, Jac McCarty
, Joseph Izraelevitz
, Tamara Lehman
, R. Iris Bahar
:
A Midsummer Night's Tree: Efficient and High Performance Secure SCM. ASPLOS (3) 2024: 22-37 - [c22]Suyash Mahar
, Mingyao Shen
, TJ Smith
, Joseph Izraelevitz
, Steven Swanson
:
Puddles: Application-Independent Recovery and Location-Independent Data for Persistent Memory. EuroSys 2024: 575-589 - [i4]Abhiram Bellur, Razan Alghamdi, Kidus Workneh, Joseph Izraelevitz:
Leroy: Library Learning for Imperative Programming Languages. CoRR abs/2410.06438 (2024) - 2023
- [c21]Zhang Liu, Dirk Grunwald, Joseph Izraelevitz, Gaukas Wang
, Sangtae Ha:
MRTOM: Mostly Reliable Totally Ordered Multicast, a Network Primitive to Offload Distributed Systems. ICDCS 2023: 638-648 - [c20]George Hodgkins, Yi Xu, Steven Swanson, Joseph Izraelevitz:
Zhuque: Failure is Not an Option, it's an Exception. USENIX ATC 2023: 833-849 - [i3]Suyash Mahar, Mingyao Shen, TJ Smith, Joseph Izraelevitz, Steven Swanson:
Puddles: Application-Independent Recovery and Location-Independent Data for Persistent Memory. CoRR abs/2310.02183 (2023) - 2022
- [c19]Joseph Izraelevitz, Gaukas Wang
, Rhett Hanscom, Kayli Silvers, Tamara Silbergleit Lehman, Gregory V. Chockler
, Alexey Gotsman:
Acuerdo: Fast Atomic Broadcast over RDMA. ICPP 2022: 59:1-59:11 - [c18]Casey Nelson, Joseph Izraelevitz, R. Iris Bahar
, Tamara Silbergleit Lehman:
Eliminating Micro-Architectural Side-Channel Attacks using Near Memory Processing. SEED 2022: 179-189 - 2021
- [c17]Yi Xu, Joseph Izraelevitz, Steven Swanson
:
Clobber-NVM: log less, re-execute more. ASPLOS 2021: 346-359 - 2020
- [j2]Jian Yang, Juno Kim, Morteza Hoseinzadeh, Joseph Izraelevitz, Steven Swanson:
An Empirical Guide to the Behavior and Use of Scalable Persistent Memory. login Usenix Mag. 45(3) (2020) - [c16]Juno Kim, Yun Joon Soh, Joseph Izraelevitz, Jishen Zhao, Steven Swanson
:
SubZero: zero-copy IO for persistent main memory file systems. APSys 2020: 1-8 - [c15]Amir Saman Memaripour, Joseph Izraelevitz, Steven Swanson
:
Pronto: Easy and Fast Persistence for Volatile Data Structures. ASPLOS 2020: 789-806 - [c14]Jian Yang, Juno Kim, Morteza Hoseinzadeh, Joseph Izraelevitz, Steven Swanson:
An Empirical Guide to the Behavior and Use of Scalable Persistent Memory. FAST 2020: 169-182 - [c13]Jian Yang, Joseph Izraelevitz, Steven Swanson:
FileMR: Rethinking RDMA Networking for Scalable Persistent Memory. NSDI 2020: 111-125
2010 – 2019
- 2019
- [c12]Jian Yang, Joseph Izraelevitz, Steven Swanson:
Orion: A Distributed File System for Non-Volatile Main Memory and RDMA-Capable Networks. FAST 2019: 221-234 - [c11]Kunal Korgaonkar, Joseph Izraelevitz, Jishen Zhao, Steven Swanson
:
Vorpal: Vector Clock Ordering For Large Persistent Memory Systems. PODC 2019: 435-444 - [i2]Joseph Izraelevitz, Jian Yang, Lu Zhang, Juno Kim, Xiao Liu, Amir Saman Memaripour, Yun Joon Soh, Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, Steven Swanson:
Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. CoRR abs/1903.05714 (2019) - [i1]Jian Yang, Juno Kim, Morteza Hoseinzadeh, Joseph Izraelevitz, Steven Swanson:
An Empirical Guide to the Behavior and Use of Scalable Persistent Memory. CoRR abs/1908.03583 (2019) - 2018
- [c10]Qingrui Liu, Joseph Izraelevitz, Se Kwon Lee, Michael L. Scott
, Sam H. Noh, Changhee Jung:
iDO: Compiler-Directed Failure Atomicity for Nonvolatile Memory. MICRO 2018: 258-270 - [c9]Haosen Wen, Joseph Izraelevitz, Wentao Cai
, H. Alan Beadle, Michael L. Scott:
Interval-based memory reclamation. PPoPP 2018: 1-13 - 2017
- [j1]Joseph Izraelevitz, Michael L. Scott
:
Generality and Speed in Nonblocking Dual Containers. ACM Trans. Parallel Comput. 3(4): 22:1-22:37 (2017) - [c8]Joseph Izraelevitz, Lingxiang Xiang, Michael L. Scott
:
Performance Improvement via Always-Abort HTM. PACT 2017: 79-90 - [c7]Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, Michael L. Scott
:
Dalí: A Periodically Persistent Hash Map. DISC 2017: 37:1-37:16 - 2016
- [c6]Joseph Izraelevitz, Terence Kelly, Aasheesh Kolli:
Failure-Atomic Persistent Memory Updates via JUSTDO Logging. ASPLOS 2016: 427-442 - [c5]Matthew Graichen, Joseph Izraelevitz, Michael L. Scott
:
An Unbounded Nonblocking Double-Ended Queue. ICPP 2016: 217-226 - [c4]Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott
:
Brief Announcement: Preserving Happens-before in Persistent Memory. SPAA 2016: 157-159 - [c3]Joseph Izraelevitz, Hammurabi Mendes, Michael L. Scott
:
Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model. DISC 2016: 313-327 - 2014
- [c2]Joseph Izraelevitz, Michael L. Scott
:
Brief announcement: a generic construction for nonblocking dual containers. PODC 2014: 53-55 - [c1]Joseph Izraelevitz, Michael L. Scott
:
Brief announcement: fast dual ring queues. SPAA 2014: 73-75
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 2025-03-04 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint