Demo Data from EDBT 2026 / reviewers in the wild / expert
Surabhi Jain
dblp:73/8229
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2018
0009-0002-8335-2951ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-authorTheory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 50% Parallel and multicore computing · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing
collective communication |
0.3 | 1 | 2018 | Framework for scalable intra-node collective operations using shared memory · SC 2018 |
Parallel and multicore computing › parallel computing › parallel communication
shared-memory communication |
0.3 | 1 | 2018 | Framework for scalable intra-node collective operations using shared memory · SC 2018 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Framework for scalable intra-node collective operations using shared memory
Surabhi Jain, Rashid Kaleem, Marc Gamell, Akhil Langer, Dmitry Durnov, Alexander Sannikov, María Jesús Garzarán |
SC | 1 |
| 2015 | Efficient and Simplified Parallel Graph Processing over CPU and MICabstractIntel Xeon Phi (MIC architecture) is a relatively new accelerator chip, which combines large-scale shared memory parallelism with wide SIMD lanes. Mapping applications on anode with such an architecture to achieve high parallel efficiency's a major challenge. In this paper, we focus on developing system for heterogeneous graph processing, which is able to utilize both a many-core Xeon Phi and a multi-core CPU ozone node. We propose a simple programming API with unintuitive interface for expressing SIMD parallelism. We develop efficient techniques for supporting our high-level API, focusing on exploiting wide SIMD lanes, massive number of cores, and partitioning of the work across CPU and accelerator, while handling the irregularity of graph applications. The components of our runtime system include a condensed static memory buffer, which supports efficient message insertion and SIMD message reduction while keeping memory requirements low, and specifically formic, a pipelining scheme for efficient message generation by avoiding frequent locking operations. Besides, a hybrid graph partitioning module is able to effectively partition the workload between the CPU and the MIC, ensuring balanced workload and low communication overhead. The main observations from our experimental evaluation using five popular applications are: formic executions, pipelining scheme is up to 3.36x faster than naive approach using locking based message generation, and the speedup over OpenMP ranges from 1.17 to 4.15. Heterogeneous-MIC execution achieves a speedup of up to 1.41 over the better of the CPU-only and MIC-only executions. Linchuan Chen, Xin Huo, Bin Ren 0002, Surabhi Jain, Gagan Agrawal |
IPDPS | 4 |
| 2010 | A 3-Approximation for Facility Location with Uniform Capacities
Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg 0001, Neelima Gupta, Surabhi Jain |
IPCO | 7 |