default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrina Calciu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Irina Calciu, M. Talha Imran, Ivan Puddu
, Sanidhya Kashyap, Hasan Al Maruf, Onur Mutlu, Aasheesh Kolli:
Using Local Cache Coherence for Disaggregated Memory Systems. ACM SIGOPS Oper. Syst. Rev. 57(1): 21-28 (2023)- 2022
- [j3]Irina Calciu, Geoff Kuenning:
Introduction to the Special Section on USENIX ATC 2021. ACM Trans. Storage 18(2): 10:1-10:2 (2022) - [c19]Sujin Park, Diyu Zhou, Yuchen Qian, Irina Calciu, Taesoo Kim, Sanidhya Kashyap:
Application-Informed Kernel Synchronization Primitives. OSDI 2022: 667-682 - 2021
- [c18]Irina Calciu, M. Talha Imran, Ivan Puddu, Sanidhya Kashyap, Hasan Al Maruf, Onur Mutlu, Aasheesh Kolli:
Rethinking software runtimes for disaggregated memory. ASPLOS 2021: 79-92 - [c17]Sujin Park, Irina Calciu, Taesoo Kim, Sanidhya Kashyap:
Contextual concurrency control. HotOS 2021: 167-174 - [c16]Ankit Bhardwaj, Chinmay Kulkarni, Reto Achermann, Irina Calciu, Sanidhya Kashyap, Ryan Stutsman, Amy Tai, Gerd Zellweger:
NrOS: Effective Replication and Sharing in an Operating System. OSDI 2021: 295-312 - [e1]Irina Calciu, Geoff Kuenning:
Proceedings of the 2021 USENIX Annual Technical Conference, USENIX ATC 2021, July 14-16, 2021. USENIX Association 2021 [contents] - 2020
- [c15]Sebastian-Lucian Muraru, Paula Condruz, Irina Calciu:
Development of software for optimizing the fertilization of agricultural crop. ECAI 2020: 1-6 - [i2]Pradeep Fernando, Irina Calciu, Jayneel Gandhi, Aasheesh Kolli, Ada Gavrilovska:
Persistence and Synchronization: Friends or Foes? CoRR abs/2012.15731 (2020)
2010 – 2019
- 2019
- [c14]Irina Calciu, Ivan Puddu, Aasheesh Kolli, Andreas Nowatzyk, Jayneel Gandhi, Onur Mutlu, Pratap Subrahmanyam:
Project PBerry: FPGA Acceleration for Remote Memory. HotOS 2019: 127-135 - [c13]Sanidhya Kashyap, Irina Calciu, Xiaohe Cheng, Changwoo Min, Taesoo Kim:
Scalable and practical locking with shuffling. SOSP 2019: 586-599 - 2018
- [j2]Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera:
How to implement any concurrent data structure. Commun. ACM 61(12): 97-105 (2018) - [c12]Marcos K. Aguilera, Naama Ben-David, Irina Calciu, Rachid Guerraoui, Erez Petrank, Sam Toueg:
Passing Messages while Sharing Memory. PODC 2018: 51-60 - [c11]Marcos K. Aguilera, Nadav Amit, Irina Calciu, Xavier Deguillard, Jayneel Gandhi, Stanko Novakovic, Arun Ramanathan, Pratap Subrahmanyam, Lalith Suresh, Kiran Tati, Rajesh Venkatasubramanian, Michael Wei:
Remote regions: a simple abstraction for remote memory. USENIX ATC 2018: 775-787 - 2017
- [j1]Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera:
How to implement any concurrent data structure for modern servers. ACM SIGOPS Oper. Syst. Rev. 51(1): 24-32 (2017) - [c10]Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera:
Black-box Concurrent Data Structures for NUMA Architectures. ASPLOS 2017: 207-221 - [c9]Marcos K. Aguilera, Nadav Amit, Irina Calciu, Xavier Deguillard, Jayneel Gandhi, Pratap Subrahmanyam, Lalith Suresh, Kiran Tati, Rajesh Venkatasubramanian, Michael Wei:
Remote memory in the age of fast networks. SoCC 2017: 121-127 - [c8]Zhiyu Liu, Irina Calciu, Maurice Herlihy, Onur Mutlu:
Concurrent Data Structures for Near-Memory Computing. SPAA 2017: 235-245 - [c7]Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera:
Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures. DISC 2017: 45:1-45:3 - 2016
- [c6]Himanshu Chauhan, Irina Calciu, Vijay Chidambaram, Eric Schkufza, Onur Mutlu, Pratap Subrahmanyam:
NVMOVE: Helping Programmers Move to Byte-Based Persistence. INFLOW@OSDI 2016 - 2015
- [b1]Irina Calciu:
Concurrent Algorithms for Emerging Hardware Platforms. Brown University, USA, 2015 - 2014
- [c5]Irina Calciu, Justin Gottschlich, Tatiana Shpeisman, Gilles Pokam, Maurice Herlihy:
Invyswell: a hybrid transactional memory for haswell's restricted transactional memory. PACT 2014: 187-200 - [c4]Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. DISC 2014: 406-420 - [i1]Irina Calciu, Hammurabi Mendes, Maurice Herlihy:
The Adaptive Priority Queue with Elimination and Combining. CoRR abs/1408.1021 (2014) - 2013
- [c3]Irina Calciu, Justin Emile Gottschlich, Maurice Herlihy:
Using Elimination and Delegation to Implement a Scalable NUMA-Friendly Stack. HotPar 2013 - [c2]Irina Calciu, Dave Dice, Tim Harris, Maurice Herlihy, Alex Kogan, Virendra J. Marathe, Mark Moir:
Message Passing or Shared Memory: Evaluating the Delegation Abstraction for Multicores. OPODIS 2013: 83-97 - [c1]Irina Calciu, David Dice, Yossi Lev, Victor Luchangco, Virendra J. Marathe, Nir Shavit:
NUMA-aware reader-writer locks. PPoPP 2013: 157-166
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-07-17 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
