Cy Chan
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
Cy Chan has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Maximilian Bremer
Lawrence Berkeley National Laboratory, USA
4 shared publications - John Bachan
Lawrence Berkeley National Laboratory, USA
2 shared publications - John Shalf
Lawrence Berkeley National Laboratory, Berkeley, CA, USA
2 shared publications - Tan Nguyen
Lawrence Berkeley National Laboratory, Berkeley, CA, USA
2 shared publications - Abdul Motaleb Faysal
Computer Science, University of Nevada, Las Vegas, United States of America
1 shared publication - Andrew Myers
Lawrence Berkeley National Laboratory
1 shared publication
Latest Publications
- Open Access
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 35-46
Devastator: A Scalable Parallel Discrete Event Simulation Framework for Modern C++
Parallel discrete event simulation is a fundamental simulation technology that is essential to the parallelization of event-based models including hardware and transportation systems. Parallelization is often difficult due to dynamic data-dependencies and limited computational work for hiding runtime overheads. We present Devastator, a scalable parallel discrete event simulation framework for modern C++. Devastator provides a productive API that leverages C++’s type system to eliminate boilerplate code. Devastator has been designed to specifically optimize performance on distributed many-core architectures with deepening memory hierarchies. Devastator relies on the GASNet-Ex communication runtime as well as lock-free message queues to achieve highly competitive performance. We perform strong and weak scaling studies on NERSC’s Perlmutter up to 32,698 cores and demonstrate an up to 5x speed-up over the ROSS simulator for workloads with substantial locality.
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 35-46
Open AccessDevastator: A Scalable Parallel Discrete Event Simulation Framework for Modern C++
Parallel discrete event simulation is a fundamental simulation technology that is essential to the parallelization of event-based models including hardware and transportation systems. Parallelization is often difficult due to dynamic data-dependencies and limited computational work for hiding runtime overheads. We present Devastator, a scalable parallel discrete event simulation framework for modern C++. Devastator provides a productive API that leverages C++’s type system to eliminate boilerplate code. Devastator has been designed to specifically optimize performance on distributed many-core architectures with deepening memory hierarchies. Devastator relies on the GASNet-Ex communication runtime as well as lock-free message queues to achieve highly competitive performance. We perform strong and weak scaling studies on NERSC’s Perlmutter up to 32,698 cores and demonstrate an up to 5x speed-up over the ROSS simulator for workloads with substantial locality.
- Open Access
- 7 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 132-141
Fast Parallel Index Construction for Efficient K-truss-based Local Community Detection in Large Graphs
- 7 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 132-141
Open AccessFast Parallel Index Construction for Efficient K-truss-based Local Community Detection in Large Graphs
- Open Access
- 28 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 33 (1-2) , 1-29
Simulating the Impact of Dynamic Rerouting on Metropolitan-scale Traffic Systems
The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this article, we describe enhancements to the Mobiliti parallel traffic simulator to model dynamic rerouting behavior with the addition of vehicle controller actors and vehicle-to-controller reroute requests. The simulator is designed to support distributed-memory parallel execution using discrete event simulation and be scalable on high-performance computing platforms. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day in the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present a sensitivity study on the dynamic rerouting parameters, discuss the simulator’s parallel scalability, and analyze system-level impacts of changing the dynamic rerouting penetration. Furthermore, we examine the varying effects on different functional classes and geographical regions and present a validation of the simulation results compared to real-world data.
- 28 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 33 (1-2) , 1-29
Open AccessSimulating the Impact of Dynamic Rerouting on Metropolitan-scale Traffic Systems
The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this article, we describe enhancements to the Mobiliti parallel traffic simulator to model dynamic rerouting behavior with the addition of vehicle controller actors and vehicle-to-controller reroute requests. The simulator is designed to support distributed-memory parallel execution using discrete event simulation and be scalable on high-performance computing platforms. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day in the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present a sensitivity study on the dynamic rerouting parameters, discuss the simulator’s parallel scalability, and analyze system-level impacts of changing the dynamic rerouting penetration. Furthermore, we examine the varying effects on different functional classes and geographical regions and present a validation of the simulation results compared to real-world data.
- Open Access
- 31 October 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 32 (4) , 1-30
Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws
Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.
- 31 October 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 32 (4) , 1-30
Open AccessPerformance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws
Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.
- Open Access
- 16 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 19 (4) , 1-24
ASA: A ccelerating S parse A ccumulation in Column-wise SpGEMM
Sparse linear algebra is an important kernel in many different applications. Among various sparse general matrix-matrix multiplication (SpGEMM) algorithms, Gustavson’s column-wise SpGEMM has good locality when reading input matrix and can be easily parallelized by distributing the computation of different columns of an output matrix to different processors. However, the sparse accumulation (SPA) step in column-wise SpGEMM, which merges partial sums from each of the multiplications by the row indices, is still a performance bottleneck. The state-of-the-art software implementation uses a hash table for partial sum search in the SPA, which makes SPA the largest contributor to the execution time of SpGEMM. There are three reasons that cause the SPA to become the bottleneck: (1) hash probing requires data-dependent branches that are difficult for a branch predictor to predict correctly; (2) the accumulation of partial sum is dependent on the results of the hash probing, which makes it difficult to hide the hash probing latency; and (3) hash collision requires time-consuming linear search and optimizations to reduce these collisions require an accurate estimation of the number of non-zeros in each column of the output matrix. This work proposes ASA architecture to accelerate the SPA. ASA overcomes the challenges of SPA by (1) executing the partial sum search and accumulate with a single instruction through ISA extension to eliminate data-dependent branches in hash probing, (2) using a dedicated on-chip cache to perform the search and accumulation in a pipelined fashion, (3) relying on the parallel search capability of a set-associative cache to reduce search latency, and (4) delaying the merging of overflowed entries. As a result, ASA achieves an average of 2.25× and 5.05× speedup as compared to the state-of-the-art software implementation of a Markov clustering application and its SpGEMM kernel, respectively. As compared to a state-of-the-art hashing accelerator design, ASA achieves an average of 1.95× speedup in the SpGEMM kernel.
- 16 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 19 (4) , 1-24
Open AccessASA: A ccelerating S parse A ccumulation in Column-wise SpGEMM
Sparse linear algebra is an important kernel in many different applications. Among various sparse general matrix-matrix multiplication (SpGEMM) algorithms, Gustavson’s column-wise SpGEMM has good locality when reading input matrix and can be easily parallelized by distributing the computation of different columns of an output matrix to different processors. However, the sparse accumulation (SPA) step in column-wise SpGEMM, which merges partial sums from each of the multiplications by the row indices, is still a performance bottleneck. The state-of-the-art software implementation uses a hash table for partial sum search in the SPA, which makes SPA the largest contributor to the execution time of SpGEMM. There are three reasons that cause the SPA to become the bottleneck: (1) hash probing requires data-dependent branches that are difficult for a branch predictor to predict correctly; (2) the accumulation of partial sum is dependent on the results of the hash probing, which makes it difficult to hide the hash probing latency; and (3) hash collision requires time-consuming linear search and optimizations to reduce these collisions require an accurate estimation of the number of non-zeros in each column of the output matrix. This work proposes ASA architecture to accelerate the SPA. ASA overcomes the challenges of SPA by (1) executing the partial sum search and accumulate with a single instruction through ISA extension to eliminate data-dependent branches in hash probing, (2) using a dedicated on-chip cache to perform the search and accumulation in a pipelined fashion, (3) relying on the parallel search capability of a set-associative cache to reduce search latency, and (4) delaying the merging of overflowed entries. As a result, ASA achieves an average of 2.25× and 5.05× speedup as compared to the state-of-the-art software implementation of a Markov clustering application and its SpGEMM kernel, respectively. As compared to a state-of-the-art hashing accelerator design, ASA achieves an average of 1.95× speedup in the SpGEMM kernel.
- Open Access
- 15 June 2022
- Published by American Association for Cancer Research (AACR) in Cancer Research
- Vol. 82 (12_Supplem) , 5266
Abstract 5266: Prognostic role of molecular subclassification based on mutational profiling and tumor-associated neutrophil status in stage III colon cancer
The traditional prognostic prediction of colon cancer (CC) is based on the tumor-node-metastasis (TNM) system. This, however, is not adequate for clinical decision making due to the existence of inter-patient variations and heterogeneity of underlying molecular pathways. We aim to investigate the prognostic value of molecular subclassification utilizing i) tumor-associated neutrophil (TAN) status by immunohistochemical (IHC) staining; ii) microsatellite instability (MSI) and elevated microsatellite alteration at selected tetranucleotide repeats (EMAST) status by PCR-based microsatellite typing; and iii) next-generation sequencing (NGS) mutational profiling by deep sequencing of a 77-gene oncology panel. In the discovery phase, 130 pairs of archived normal and tumor formalin-fixed paraffin-embedded (FFPE) specimens of stage III CC patients were retrospectively recruited from Queen Mary Hospital. CC patients will be categorized into different molecular subclasses (MSCs) based on the status of TAN/MSI/EMAST/NGS mutational profiling molecular biomarkers. Kaplan-Meier analysis, log rank test, univariate and multivariate Cox proportional hazards regression analysis will be used for estimation of progression-free survival (PFS) and overall survival (OS) between the two groups of CC patients. We expect our data to provide useful information for improved stratification of stage III CC patients into high or low risk of recurrence and survival. Acknowledgement: The Health and Medical Research Fund (07181536) to JMYK. Citation Format: CY Chan, AWI Lo, KO Lam, HY Ng, CC Chen, ML Lung, JMY Ko. Prognostic role of molecular subclassification based on mutational profiling and tumor-associated neutrophil status in stage III colon cancer [abstract]. In: Proceedings of the American Association for Cancer Research Annual Meeting 2022; 2022 Apr 8-13. Philadelphia (PA): AACR; Cancer Res 2022;82(12_Suppl):Abstract nr 5266.
- 15 June 2022
- Published by American Association for Cancer Research (AACR) in Cancer Research
- Vol. 82 (12_Supplem) , 5266
Open AccessAbstract 5266: Prognostic role of molecular subclassification based on mutational profiling and tumor-associated neutrophil status in stage III colon cancer
The traditional prognostic prediction of colon cancer (CC) is based on the tumor-node-metastasis (TNM) system. This, however, is not adequate for clinical decision making due to the existence of inter-patient variations and heterogeneity of underlying molecular pathways. We aim to investigate the prognostic value of molecular subclassification utilizing i) tumor-associated neutrophil (TAN) status by immunohistochemical (IHC) staining; ii) microsatellite instability (MSI) and elevated microsatellite alteration at selected tetranucleotide repeats (EMAST) status by PCR-based microsatellite typing; and iii) next-generation sequencing (NGS) mutational profiling by deep sequencing of a 77-gene oncology panel. In the discovery phase, 130 pairs of archived normal and tumor formalin-fixed paraffin-embedded (FFPE) specimens of stage III CC patients were retrospectively recruited from Queen Mary Hospital. CC patients will be categorized into different molecular subclasses (MSCs) based on the status of TAN/MSI/EMAST/NGS mutational profiling molecular biomarkers. Kaplan-Meier analysis, log rank test, univariate and multivariate Cox proportional hazards regression analysis will be used for estimation of progression-free survival (PFS) and overall survival (OS) between the two groups of CC patients. We expect our data to provide useful information for improved stratification of stage III CC patients into high or low risk of recurrence and survival. Acknowledgement: The Health and Medical Research Fund (07181536) to JMYK. Citation Format: CY Chan, AWI Lo, KO Lam, HY Ng, CC Chen, ML Lung, JMY Ko. Prognostic role of molecular subclassification based on mutational profiling and tumor-associated neutrophil status in stage III colon cancer [abstract]. In: Proceedings of the American Association for Cancer Research Annual Meeting 2022; 2022 Apr 8-13. Philadelphia (PA): AACR; Cancer Res 2022;82(12_Suppl):Abstract nr 5266.
- Top Cited PapersOpen Access
- 12 May 2019
- Published by The Open Journal in Journal of Open Source Software
- Vol. 4 (37)
AMReX: a framework for block-structured adaptive mesh refinement
- 12 May 2019
- Published by The Open Journal in Journal of Open Source Software
- Vol. 4 (37)
Top Cited PapersOpen AccessAMReX: a framework for block-structured adaptive mesh refinement