DCDa-Wei Chang

Da-Wei Chang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Da-Wei Chang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Alleviating Congestion Attacks on Traffic Signal Systems

    by Tsung-Lin Tsai, Shao-Hua Wang, Chun-Ting Wu, Ting-Yu Lin, Chia-Heng Tu, Meng-Hsun Tsai, Wei-Hsun Lee, Da-Wei Chang

    This work addresses congestion attacks on prioritization and preemption signal applications (PPSA), an important variant of cooperative intelligent transport systems (C-ITS). In PPSA, priority vehicles, such as buses and ambulances, can request traffic signal adjustments in their favor to reduce travel time. These systems rely on vehicle-to-everything (V2X) communications, which makes them vulnerable to congestion attacks. When under attack, these systems experience disruptions in information exchange between vehicles and infrastructure, leading to traffic congestion and safety hazards. Nevertheless, existing solutions do not address the attacks at a system level and within the PPSA context. Our proposal presents a software framework designed to enhance both sustainability and safety during congestion attacks. Specifically, it introduces a whitelist-based traffic-filtering mechanism that preserves system sustainability by ensuring only legitimate priority requests are processed. Additionally, a monitoring mechanism evaluates the PPSA service rate at runtime to identify and address potential safety risks arising from insufficient service rates. Moreover, we analyze the limitations of a machine learning-based defense method and highlight risks of potential service unavailability due to false positives. We believe that this research contributes to the development of a secure and safe traffic management system for smart cities.

  • Open Access

    PIM or CXL-PIM? Understanding Architectural Trade-offs Through Large-Scale Benchmarking

    by I-Ting Lee, Bao-Kai Wang, Liang-Chi Chen, Wen Sheng Lim, Da-Wei Chang, Yu-Ming Chang, Chieng-Chung Ho

    Processing-in-memory (PIM) reduces data movement by executing near memory, but our large-scale characterization on real PIM hardware shows that end-to-end performance is often limited by disjoint host and device address spaces that force explicit staging transfers. In contrast, CXL-PIM provides a unified address space and cache-coherent access at the cost of higher access latency. These opposing interface models create workload-dependent tradeoffs that are not captured by small-scale studies. This work presents a side-by-side, large-scale comparison of PIM and CXL-PIM using measurements from real PIM hardware and trace-driven CXL modeling. We identify when unified-address access amortizes link latency enough to overcome transfer bottlenecks, and when tightly coupled PIM remains preferable. Our results reveal phase- and dataset-size regimes in which the relative ranking between the two architectures reverses, offering practical guidance for future near-memory system design.

  • A Hardware Friendly Variation-Tolerant Framework for RRAM-Based Neuromorphic Computing

    by Fang-Yi Gu, Cheng-Han Yang, Ing-Chao Lin, Da-Wei Chang, Darsen D. Lu, Ulf Schlichtmann

    Emerging resistive random access memory (RRAM) attracts considerable interest in computing-in-memory by its high efficiency in multiply-accumulate operation, which is the key computation in the neural network (NN). However, due to the imperfect fabrication, RRAM cells suffer from the variations, which make the values in RRAM cells deviate from the target values so that the accuracy of the RRAM-based NN accelerator degrades significantly. Moreover, in a practical hardware design of RRAM-based NN accelerators, if the number of wordlines and bitlines in a crossbar array activated at the same time increases, ADCs with a high resolution are required and the power consumption of ADC increases. This paper proposes a novel methodology to mitigate the impact of variations in RRAM-based neural network accelerators. The methodology includes a unary-based non-uniform quantization method and a variation-aware operation unit (OU) based framework. The unary-based non-uniform quantization method equalizes the significance of weights stored in each RRAM cell to reduce the impact of variations. The variation-aware OU-based framework activates only RRAM cells in the same OU at the same time, which reduces the power consumption of ADCs. Additionally, the framework introduces three methods, including OU skipping, OU recombination, and OU compensation, to further mitigate the impact of variations. The experiments show that the proposed approach outperforms the state-of-the-art among four NN models on two datasets with 2-bit cell resolution.


  • Open Access

    A New Readahead Framework for SSD-based Caching Storage in IoT Systems

    by Hsung-Pin Chang, Wei-Ming Su, Da-Wei Chang

    In an IoT system, the sheer volume of data generated by numerous sensing devices necessitates a well-designed scheme for storing and retrieving data efficiently, enabling streamlined data processing and analytics. One promising storage architecture involves utilizing solid-state drives (SSDs) to cache data from hard disk drives (HDDs), thereby creating an SSD-based caching storage system. To further enhance access performance, it is possible to employ readahead techniques to minimize data access latency. However, the existing Linux readahead scheme falls short in fully leveraging SSD-based caching storage systems. We address this limitation by introducing a novel cross-layered readahead architecture that effectively communicates with the VFS layer, the file system layer, and the block I/O layer. This communication facilitates the acquisition of readahead timing, readahead data continuity, and readahead data location, respectively. To guide prefetching decisions, our architecture analyzes the degree of data access sequentiality, the performance model of the target storage device, and the access patterns of the I/O workload on the corresponding storage device. The implementation of this new architecture in the Linux kernel yields promising experimental results, demonstrating its robustness by consistently outperforming the stock Linux kernel. Notably, our architecture reduces the total execution time of the stock Linux kernel by up to 49%, except in cases of random workloads where both the stock Linux kernel and our architecture exhibit similar performance.

  • Infection-Based Dead Page Prediction in Hybrid Memory Architecture

    by Ing-Chao Lin, Da-Wei Chang, Chen-Tai Kao, Sheng-Xuan Lin

    With the widespread use of cloud computing and the Internet, applications that require a large memory footprint, such as in-memory databases, have gained in popularity. These applications depend on a high capacity, reliable memory architecture. To achieve these two goals, hybrid memory that uses both DRAM and nonvolatile memory (NVM) provides benefits that include large capacity and nonvolatility. However, NVM is usually accompanied by high write latency and endurance problems. It is important to reduce NVM writes and improve the latency and lifetime of hybrid memory. One way to reduce NVM writes is to reduce dead pages that occupy DRAM and have not been accessed for a long time. When dead pages are removed from the memory, more space can be reserved for frequently accessed data, reducing DRAM misses and NVM writes. Currently, there are several dead block prediction techniques that can identify dead blocks and reduce miss rates at the cache level. However, they are not effective at the memory level because CPU memory accesses exhibit less locality when accesses are filtered by caches. To propose an application that is suitable at the memory level and to achieve a reduction in NVM writes, this paper proposes a simple but effective dead page predictor, called the infection-based dead page predictor (IDP), for the memory level. IDP uses the access counts of evicted pages to determine if nearby pages are also dead pages (i.e., other pages are infected by evicted pages). The simulation results show that compared to related work, the proposed predictor significantly reduces DRAM misses and enhances lifetime.


  • Global Clean Page First Replacement and Index-Aware Multistream Prefetcher in Hybrid Memory Architecture

    by Ing-Chao Lin, Da-Wei Chang, Wei-Jun Chen, Jian-Ting Ke, Po-Han Huang

    As cloud computing and big data applications become more popular, the demand for large capacity memory and data preservation in memory increases. Therefore, non-volatile memory (NVM) with high capacity is being actively developed. A hybrid memory that comprises both NVM and DRAM and provides both high access speed and non-volatility has become a major trend. However, compared to DRAM, NVM in the hybrid memory typically suffers from a shorter lifetime and higher latency. To improve the lifetime and address the latency issues associated with hybrid memory, we propose a Global Clean Page First replacement (GCPF) to reduce the write operations to NVM. We also propose an index-aware multi-stream prefetcher (IAMSP) that considers the indexes of prefetch candidates individually so as to prefetch pages from NVM more accurately. Benchmarks with a large memory footprint are used to evaluate the proposed schemes. The experimental results show that GCPF enhances lifetime by 56.8% as compared to LRU, on average. When applying prefetching schemes on GCPF, the lifetime is insignificantly degraded. In addition, IAMSP reduces DRAM misses by 42.0% as compared to LRU, while a modern prefetcher that can change the prefetch degree dynamically only reduces DRAM misses by 38.0%, on average. When applying both GCPF and IAMSP, the average access latency can be reduced by 28.8% as compared to LRU.


  • TAP: Reducing the Energy of Asymmetric Hybrid Last-Level Cache via Thrashing Aware Placement and Migration

    by Jing-Yuan Luo, Hsiang-Yun Cheng, Ing-Chao Lin, Da-Wei Chang, Chien-Lun Lo

    Emerging non-volatile memories (NVMs) have favorable properties, such as low leakage and high density, and have attracted a lot of attention in recent years. Among them, spin-transfer torque magnetoresistive random access memory (STT-MRAM) with SRAMcomparable read speed is a good candidate to build large last-level caches (LLCs). However, STT-MRAM suffers from long write latency and high write energy. To mitigate the impact of asymmetric read/write energy and latency, hybrid cache designs have been proposed to combine the merits of STT-MRAM and SRAM. In such a hybrid SRAM/STTMRAM LLC, intelligent block placement and migration policies are needed to improve the energy efficiency. Prior studies map writeintensive blocks to SRAM and keep reading intensive blocks in STTMRAM for reducing the energy consumption of hybrid LLCs. The writeintensive/ read-intensive blocks are usually captured by sampling the address (PC) of memory access instructions or adding simple access counters in each cache line. Nevertheless, these prior approaches cannot fully capture the energy-harmful access behavior in STT-MRAM, especially the writes caused by repetitive data transfer between the LLC and upper-level caches. In this paper, we find that conflict misses in L2 often generate thrashing blocks which move back and forth between L2 and LLC. If dirty thrashing blocks that incur extensive writes are placed in STTMRAM, energy consumption would excessively increase, especially when running memory-bound workloads. Thus, we propose a thrashing aware placement and migration policy (TAP) to tackle the challenge. TAP places dirty thrashing blocks into SRAM and migrates clean thrashing blocks from SRAM to STT-MRAM. Evaluation results show that TAP can provide significant energy savings with minimal performance loss.


  • ROHOM: Requirement-aware Online Hybrid On-chip Memory Management for Multicore Systems

    by Da-Wei Chang, Ing-Chao Lin, Lin-Chun Yong

    Many studies have shown that energy consumption of on-chip memory is a critical issue for multicore embedded systems. In order to reduce energy consumption, scratchpad memory (SPM), a software controlled on-chip memory, has been increasingly used. In a typical multicore embedded system that uses SPM in the on-chip memory, each core has local SPM and can access data in both local SPM and SPMs of other cores (i.e., remote SPM). Since the latency and energy of accessing remote SPMs is higher than accessing local SPM, how data are allocated in local and remote SPMs influences the performance and energy consumption of the system. This paper proposes a requirement-aware online hybrid on-chip memory management (ROHOM) method. This method contains an SPM supervisor that determines the SPM allocation of each task according to the dynamic access behavior and SPM requirements of the task. In addition, two policies: 1) free remote SPM space first and 2) get local SPM space first, are proposed in ROHOM to reduce the access frequency of remote SPMs. The experimental results show ROHOM can reduce energy delay product up to 69% (42% on average) in an 8-core system and up to 69% (50% on average) in a 16-core system when compared to a contention aware SPM allocation method. The hardware area overhead is insignificant (about 1.8%).