Hongbo Kang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hongbo Kang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Phillip B. Gibbons
Carnegie Mellon University, Pittsburgh, USA
7 shared publications - Guy E. Blelloch
Carnegie Mellon University
6 shared publications - Yiwei Zhao
Carnegie Mellon University, Pittsburgh, USA
5 shared publications - Charles McGuffey
Reed College, Portland, USA
4 shared publications - Laxman Dhulipala
University of Maryland, College Park, College PARK, USA
4 shared publications - Yan Gu
University of California, Riverside, Riverside, USA
4 shared publications
Latest Publications
- Open Access
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 392-404
Non-Clairvoyant Scheduling for Processing-in-Memory
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 392-404
Open AccessNon-Clairvoyant Scheduling for Processing-in-Memory
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 480-495
PIM-zd-tree: A Fast Space-Partitioning Index Leveraging Processing-in-Memory
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 480-495
Open AccessPIM-zd-tree: A Fast Space-Partitioning Index Leveraging Processing-in-Memory
- Open Access
- 24 September 2025
- Published by Springer Nature in The VLDB Journal
- Vol. 34 (6) , 1-25
PIM-tree: A Skew-resistant Index for Processing-in-Memory
The performance of today’s in-memory indexes is bottlenecked by the memory latency/bandwidth wall. Processing-in-memory (PIM) is an emerging approach that potentially mitigates this bottleneck by enabling low-latency memory access whose aggregate memory bandwidth scales with the number of PIM nodes. There is an inherent tension, however, between minimizing inter-node communication and achieving load balance in PIM systems, in the presence of workload skew. This paper presents PIM-tree , an ordered index for PIM systems that achieves both low communication and high load balance, regardless of the degree of skew in data/queries. Our skew-resistant index is based on a novel division of labor between the multi-core host CPU and the PIM nodes, which leverages the strengths of each. We introduce push-pull search , which dynamically decides whether to push queries to a PIM-tree node (CPU $$\rightarrow $$ PIM-node) or pull the node’s keys back to the CPU (PIM-node $$\rightarrow $$ CPU) based on workload skew. Combined with other PIM-friendly optimizations ( shadow subtrees and chunking ), PIM-tree achieves high throughput, (guaranteed) low communication, and (guaranteed) high load balance, for batches of point queries, updates, and range scans. We implement the PIM-tree structure, in addition to prior proposed PIM indexes, on the latest PIM system from UPMEM, with 32 CPU cores and 2048 PIM nodes. On workloads with 500 million keys and batches of 1 million queries, the throughput using PIM-trees is up to $$69.7\times $$ and $$59.1\times $$ higher than the two best prior PIM-based methods. As far as we know these are the first implementations of ordered indexes on real PIM systems.- 24 September 2025
- Published by Springer Nature in The VLDB Journal
- Vol. 34 (6) , 1-25
Open AccessPIM-tree: A Skew-resistant Index for Processing-in-Memory
The performance of today’s in-memory indexes is bottlenecked by the memory latency/bandwidth wall. Processing-in-memory (PIM) is an emerging approach that potentially mitigates this bottleneck by enabling low-latency memory access whose aggregate memory bandwidth scales with the number of PIM nodes. There is an inherent tension, however, between minimizing inter-node communication and achieving load balance in PIM systems, in the presence of workload skew. This paper presents PIM-tree , an ordered index for PIM systems that achieves both low communication and high load balance, regardless of the degree of skew in data/queries. Our skew-resistant index is based on a novel division of labor between the multi-core host CPU and the PIM nodes, which leverages the strengths of each. We introduce push-pull search , which dynamically decides whether to push queries to a PIM-tree node (CPU $$\rightarrow $$ PIM-node) or pull the node’s keys back to the CPU (PIM-node $$\rightarrow $$ CPU) based on workload skew. Combined with other PIM-friendly optimizations ( shadow subtrees and chunking ), PIM-tree achieves high throughput, (guaranteed) low communication, and (guaranteed) high load balance, for batches of point queries, updates, and range scans. We implement the PIM-tree structure, in addition to prior proposed PIM indexes, on the latest PIM system from UPMEM, with 32 CPU cores and 2048 PIM nodes. On workloads with 500 million keys and batches of 1 million queries, the throughput using PIM-trees is up to $$69.7\times $$ and $$59.1\times $$ higher than the two best prior PIM-based methods. As far as we know these are the first implementations of ordered indexes on real PIM systems. - Open Access
- 16 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 350-366
Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications
- 16 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 350-366
Open AccessOptimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications
- Open Access
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 13-14
PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract) | Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing
Processing-in-memory (PIM) is an emerging technology to alleviate the high cost of data movement by pushing computation into/near memory modules. There is an inherent tension, however, between minimizing communication (data movement) and achieving load balance in PIM systems in the presence of workload skew. This work introduces PIM-tree, a PIM-based index that simultaneously achieves low communication, good load balance, and low space consumption. It achieves good theoretical bounds in the PIM Model and efficient on a real-world PIM machine, outperforming prior PIM-based and state-of-the-art CPU-based indexes.
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 13-14
Open AccessPIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract) | Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing
Processing-in-memory (PIM) is an emerging technology to alleviate the high cost of data movement by pushing computation into/near memory modules. There is an inherent tension, however, between minimizing communication (data movement) and achieving load balance in PIM systems in the presence of workload skew. This work introduces PIM-tree, a PIM-based index that simultaneously achieves low communication, good load balance, and low space consumption. It achieves good theoretical bounds in the PIM Model and efficient on a real-world PIM machine, outperforming prior PIM-based and state-of-the-art CPU-based indexes.
- Open Access
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
PIM-trie: A Skew-resistant Trie for Processing-in-Memory
Memory latency and bandwidth are significant bottlenecks in designing in-memory indexes. Processing-in-memory (PIM), an emerging hardware design approach, alleviates this problem by embedding processors in memory modules, enabling low-latency memory access whose aggregated bandwidth scales linearly with the number of PIM modules. Despite recent work in balanced comparison-based indexes on PIM systems, building efficient tries for PIMs remains an open challenge due to tries' inherently unbalanced shape. This paper presents the PIM-trie, the first batch-parallel radix-based index for PIM systems that provides load balance and low communication under adversary-controlled workloads. We introduce trie matching-matching a query trie of a batch against the compressed data trie-as a key building block for PIM-friendly index operations. Our algorithm combines (i) hash-based comparisons for coarse-grained work distribution/elimination and (ii) bit-by-bit comparisons for fine-grained matching. Combined with other techniques (meta-block decomposition, selective recursive replication, differentiated verification), PIM-trie supports LongestCommonPrefix, Insert, and Delete in O(logP) communication rounds per batch and O(l/w) communication volume per string, where P is the number of PIM modules, l is the string length in bits, and w is the machine word size. Moreover, work and communication are load-balanced among modules whp, even under worst-case skew.
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Open AccessPIM-trie: A Skew-resistant Trie for Processing-in-Memory
Memory latency and bandwidth are significant bottlenecks in designing in-memory indexes. Processing-in-memory (PIM), an emerging hardware design approach, alleviates this problem by embedding processors in memory modules, enabling low-latency memory access whose aggregated bandwidth scales linearly with the number of PIM modules. Despite recent work in balanced comparison-based indexes on PIM systems, building efficient tries for PIMs remains an open challenge due to tries' inherently unbalanced shape. This paper presents the PIM-trie, the first batch-parallel radix-based index for PIM systems that provides load balance and low communication under adversary-controlled workloads. We introduce trie matching-matching a query trie of a batch against the compressed data trie-as a key building block for PIM-friendly index operations. Our algorithm combines (i) hash-based comparisons for coarse-grained work distribution/elimination and (ii) bit-by-bit comparisons for fine-grained matching. Combined with other techniques (meta-block decomposition, selective recursive replication, differentiated verification), PIM-trie supports LongestCommonPrefix, Insert, and Delete in O(logP) communication rounds per batch and O(l/w) communication volume per string, where P is the number of PIM modules, l is the string length in bits, and w is the machine word size. Moreover, work and communication are load-balanced among modules whp, even under worst-case skew.
- Open Access
PIM-tree: A Skew-resistant Index for Processing-in-Memory
The performance of today's in-memory indexes is bottlenecked by the memory latency/bandwidth wall. Processing-in-memory (PIM) is an emerging approach that potentially mitigates this bottleneck, by enabling low-latency memory access whose aggregate memory bandwidth scales with the number of PIM nodes. There is an inherent tension, however, between minimizing inter-node communication and achieving load balance in PIM systems, in the presence of workload skew. This paper presents PIM-tree, an ordered index for PIM systems that achieves both low communication and high load balance, regardless of the degree of skew in the data and the queries. Our skew-resistant index is based on a novel division of labor between the multi-core host CPU and the PIM nodes, which leverages the strengths of each. We introduce push-pull search, which dynamically decides whether to push queries to a PIM-tree node (CPU -> PIM-node) or pull the node's keys back to the CPU (PIM-node -> CPU) based on workload skew. Combined with other PIM-friendly optimizations (shadow subtrees and chunked skip lists), our PIM-tree provides high-throughput, (guaranteed) low communication, and (guaranteed) high load balance, for batches of point queries, updates, and range scans. We implement the PIM-tree structure, in addition to prior proposed PIM indexes, on the latest PIM system from UPMEM, with 32 CPU cores and 2048 PIM nodes. On workloads with 500 million keys and batches of one million queries, the throughput using PIM-trees is up to 69.7x and 59.1x higher than the two best prior methods. As far as we know these are the first implementations of an ordered index on a real PIM system.
Open AccessPIM-tree: A Skew-resistant Index for Processing-in-Memory
The performance of today's in-memory indexes is bottlenecked by the memory latency/bandwidth wall. Processing-in-memory (PIM) is an emerging approach that potentially mitigates this bottleneck, by enabling low-latency memory access whose aggregate memory bandwidth scales with the number of PIM nodes. There is an inherent tension, however, between minimizing inter-node communication and achieving load balance in PIM systems, in the presence of workload skew. This paper presents PIM-tree, an ordered index for PIM systems that achieves both low communication and high load balance, regardless of the degree of skew in the data and the queries. Our skew-resistant index is based on a novel division of labor between the multi-core host CPU and the PIM nodes, which leverages the strengths of each. We introduce push-pull search, which dynamically decides whether to push queries to a PIM-tree node (CPU -> PIM-node) or pull the node's keys back to the CPU (PIM-node -> CPU) based on workload skew. Combined with other PIM-friendly optimizations (shadow subtrees and chunked skip lists), our PIM-tree provides high-throughput, (guaranteed) low communication, and (guaranteed) high load balance, for batches of point queries, updates, and range scans. We implement the PIM-tree structure, in addition to prior proposed PIM indexes, on the latest PIM system from UPMEM, with 32 CPU cores and 2048 PIM nodes. On workloads with 500 million keys and batches of one million queries, the throughput using PIM-trees is up to 69.7x and 59.1x higher than the two best prior methods. As far as we know these are the first implementations of an ordered index on a real PIM system.
- 1 January 2020
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 80, 104987
Impulsive bipartite consensus of second-order multi-agent systems without relative velocity information
- 1 January 2020
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 80, 104987
Impulsive bipartite consensus of second-order multi-agent systems without relative velocity information
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2884-2889
Design of Industrial Field Intelligent Temperature Acquisition System Based on Timestamped Anti-Interference Algorithm
At present, wired method is used widely in the acquisition and transmission of field signals in industrial field acquisition system. There are some problems such as long cables, difficult wiring, analog signals that are susceptible to interference and so on. A new design of industrial field intelligent temperature acquisition system based on timestamped anti-interference algorithm is presented in the paper. The system can collect analog signals of PT100 and convert that to digital signals which are transmitted to the control center by Data Transceiver. When the signals reach the control center, the system will process digital signals, and set up T-R relation table based on least square algorithm, and at last, the signals are restored to resistance signals of PT100 by using multichannel digital potentiometers. The system uses wireless transmission instead of wired transmission, to realize the collection, transmission and recovery of thermal resistance information, and solve the interference problem of long-distance wireless communication. Experimental test verify that the system communication is normal, stability and accurate, which provides a reasonable design scheme for the application of data transmission technology in industrial field.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2884-2889
Design of Industrial Field Intelligent Temperature Acquisition System Based on Timestamped Anti-Interference Algorithm
At present, wired method is used widely in the acquisition and transmission of field signals in industrial field acquisition system. There are some problems such as long cables, difficult wiring, analog signals that are susceptible to interference and so on. A new design of industrial field intelligent temperature acquisition system based on timestamped anti-interference algorithm is presented in the paper. The system can collect analog signals of PT100 and convert that to digital signals which are transmitted to the control center by Data Transceiver. When the signals reach the control center, the system will process digital signals, and set up T-R relation table based on least square algorithm, and at last, the signals are restored to resistance signals of PT100 by using multichannel digital potentiometers. The system uses wireless transmission instead of wired transmission, to realize the collection, transmission and recovery of thermal resistance information, and solve the interference problem of long-distance wireless communication. Experimental test verify that the system communication is normal, stability and accurate, which provides a reasonable design scheme for the application of data transmission technology in industrial field.