Bin Dong

Dr. Bin Dong


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 January 2020 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
SBSuren Byna
Suren Byna
MBM. Scot Breitenfeld
M. Scot Breitenfeld
Bin DongBin Dong
Bin Dong
QKQuincey Koziol
Quincey Koziol
EPElena Pourmal
Elena Pourmal
RWRichard Warren
Richard Warren

1 July 2022 in Computers & Geosciences
Verified
Journal Article
Closed access
Bin DongBin Dong
Bin Dong
APAlex Popescu
Alex Popescu
VTVerónica Rodríguez Tribaldos
Verónica Rodríguez Tribaldos
SBSuren Byna
Suren Byna
JAJonathan Ajo-Franklin
Jonathan Ajo-Franklin
Kesheng WuKesheng Wu
Kesheng Wu

14 March 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
RHRunzhou Han
Runzhou Han
MZMai Zheng
Mai Zheng
SBSuren Byna
Suren Byna
HTHoujun Tang
Houjun Tang
Bin DongBin Dong
Bin Dong
DTDavid Thorsley
David Thorsley
Data provenance, or data lineage, describes the life cycle of data. In scientific workflows on HPC systems, scientists often seek diverse provenance (e.g., origins of data products, usage patterns of datasets). Unfortunately, existing provenance solutions cannot address the challenges due to their incompatible provenance models and/or system implementations. In this paper, we analyze four representative scientific workflows in collaboration with the domain scientists to identify concrete provenance needs. Based on the first-hand analysis, we propose a provenance framework called PROV-IO $^+$ , which includes an I/O-centric provenance model for describing scientific data and the associated I/O operations and environments precisely. Moreover, we build a prototype of PROV-IO $^+$ to enable end-to-end provenance support on real HPC systems with little manual effort. The PROV-IO $^+$ framework can support both containerized and non-containerized workflows on different HPC platforms with flexibility in selecting various classes of provenance. Our experiments with realistic workflows show that PROV-IO $^+$ can address the provenance needs of the domain scientists effectively with reasonable performance (e.g., less than 3.5% tracking overhead for most experiments). Moreover, PROV-IO $^+$ outperforms a state-of-the-art system (i.e., ProvLake) in our experiments.

7 August 2023
Verified
Conference Paper
Open access
Bin DongBin Dong
Bin Dong
JBJean Luca NMI Bez
Jean Luca NMI Bez
SBSuren Byna
Suren Byna
Manually diagnosing the I/O performance bottleneck for a single application (hereinafter referred to as the "job level'') is a tedious and error-prone procedure requiring domain scientists to have deep knowledge of complex storage systems. However, existing automatic methods for I/O performance bottleneck diagnosis have one major issue: the granularity of the analysis is at the platform or group level and the diagnosis results cannot be applied to the individual application. To address this issue, we designed and developed a method named "Artificial Intelligence for I/O" (AIIO), which uses AI and its interpretation technology to diagnose I/O performance bottlenecks at the job level automatically. By considering the sparsity of I/O log files, employing multiple AI models for performance prediction, merging diagnosis results across multiple models, and generalizing its performance prediction and diagnosis functions, AIIO can accurately and robustly identify the bottleneck of an even unseen application. Experimental results show that real and unseen applications can use the diagnosis results from AIIO to improve their I/O performance by at most 146 times.

17 May 2019 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
Bin DongBin Dong
Bin Dong
KWKesheng Wu
Kesheng Wu
SBSuren Byna
Suren Byna
HTHoujun Tang
Houjun Tang

27 May 2024
Verified
Conference Paper
Closed access
Bin DongBin Dong
Bin Dong
Kesheng WuKesheng Wu
Kesheng Wu
SBSuren Byna
Suren Byna
Sparse tensors are prevalent in many applications. While numerous approaches have emerged to optimize the organization of sparse tensors, with the goal of reducing storage requirements and enhancing access performance, a comprehensive examination of the associated time and space complexities has been notably lacking. This study bridges this gap by conducting both theoretical and empirical investigations into various strategies for storing sparse tensors. Our major findings are as follows: (1) Linear address-based organization provides the best balance between storage size and access time; (2) Sparse high-dimensional tensor data can be transformed into lower-dimensional tensors, facilitating efficient storage and access; (3) In the absence of dimension transformation, tree-structured organizations offer compelling performance in low-dimensional tensors and exceptional performance in high-dimensional tensors.