Home Latest Articles
Latest Articles
  • Yupeng Wu, Hong Qian, Weiye Wang, Yangwenhui Zhang, Aimin Zhou
    Journal of Computer Research and Development. 2025, 62(2): 458-471.

    Multi-objective security games (MOSGs) aim to simultaneously optimize the defender’s payoff against multiple heterogeneous attackers, which is of great importance in practical applications. Recently, the space discretization based evolutionary search (SDES) framework has been proposed to transform the constrained high-dimensional step function optimization problem in MOSG into a low-dimensional combinatorial optimization problem and to solve the combinatorial optimization task using a greedy strategy. Although SDES can address large-scale MOSG tasks in time, it is difficult for SDES to converge to the optimal Pareto front, especially in the large-scale scenario. On the one hand, the convergence assumption of the greedy strategy of SDES becomes difficult to be satisfied with the scale of MOSG tasks. On the other hand, SDES uses multiple number of stage components, including spatial discretization, evolutionary optimization, evaluation, and refinement components. This poses a risk of stage coupling, where upstream components’ optimization quality directly affects downstream components’ performance. To address these issues, we exploit and utilize the priority prior of the protected targets in MOSG task to improve the quality of solutions and simplify the SDES framework, resulting in the SDES-P framework. SDES-P redesigns the evaluation component, which is the core component of SDES, and removes the refinement component. Specifically, SDES-P starts from the infeasible solution with the maximum resources. Then, SDES-P divides the protected targets into two groups based on the priority prior, and the higher-priority group gradually releases resources to find feasible solutions. Finally, SDES-P contains an evolutionary local search strategy combined with priority prior knowledge to enhance the quality of the final Pareto front. We reveal that SDES-P can maintain the advantages of low sample complexity and strong scalability of SDES, and the experimental results show that regardless of whether the convergence assumption is satisfied, SDES-P can find high-quality Pareto fronts with better convergence and diversity compared with SDES.

  • Xiaojian Zhang, Leilei Zhang, Zhizheng Zhang
    Journal of Computer Research and Development. 2025, 62(2): 472-487.

    Federated learning with user-level local differential privacy (ULDP) has attracted considerable research attention in recent years. The trade-off among federated data types, the mechanism of clipping local updates, the allocation of privacy budget, and user dropout directly constrain the accuracy of the global learning model. All existing federated learning methods are vulnerable to handling these problems. To remedy the deficiency caused by the current methods, we employ ULDP to propose an efficient algorithm, called ULDP-FED, to achieve global federated optimization. ULDP-FED can simultaneously handle IID and non-IID federated data types. Compared with those methods with fixed clipping thresholds, ULDP-FED uses a threshold dynamic decay strategy to balance the noise error caused by the Gauss mechanism and the bias caused by update clipping. To allocate the privacy budget of each user carefully, in each round, ULDP-FED relies on the similarity to replace the current local update with the historical noise updates. If the historical updates are obtainted, the user only sends the index of the historical update to the server, which can reduce the communication cost. ULDP-FED is compared with existing methods over MNIST and CIFAR 10 datasets. The experimental results show that our algorithm outperforms its competitors, and achieves the accurate results of federated learning.

  • Naizheng Jia, Can Xue, Liu Yang, Zhi Wang
    Journal of Computer Research and Development. 2025, 62(2): 488-502.

    Recent economic advancements have significantly supported the popularity of indoor positioning systems (IPS) and indoor localization-based services (ILBS). This trend is particularly obvious as global navigation satellite systems (GNSS) are ineffective in indoor environments. Traditional IPS, such as WIFI and Bluetooth positioning, face challenges like low accuracy and are prone to non-line-of-sight (NLOS) and noise interference. In response to this issue, we propose a novel near-ultrasonic robust indoor localization method based on the stacking ensemble model. Initially, the method employs an optimized enhanced cross-correlation technique to effectively mitigate multipath interference in acoustic ranging. Compared with the conventional methods based on peak extraction or fixed thresholding, this approach significantly improves ranging accuracy in reverberant environments. Subsequently, time difference of arrival (TDOA) is extracted as a feature. Finally, we utilize a stacking ensemble learning model, incorporating optimized machine learning models, to train a pre-set dataset. This method, integrating the extracted feature, enables to achieve correct localization results in NLOS and large ranging error. Numerical simulations, ray-tracing acoustic analyses, and empirical validations suggest that our approach notably mitigates errors prevalent in NLOS and acoustically noisy indoor environments and yielding localization accuracy significantly exceeds current methods by 50%−90%. The core dataset available at https://github.com/ChirsJia/JSJYF.

  • Wei Li, Guanghui Li, Qinglin Zhao, Chenglong Dai, Si Chen
    Journal of Computer Research and Development. 2025, 62(2): 503-516.

    Serverless computing provides developers a cloud computing paradigm, which does not require that developers focus on the server operation and hardware resource management in the context of the popularity of container technology and micro-service framework. At the same time, serverless computing can adapt to dynamic load changes in real time through elastic expansion and contraction, which can effectively reduce the request response delay and the service cost, and meet the customer’s demand for pay-as-you-go cloud service expense. However, serverless computing faces the issue of cold start delay caused by the demand for elastic expansion and contraction. Creating the instances of warm-up function in advance can reduce the frequency and delay of cold start effectively. Nevertheless, the traffic burst problem in the cloud environment greatly increases the difficulty of predicting the number of warm-up function instances. To solve the above-mentioned challenges, a probability distribution based auto-scaling algorithm (PDBAA) is proposed. By using the historical data of monitoring indicators to predict the probability distribution of future requests, the optimal number of warm-up function instances is calculated for minimizing the request response delay. PDBAA can effectively combine the powerful prediction capability of deep learning technology to further improve performance. Under the Knative framework, the performance of PDBAA is verified by NASA and WSAL datasets. The simulation results show that, compared with the Knative auto-scaling algorithm and other prediction algorithms, PDBAA improves the elastic performance by over 31%, and reduces the average response time by over 16%, which can better solve the traffic burst problem, and effectively reduce the response delay of serverless computing requests.

  • Rongyuan Guo, Haipeng Jia, Yunquan Zhang, Cunyang Wei, Mingsen Deng, Jingrui Chen, Zhenya Zhou
    Journal of Computer Research and Development. 2025, 62(2): 517-531.

    TRSM (triangular matrix equation solver) is a commonly used algorithm for solving systems of linear equations, and is the core algorithm of various scientific computing libraries and mathematical software, which is widely used in the fields of scientific computing, engineering computing and machine learning. The small-scale irregular TRSM algorithm limits the scope of problem-solving and is an algorithm for efficiently handling smaller-scale, irregular data inputs. With the development of personalization and refinement in the field of high-performance computing, the demand for small-scale irregular TRSM computation in the scientific and industrial communities is becoming more and more obvious. While traditional algorithms are better suited for large-scale and regular TRSM computation, there is still room for improvement in the computational efficiency of small-scale and irregular TRSM. In this paper, we propose a small-scale irregular TRSM optimization scheme by combining hardware architecture and application scenario characteristics, designing a high-performance kernel from the perspectives of register chunking, boundary processing, and vectorization computation, and constructing an algorithmic library of small-scale irregular SI_TRSM (small-scale irregular TRSM) covering double-precision real numbers and double-precision complex numbers based on which the performance of this algorithm is greatly improved. Based on experimental results, the double-precision small-scale irregular TRSM algorithm library developed in this paper has shown to enhance the average performance of double-precision small-scale irregular real numbers by 29.4 times, and double-precision small-scale irregular complex numbers by 24.6 times in comparison with similar algorithms available in the MKL (Intel math kernel library).

  • Guilin Chen, Guanwu Wang, Kang Wang, Minhui Hu, Junquan Deng
    Journal of Computer Research and Development. 2025, 62(2): 532-541.

    Convolutional neural network (CNN) has become one of the most important machine learning technologies in the field of image recognition. In recent years, with the increasing demand for CNN deployment at the mobile edge, the lightweight of CNN has become a research hotspot. The mainstream CNN lightweight methods include pruning and quantization, both of which can effectively reduce the calculation and storage overhead for CNN inference. However, none of these methods fully exploits the bilateral sparsity (weight sparsity and activation sparsity) and potential data-reuse in CNN. Therefore, in order to solve these problems, we propose a new neural network lightweight method, and the k-means algorithm is used to cluster the non-zero values of convolution kernel and feature map, and the CNN inference only uses limited cluster values as multipliers to complete all convolutional calculations. Compared with the computational complexity of original convolutional layer $ O({n}^{3}) $, the computational complexity of the convolutional layer after lightweight is $ O({n}^{2}) $, effectively reducing the amount of computation. Similarly, the non-zero weights of the fully connected layer are also clustered, and only the cluster values and corresponding index vectors are stored on chip, which significantly reduces the storage overhead. Finally, a customized architecture KCNN is designed for this lightweight method. The architecture modularizes the different processes of the CNN, and compared with the previous accelerator, a non-zero clustering module is added. In addition, some caches are added to make use of the data-reuse in the CNN after clustering. The experiment results show that without losing the derivation accuracy, the overall calculation of AlexNet network is reduced by 66%, and the storage expense is reduced by 85%.

  • Sidi Lu, Yuankai He, Weisong Shi
    Journal of Computer Research and Development. 2025, 62(1): 2-21.

    With rapid advancements in edge computing, sensing, AI, and communication technologies, vehicles are undergoing an unprecedented transformation. We introduce a new computing paradigm for the autonomous driving era—vehicle computing. In this paradigm, data and control layers are separated, creating an open computing platform that supports multi-party collaboration and data sharing, breaking away from the limitations of traditional, closed vehicle systems. This paradigm enables vehicles to transcend conventional transportation roles, evolving into versatile mobile computing platforms that support a wide range of advanced applications and third-party services. We define the core concepts of vehicle computing, analyze the revolutionary evolution of software and computing architectures within vehicles, and present promising application examples, as well as a novel business model enabled by this paradigm. The five core functionalities of vehicle computing, i.e., computation, communication, energy management, sensing, and data storage, and their related cutting-edge technologies are thoroughly explored. We conclude by discussing key technical challenges and promising opportunities within vehicle computing, aiming to inspire further academic and industry research in this innovative field.

  • Duo Wang, Jinglei Liu, Mingyu Yan, Yihan Teng, Dengke Han, Xiaochun Ye, Dongrui Fan
    Journal of Computer Research and Development. 2025, 62(1): 22-57.

    Central processing unit is the most important computing infrastructure nowadays. To maximize the profit, architects design the processor microarchitecture by trading-off multiple objectives including performance, power, and area. However, because of the tremendous instructions of workloads running on the processors, the evaluation of individual microarchitecture design point costs minutes to hours. Furthermore, the design space of the microarchitecture is huge, which results that the exploration of comprehensive design space is unrealistic. Therefore, many machine-learning-assisted design space exploration acceleration methods are proposed to reduce the size of evaluated design space or accelerate the evaluation of a design point. However, a comprehensive survey summarizing and systematically classifying recent acceleration methods is missing. This survey paper systematically summarizes and classifies the five kinds of acceleration methods for the design space exploration of the processor microarchitecture, including the workload selection of software design space, the partial simulation of workload instructions, the design point selection, the simulation tools, and the performance models. This paper systematically compares the similarities and differences between papers in the acceleration methods, and covers the complete exploration process from the software workload selection to the hardware microarchitecture design. Finally, the research direction is summarized, and the future development trend is discussed.

  • Lihua Yang, Yong Dong, Huijun Wu, Zhipeng Tan, Fang Wang, Kai Lu
    Journal of Computer Research and Development. 2025, 62(1): 58-74.

    NAND flash is widely utilized in mobile devices due to its excellent characteristics, including large capacity, light weight, and shock resistance. The flash friendly file system (F2FS), designed for flash features, is a typical log-structured file system (LFS). It employs a log-structured write mechanism to enhance random write performance, utilizes roll-forward recovery technology for fast consistency protection, and is commonly used as a file system for mobile devices. However, the performance of file system is impacted by fragmentation and segment cleaning. The out-of-place update mechanism of LFS and the small write mode of high-concurrency and random synchronization of mobile applications exacerbate fragmentation, leading to sluggish I/O request responses and device operation freezes. We initially introduce the relevant concepts and content of log-structured file systems in mobile devices. We then primarily outline the research status of fragmentation and segment cleaning of LFS. Firstly, we analyze the generation and impact of fragmentation, summarize the research work on reducing fragments from the perspectives of preventing fragments and reorganizing fragments. Secondly, we examine the impact of the mixed storage of hot and cold data on segment cleaning. Additionally, we summarize the research status of distinguishing hot and cold data from static and dynamic classification, and segment cleaning from the perspectives of managing data distribution and adjusting the timing, frequency, and objects of segment cleaning. Finally, we outline the main challenges and future research prospects of log-structured file systems in mobile devices.

  • Dunbo Zhang, Lingling Zeng, Ruoxi Wang, Yaohua Wang, Li Shen
    Journal of Computer Research and Development. 2025, 62(1): 75-89.

    While vector processing unit is widely employed in processors for neural networks, signal processing, and high performance computing, it suffers from expensive shuffle operations dedicated to data alignment. Traditionally, processors handle shuffle operations with its data shuffle unit. However, data shuffle unit will introduce expensive overhead of data movement and only can shuffle data in serial. In fact, shuffle operations only change the layout of data and ideally should be done entirely within memory. Nowadays, SRAM is no longer just a storage component, but also as a computing unit. To this end, we propose Shuffle-SRAM in this paper, and Shuffle-SRAM can shuffle multiple data elements simultaneously bit by bit within an SRAM bank. The key idea is to exploit the bit-line wise data movement ability in SRAM so as to shuffle multiple data in parallel, where all the bits of different data elements on the same bit-line of SRAM can be shuffled simultaneously, achieving a high level of parallelism. Through suitable data layout preparation and the vector shuffle extension instructions, Shuffle-SRAM efficiently supports a wide range of commonly used shuffle operations efficiently. Our evaluation results show that Shuffle-SRAM can achieve a performance gain of 28 times for commonly used shuffle operations and 3.18 times for real world applications including FFT, AlexNet, and VggNet. The SRAM area overhead only increases by 4.4%.