Home Latest Articles
Latest Articles
  • Weiqi Dai, Ming Li, Kexuan Zhao, Wenchao Jiang, Weilin Zhou, Deqing Zou, Hai Jin
    Journal of Computer Research and Development. 2025, 62(1): 269-280.

    In the era of big data e-commerce, data trading can enable collaborative sharing and value utilization of isolated data resources. As the main form of data trading in e-commerce business, marketing tags have enormous potential value. However, the traditional data trading market faces three main problems: 1) The opaque information of the centralized platform leads to trust crisis and malicious bidding ranking; 2) Lack of reasonable incentive mechanism to break the data island leads to data non-circulation and sharing difficulties; 3) Data security threats lead to privacy disclosure and data reselling and theft. In order to solve these problems, a blockchain marketing label trading mechanism for e-commerce alliance is designed, and the upper consensus incentive mechanism is designed based on decentralization, and all data transactions and computing businesses of the system are completed in combination with the trusted execution environment, thus realizing a safe and complete data transaction ecosystem. The authenticity verification mechanism is designed to ensure the effectiveness of marketing labels, the consensus incentive mechanism is designed to enable users to actively share data, and the smart contract is used to effectively constrain the role behavior according to the system design specification; Then key transmission and data security storage are realized through SGX remote authentication, and smart contract security call is realized to ensure user privacy and data security; Finally, the reliable delivery of data transaction results is realized through the trusted computer system and system design idea. In order to verify the security and practicability of the system, 350000 pieces of real data provided by an e-commerce company are used for performance testing. The test results show that the system can guarantee the security and performance requirements at the same time, and its additional costs mainly come from the remote authentication module and are within the acceptable range.

  • Zhang Zhang, Gang Shi, Qifan Wang, Yongbo Ma, Gang Liu, Libo Qian
    Journal of Computer Research and Development. 2024, 61(12): 2937-2951.

    The fast and low-power in-memory computing architecture, which integrates memory and calculation, breaks through the traditional von-Neumann system that separates memory and calculation, and solves the problem of “memory wall” that limits the arithmetic power of the processor, which has become a research hotspot of new computing architecture. The basic devices for in-memory computing include fast and mature static random access memory (SRAM), low power, fast response and non-volatile memristor, and high density, low static power and non-volatile magnetic random access memory (MRAM). Up to the present, a great variety of in-memory computing studies have been proposed based on these devices, however, a systematic and comprehensive literature review on these in-memory computing architectures is still missing. In this paper, we firstly introduce the in-memory computing principles of different devices, the current development status of in-memory computing architectures, and the practical application scenarios from the three directions of SRAM, memristor, and MRAM. Next, the existing solutions and the future directions for the problems and challenges of current in-memory computing architectures are given. Finally, we summarize the research focus of in-memory computing based on the above devices, outline the shortcomings of the current research, and look forward to the future development direction.

  • Tao Li, Hui Yang, Junnan Li, Rulin Liu, Zhigang Sun
    Journal of Computer Research and Development. 2024, 61(12): 2952-2968.

    In order to meet different requirements of performance, flexibility and quality of service in new network scenarios such as 5G and 8K video, network processor (NP) becomes increasingly complex and diverse. Traditional network processors try to integrate amount of heterogeneous processing resources such as processor cores, caches and accelerators on a single SoC (system on chip) to provide highly customizable capabilities. However, with the failure of Moore’s Law and Dennard’s scaling law, developing one-big network processor becomes unsustainable as it faces greater challenges in R & D cycle, cost and innovation iteration. We propose a novel agile customizable architecture for network processor, namely ChipletNP, which decouples heterogeneous resources and uses Chiplet technology to quickly customize new NPs by combining existing mature chip products. ChipetNP is highly flexible as it has an agile switching network which can connect diverse heterogeneous resources with high throughput and predictable delay. We develop a network processor chip, i.e., YHHX-NP, based on ChipletNP architecture, which integrates commercial CPU, FPGA (field programmable gate array) and agile switching chip. Our results show that ChipletNP supports various emerging network functions such as SRv6 (segment routing over IPv6) with ultra-low latency (<2.82 µs), and achieves more than two times energy efficiency improvement compared with commercial chips.

  • Zhiyuan Yan, Biwei Xie, Yungang Bao
    Journal of Computer Research and Development. 2024, 61(12): 2969-2984.

    Sparse matrix-vector multiplication (SpMV) plays an important role in a wide variety of scientific and engineering applications.Executing SpMV efficiently on vector processors is challenging because of the irregular memory access of sparse matrices. We conduct a detailed analysis of the main factors that have impact on the efficiency of SpMV vectorization.In addition to the irregular distribution of non-zero elements within sparse matrices, different sparse matrices also exhibit huge variations in the distribution characteristics of non-zero elements. Therefore, it is difficult to apply a universal vector optimization method for matrices with diverse characteristics. Furthermore, there is a big difference in vector computing and vector instructions for various vector processors. The primary challenge of SpMV vectorization lies in mapping the irregular sparse matrices onto the regular vector processor. In this paper, we propose a hybrid vectorization-optimized mechanism of SpMV(HVMS). HVMS models the characteristics of vector processors and designs corresponding rules based on the abstracted basic operations to guide the regularization conversion of sparse matrices. HVMS divides the matrix into different parts according to the different characteristics. For each part, the non-zero distribution can be less irregular and then HVMS introduces corresponding optimization mechanisms to boost the vectorization efficiency of SpMV. We implement and evaluate HVMS on an Intel Xeon processor and compare it with three state-of-the-art approaches using 30 sparse matrices. Experimental results show that HVMS can achieve an average speedup of 1.60x, 1.72x, and 1.93x over CVR, SELL-C-σ, and Intel MKL, respectively.

  • Jia Wei, Xingjun Zhang, Longxiang Wang, Mingqiang Zhao, Xiaoshe Dong
    Journal of Computer Research and Development. 2024, 61(12): 2985-3004.

    Deep neural network (DNN) have achieved state-of-the-art accuracy in many modern artificial intelligence (AI) tasks. In recent years, it has become increasingly popular to use high performance computing platforms for massively distributed parallel training of DNN. Energy consumption models have been crucial in designing and optimizing DNN for massively parallel training and restraining excessive energy consumption on HPC (high performance computing) platforms. Currently, most energy consumption models model the energy consumption of a single device or a cluster of multiple devices from a hardware perspective. From an energy consumption perspective, the need for disaggregated analysis of distributed parallel DNN applications has resulted in a dearth of energy consumption models that model the characteristics of distributed DNN applications. In this paper, we propose the “materials preprocessing-computing-communicating” three-stage MC2 model from the perspective of the essential features of DNN model training for the most commonly used DNN distributed data parallel training model. The model is validated by training the classical VGG16, ResNet50 networks and the latest Vision Transformer network using up to 128 MT nodes and 32 FT nodes on the domestic E-class prototype Tianhe-3. The experimental results show that the difference between MC2 and the actual energy measurements is only 2.84%. Compared with the four linear proportional energy models and the AR, SES, and ARIMA time prediction models, the accuracy of the model proposed is improved by 69.12%, 69.50%, 34.58%, 13.47%, 5.23%, 22.13%, and 10.53%, respectively. By using the models proposed in this paper, the energy consumption of DNN models at each stage and the overall energy consumption can be obtained on a supercomputer platform, which provides a basis for evaluating the efficiency of DNN energy-aware massively distributed parallel training and inference, as well as optimizing the strategies of task scheduling, job scheduling, model partitioning, and model pruning.

  • Jinping Jia, Shihan Xiao, Kun Qian, Yanqin Yang, Zhao Zhang
    Journal of Computer Research and Development. 2024, 61(12): 3005-3026.

    The Web 3.0 digital economic system takes the blockchain platform as its infrastructure, and revolves around the digital assets such as cryptocurrencies, NFTs, digital collectibles, and decentralized applications (DApps) like decentralized finance (DeFi) and gaming finance (GameFi) to conduct various socio-economic activities. Smart contracts are the core of DApps on the public blockchains and the public permissioned blockchains, such as Ethereum, Solana, EOSIO, Findora, Antchain, ChainMaker, et al. Smart contracts can be deployed by any individual or organization, and are visible and accessible to all blockchain users. This openness brings new opportunities for economic development while also harboring numerous financial risks. We analyze potential risks for Web 3.0 digital economic by focusing on smart contract and summarize the current research on risk perception technology from three aspects: encoding, functionality, and application of smart contracts. We first introduce the research challenges, security vulnerability types, and four categories of vulnerability detection methods in smart contract vulnerability detection technology. Next, we analyze common types of smart contract scams and summarize existing scam recognition techniques based on different classifications of training data. Subsequently, we introduce the current state of technology for detecting four types of illicit transactions behaviors based on blockchain transaction records. Lastly, by analyzing the limitations of existing work, we envision the future research directions.

  • Junjie Zhuang, Shuang Hu, Baojian Hua, Yang Wang, Zhizhong Pan
    Journal of Computer Research and Development. 2024, 61(12): 3027-3053.

    WebAssembly is an emerging binary instruction set architecture and code distribution format, providing a unified compiling target for high-level programming languages. Due to its design advantages such as efficiency, security and portability, WebAssembly has already been widely used in the Web and non-Web scenarios, and it is becoming one of the most promising platform-independent language runtimes. Although WebAssembly provides a variety of advanced features to guarantee its security, existing studies have demonstrated that WebAssembly still has unique attack surfaces leading to serious security issues. These security issues pose challenges to the security of whole ecosystems based on WebAssembly. Therefore, it is critical to study the security issues of WebAssembly and their mitigations. To the best of our knowledge, we present the first study of WebAssembly security, based on 42 published research papers in this area. First, we systematically analyze and summarize key security features of WebAssembly. Second, we propose the first four-layer threat model for WebAssembly: threats from high-level programming languages, compilation toolchains, binary files, and WebAssembly virtual machines. Third, we propose a taxonomy to classify current research efforts into four categories: empirical security study, vulnerability detection and exploitation, security enhancements, and formal semantics and verifications. Finally, we point out potential challenges to be addressed in this field, as well as five future research directions to be explored.

  • Zili Meng, Mingwei Xu
    Journal of Computer Research and Development. 2024, 61(12): 3054-3068.

    Real-time multimedia transmission is one of the most important applications of the Internet, with the applications such as videoconferencing, cloud gaming, virtual reality and so on. In the same time, the real-time multimedia transmission systems therefore demand high requirements for the end-to-end transmission latency. Among them, latency fluctuation is the most challenging problem in latency optimization. However, traditional ‘best-effort’ transmission services in the Internet cannot meet the requirements of latency fluctuations for real-time multimedia transmission in many cases. We firstly elaborates the main challenges faced by real-time multimedia transmission. Secondly, we analyze the key issues that need to be addressed to optimize the latency of real-time multimedia transmission. Based on these issues, two key paths (control path and data path) and five core components in the architecture of real-time multimedia transmission system are summarized. Around the technologies involved in each component, representative research results are summarized and discussed, especially for the research efforts in the recent years. Based on the analysis above, the research branches for real-time multimedia transmission and low-latency applications are summarized, and the optimization algorithms and applications for each research branch are reviewed. A key finding in this paper is that the fluctuation of latency is the key metric that research needs to work on. Finally, we also discuss and propose possible future research directions for the readers.

  • Lifang Bai, Yuefei Zhu, Yongjun Li, Shuai Wang, Xiaoqi Yang
    Journal of Computer Research and Development. 2024, 61(12): 3069-3087.

    With the acceleration of the digitization process, the problem of data security and privacy protection has attracted much attention. Data encryption has always been an important means to solve this problem. However, it is common to store and transfer data in encrypted form. Once calculation is involved, it is often necessary to decrypt the ciphertext, perform the calculation in plaintext, and then encrypt the calculation result. Full homomorphic encryption (FHE) extends encryption to the computing, which can perform meaningful calculations in ciphertext without decryption, and the calculation process and result are encrypted, so it has the natural characteristics of protecting data security and user privacy. The first FHE scheme was proposed by Gentry in 2009, and then FHE has always attracted the attention of the industry and academia. After more than ten years of research, FHE has developed to the fourth stage, and substantial progress has been made. We review and analyze the research progress of FHE from the aspects of the construction idea, different research stages and problems faced, introduce the application progress of FHE from the aspects of algorithm library, standardization progress and typical application scenarios, and put forward suggestions for future research direction.

  • Zelin Su, Wenfang Zhang, Xiaomin Wang
    Journal of Computer Research and Development. 2024, 61(12): 3088-3097.

    Attribute-based encryption is a new access control scheme based on cryptography, which is suitable for data sharing. However, the large computational and communication costs of encryption and access policy updating limit the practical application of attribute-based encryption. Moreover, most of proposed outsourcing ABE schemes do not provide a ciphertext correctness verification method for data owners. Thus, an outsourced ABE scheme with dynamic policy updating and real-time verification of ciphertext correctness is proposed to further protect data privacy in an untrusted cloud environment. In the scheme, the design of policy updating references outsourced encryption, which reduces the computational cost of generating update key. The design of ciphertext correctness verification algorithm refers to decryption operation and introduces verification transformation key to make ciphertext verification more efficient. According to different cloud environment models, efficient verification algorithm and strict verification algorithm are designed, which are suitable for honest but curious cloud environment and untrustworthy cloud environment respectively. The scheme is secure against chosen plaintext attack under the standard model. Performance analysis and efficiency comparison show that the computation of local encryption, policy updating and ciphertext verification are reduced, and the scheme is more lightweight, which is suitable for the application of computation-constrained devices in access control scenarios.