default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeita Iwabuchi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j3]Roxana Bujack, Maya B. Gokhale, Latchesar Ionkov, Keita Iwabuchi, Michael R. Jantz, Terry R. Jones, Sumathi Lakshmiranganatha, Michael K. Lang, Jason Lee, Matthew Ben Olson, Scott Pakin, Roger Pearce, Jonathan Pietarila Graham, Li Tang, Terece L. Turton, Sean Williams:
The ECP SICM project: Managing complex memory hierarchies for exascale applications. Int. J. High Perform. Comput. Appl. 39(1): 193-207 (2025)- 2024
- [c17]Keita Iwabuchi, Trevor Steil, Benjamin W. Priest, Roger Pearce, Geoffrey Sanders:
NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction. SC Workshops 2024: 688-696 - 2023
- [c16]Keita Iwabuchi
, Trevor Steil, Benjamin Priest, Roger Pearce, Geoffrey Sanders:
Towards A Massive-scale Distributed Neighborhood Graph Construction. SC Workshops 2023: 728-738 - 2022
- [j2]Keita Iwabuchi, Karim Youssef, Kaushik Velusamy, Maya B. Gokhale, Roger Pearce:
Metall: A persistent memory allocator for data-centric analytics. Parallel Comput. 111: 102905 (2022) - [j1]Ivy Bo Peng, Maya B. Gokhale, Karim Youssef, Keita Iwabuchi, Roger Pearce:
Enabling Scalable and Extensible Memory-Mapped Datastores in Userspace. IEEE Trans. Parallel Distributed Syst. 33(4): 866-877 (2022) - [c15]Karim Youssef, Abdullah Al Raqibul Islam, Keita Iwabuchi, Wu-chun Feng, Roger Pearce:
Optimizing Performance and Storage of Memory-Mapped Persistent Data Structures. HPEC 2022: 1-7 - 2021
- [c14]Karim Youssef, Keita Iwabuchi, Wu-Chun Feng, Roger Pearce:
Privateer: Multi-versioned Memory-mapped Data Stores for High-Performance Data Science. HPEC 2021: 1-7 - [c13]Kenneth Lamar, Christina L. Peterson, Damian Dechev, Roger Pearce, Keita Iwabuchi, Peter Pirkelbauer:
PMap: A Non-volatile Lock-free Hash Map with Open Addressing. NVMSA 2021: 1-7 - [c12]Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce:
TriPoll: computing surveys of triangles in massive-scale temporal graphs with metadata. SC 2021: 67 - [c11]Peter Pirkelbauer, Seth Bromberger, Keita Iwabuchi, Roger Pearce:
Towards Scalable Data Processing in Python with CLIPPy. IA3@SC 2021: 43-52 - [i3]Trevor Steil, Tahsin Reza, Keita Iwabuchi, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce:
TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata. CoRR abs/2107.12330 (2021) - [i2]Keita Iwabuchi, Karim Youssef, Kaushik Velusamy, Maya B. Gokhale, Roger Pearce:
Metall: A Persistent Memory Allocator For Data-Centric Analytics. CoRR abs/2108.07223 (2021)
2010 – 2019
- 2019
- [c10]Trevor Steil, Benjamin W. Priest, Geoffrey Sanders, Roger Pearce, Timothy La Fond, Keita Iwabuchi:
Distributed Kronecker Graph Generation with Ground Truth of Many Graph Properties. IPDPS Workshops 2019: 251-260 - [c9]Keita Iwabuchi, Lance Lebanoff, Maya B. Gokhale, Roger Pearce:
Metall: A Persistent Memory Allocator Enabling Graph Processing. IA3@SC 2019: 39-44 - [c8]Ivy Bo Peng, Marty McFadden, Eric W. Green, Keita Iwabuchi, Kai Wu, Dong Li, Roger Pearce, Maya B. Gokhale:
UMap: Enabling Application-driven Optimizations for Page Management. MCHPC@SC 2019: 71-78 - [i1]Ivy Bo Peng, Marty McFadden, Eric W. Green, Keita Iwabuchi, Kai Wu, Dong Li, Roger Pearce, Maya B. Gokhale:
UMap: Enabling Application-driven Optimizations for Page Management. CoRR abs/1910.07566 (2019) - 2018
- [c7]Keita Iwabuchi, Geoffrey Sanders, Keith Henderson, Roger Pearce:
Computing Exact Vertex Eccentricity on Massive-Scale Distributed Graphs. CLUSTER 2018: 257-267 - 2017
- [c6]Kevin A. Brown, Tianqi Xu, Keita Iwabuchi, Kento Sato, Adam Moody, Kathryn M. Mohror, Nikhil Jain, Abhinav Bhatele, Martin Schulz, Roger A. Pearce, Maya B. Gokhale, Satoshi Matsuoka:
Accelerating Big Data Infrastructure and Applications (Ongoing Collaboration). ICDCS Workshops 2017: 343-347 - [c5]Manu Shantharam, Keita Iwabuchi, Pietro Cicotti, Laura Carrington, Maya B. Gokhale, Roger A. Pearce:
Performance Evaluation of Scale-Free Graph Algorithms in Low Latency Non-volatile Memory. IPDPS Workshops 2017: 1021-1028 - 2016
- [c4]Keita Iwabuchi, Scott Sallinen, Roger A. Pearce, Brian Van Essen, Maya B. Gokhale, Satoshi Matsuoka:
Towards a Distributed Large-Scale Dynamic Graph Data Store. IPDPS Workshops 2016: 892-901 - [c3]Scott Sallinen, Keita Iwabuchi, Suraj Poudel, Maya B. Gokhale, Matei Ripeanu, Roger A. Pearce:
Graph colouring as a challenge problem for dynamic graph processing on distributed systems. SC 2016: 347-358 - 2014
- [c2]Keita Iwabuchi, Hitoshi Sato, Yuichiro Yasui, Katsuki Fujisawa, Satoshi Matsuoka:
NVM-based Hybrid BFS with memory efficient data structure. IEEE BigData 2014: 529-538 - [c1]Keita Iwabuchi, Hitoshi Sato, Ryo Mizote, Yuichiro Yasui, Katsuki Fujisawa, Satoshi Matsuoka:
Hybrid BFS Approach Using Semi-external Memory. IPDPS Workshops 2014: 1698-1707
Coauthor Index
aka: Roger Pearce
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-01-22 20:35 CET 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:
