Chao Jin
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
Research Subjects
Chao Jin has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- David Abramson
The University of Queensland, Brisbane, Australia
3 shared publications - Bronis R. de Supinski
Lawrence Livermore National Laboratory, Livermore, USA
1 shared publication - Jake Carroll
School of Electrical Engineering and Computer Science, University of Queensland, Brisbane, Australia
1 shared publication - Justin Luong
Affiliation The University of Queensland Diamantina Institute, The University of Queensland, Brisbane, Australia
1 shared publication - Mark Endrei
The University of Queensland, Brisbane, QLD, Australia
1 shared publication - Minh Ngoc Dinh
RMIT University Australia
1 shared publication
Latest Publications
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1564-1573
A Cache Interaction Graph for Data Locality Optimization
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1564-1573
Open AccessA Cache Interaction Graph for Data Locality Optimization
- Open Access
- 3 June 2020
- Published by Springer Nature
- p. 3-22
A BeeGFS-Based Caching File System for Data-Intensive Parallel Computing
- 3 June 2020
- Published by Springer Nature
- p. 3-22
Open AccessA BeeGFS-Based Caching File System for Data-Intensive Parallel Computing
- 27 March 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 25 (3) , 740-749
Scalable Relative Debugging
Detecting and isolating bugs that arise only at high processor counts is a challenging task. Over a number of years, we have implemented a special debugging method, called "relative debugging," that supports debugging applications as they evolve or are ported to larger machines. It allows a user to compare the state of a suspect program against another reference version even as the number of processors is increased. The innovative idea is the comparison of runtime data to reason about the state of the suspect program. While powerful, a naïve implementation of the comparison phase does not scale to large problems running on large machines. In this paper, we propose two different solutions including a hash-based scheme and a direct point-to-point scheme. We demonstrate the implementation, a case study, as well as the performance, of our techniques on 20K cores of a Cray XE6 system.
- 27 March 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 25 (3) , 740-749
Scalable Relative Debugging
Detecting and isolating bugs that arise only at high processor counts is a challenging task. Over a number of years, we have implemented a special debugging method, called "relative debugging," that supports debugging applications as they evolve or are ported to larger machines. It allows a user to compare the state of a suspect program against another reference version even as the number of processors is increased. The innovative idea is the comparison of runtime data to reason about the state of the suspect program. While powerful, a naïve implementation of the comparison phase does not scale to large problems running on large machines. In this paper, we propose two different solutions including a hash-based scheme and a direct point-to-point scheme. We demonstrate the implementation, a case study, as well as the performance, of our techniques on 20K cores of a Cray XE6 system.