Demo Data from EDBT 2026 / reviewers in the wild / expert
Mark Oxley
dblp:303/7359
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
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% GPUs and heterogeneous computing · 50% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Medical and health informatics · 100% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Medical and health informatics
microscopy imaging |
0.2 | 1 | 2022 | Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction · SC 2022 |
Methods — techniques the papers use, named apart from their topics
tiling · 1.1image gradient decomposition · 1.1asynchronous communication · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic ReconstructionabstractPtychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm. Xiao Wang 0004, Aristeidis Tsaris, Debangshu Mukherjee, Mohamed Wahib, Peng Chen 0035, Mark Oxley, Olga Ovchinnikova, Jacob D. Hinkle |
SC | 6 |