Latest ArticlesDigital signatures play a critical role in information security; however, traditional digital signature algorithms are at risk of becoming obsolete in the post-quantum era. SPHINCS+, as a digital signature framework resistant to quantum computing attacks, is expected to become increasingly important in this new era. Nevertheless, the relatively slow computational speed of SPHINCS+ poses challenges in meeting the high throughput and low latency demands of modern cryptographic applications, significantly limiting its practicality. An efficient optimization strategy based on a domestic DCU (Deep Computing Unit) is presented to accelerate the SPHINCS+ algorithm instantiated with the domestic SM3 Hash function. By enhancing memory copy efficiency, optimizing the computational processes of SM3 and SPHINCS+, and employing optimal computational parallelism, we implement the 128-f mode of SPHINCS+-SM3 on DCU. Experimental results demonstrate that, compared with traditional CPU implementations, our DCU-based implementation achieves a significant increase in throughput, improving signature generation and verification by 2603.87 times and 1281.98 times, respectively. This substantial improvement in computational efficiency and practicality enhances the feasibility of SPHINCS+ and advances the domestic adoption of post-quantum cryptographic algorithms. In scenarios involving high data traffic and large volumes of signature requests, the DCU implementation exhibits significant performance advantages over CPU implementations.
Tensor transposition is a fundamental computational primitive extensively employed in signal processing, scientific computing, and deep learning applications. With the growing emphasis on energy efficiency in high-performance computing, digital signal processors (DSPs) have emerged as promising accelerators. However, existing tensor transposition libraries designed for conventional CPU/GPU architectures fail to fully exploit the architectural advantages of modern DSP platforms, particularly their specialized memory hierarchies and vector processing capabilities. To address the architectural characteristics of domestic DSP platforms, we proposes ftmTT, a high-performance tensor transposition algorithm specifically optimized for multi-core DSP architectures. The key technical contributions include: 1) An intelligent tiling strategy that systematically decomposes high-dimensional tensor operations into efficient matrix transposition kernels native to DSP hardware; 2) A novel DMA-based data access optimization scheme that significantly reduces memory transfer overhead through smart data block consolidation; 3) A double-buffering design that asynchronously overlaps transposition computation with DMA transfers, enabling computation-communication overlap and ultimately achieving high-performance parallel tensor transposition on DSP platforms. Experiments on the domestic multi-core DSP platform FT-M7032 demonstrate that ftmTT tensor transposition algorithm achieves up to 75.96% of the theoretical bandwidth and 99.23% of the experimental platform’s STREAM bandwidth.
With the rapid development of high-performance computing technologies, the complexity and scale of scientific computing problems have significantly increased. As a critical input for scientific computing, mesh generation has emerged as an important research direction in high-performance computing. To address challenges such as low computational efficiency and complex human-machine interaction in large-scale mesh generation, intelligent mesh generation methods have attracted increasing attention. However, achieving a deep integration of high-performance computing and artificial intelligence in mesh generation remains a critical challenge. To overcome these challenges, an intelligent parallel mesh generation framework based on unsupervised learning is proposed, enabling the efficient generation of large-scale multi-block structured meshes. The framework integrates a block partitioning method based on cross-fields, a Fourier Kolmogorov-Arnold network model, and a mesh alignment technique. It employs an unsupervised learning approach to adaptively learn high-quality mesh partitioning rules, effectively overcoming the limitations of existing intelligent methods in handling complex geometries. Additionally, a novel parallel transfer learning mechanism is introduced, significantly enhancing model convergence efficiency by transferring task similarity features across different processes. Experimental results demonstrate that the proposed framework achieves up to a 10-fold improvement in efficiency over traditional mesh generation methods for hundred-million-scale tasks. Furthermore, it outperforms existing intelligent mesh generation methods across five different quality metrics, achieving state-of-the-art performance.
Artificial intelligence applications require highly advanced high-speed video imaging technologies to perceive the surrounding environment better. Deep learning-based snapshot compressive imaging (SCI) offers a promising solution. How to reconstruct high-speed videos from observed data using deep learning techniques is a frontier hotspot in the field. However, existing reconstruction methods focus on mining prior information, neglecting the direct influence of masks and image textures on reconstruction difficulty. There is still room for further improvement in reconstruction quality. To address this issue, we propose a reconstruction difficulty perception-based SCI (RdpSCI) method. Based on the observation that masks and image textures jointly determine the information contained in the observed data, exploration of the correlation between masks, image textures, and reconstruction difficulty are first proposed by RdpSCI to guide deep networks for reconstruction. Specifically, it introduces an improved residual dense network (I-ResDNet) module, innovatively incorporating channel shuffling operations into ResDNet to reduce the dependency of feature fusion effects on channel partitioning methods. The proposed I-ResDNet also introduces a reconstruction difficulty weight vector to guide feature fusion, enhancing feature fusion capability without significantly increasing model parameters. Experiments show that compared with the state-of-the-art methods STFormer and EfficientSCI, RdpSCI achieves improvements of 0.68 dB and 0.54 dB in reconstruction quality on benchmark grayscale and colour datasets, respectively.
In the field image reconstruction, traditional total variation (TV) regularization often incurs staircase artifacts and compromises image contrast. In this work, we refine the total variation framework by incorporating a non-convex penalty function alongside a backward diffusion mechanism; on this basis, we propose a resilient total variation (RTV)-based image reconstruction model. First, to mitigate staircase artifacts, the proposed method enhances the robustness of TV regularization by incorporating the transformed
Congestion control is one of the key technologies for realizing high-performance data center networks, and it affects important network performance indicators such as throughput, latency, and packet loss rate. Over the past 20 years, with the continuous expansion of the scale of data centers and the increasing requirements of upper-layer applications for network performance, the deployment of remote direct memory access (RDMA) technology based on lossless underlying networks has received widespread attention within the industry. However, the priority-based flow control (PFC) mechanism, while maintaining a lossless network, introduces problems such as head-of-line blocking, leading to a decline in network performance or even network paralysis. As a crucial auxiliary means for achieving a lossless network, how to design a practical RDMA congestion control mechanism has become a hot issue. By dividing the congestion control process into congestion awareness and congestion regulation, this paper comprehensively reviews the research achievements in this field: Firstly, from the perspectives of explicit feedback and latency, different representative algorithms for congestion awareness are elaborated and summarized in detail; Secondly, representative algorithms for congestion regulation are introduced in detail from the dimensions of rate and window, and their advantages and disadvantages are summarized; Some optimization work of algorithms and congestion control algorithms based on reinforcement learning methods are supplemented; Finally, the existing challenges in this field are summarized and discussed.
With the rapid development of emerging network technologies such as B5G/6G and Internet of things, network services present characteristics of diverse business types, differentiated quality requirements, and dynamic resource demands. Under the software defined networking (SDN) and network function virtualization (NFV) paradigm, service function chaining (SFC) technology enables customized network service deployment through flexible orchestration of virtual network functions (VNF). However, SFC deployment in dynamic network environments faces challenges such as large decision space, and complex and changing environments. Reinforcement learning (RL) demonstrates significant advantages in solving SFC deployment problems due to its capability to adaptively learn complex environmental characteristics and make dynamic decisions. Although research on applying RL to SFC deployment has made certain progress, a systematic and comprehensive review analysis remains lacking. To address this gap, the fundamental concepts and technical architecture of SFC deployment are elaborated, along with a specific introduction to the RL-based SFC deployment framework. Subsequently, from the perspectives of algorithm design, application scenarios, and optimization strategies, the research progress and innovative applications of reinforcement learning in three key phases—SFC placement, scheduling, and reconfiguration—are systematically examined and thoroughly analyzed. Finally, the advantages and limitations of existing research in terms of algorithm design, performance optimization, and practical deployment are summarized, while technical challenges and future development trends in this field are analyzed.
Model hijacking attack is a novel attack method that implants specific words to covertly control a model, making it perform tasks different from its original purpose, increasing training costs and exposing the model owner to legal risks. While this attack has been recently studied for German-English models, it remains unexplored in the Chinese natural language processing (NLP) field. Compared with other languages, the unique characteristics of Chinese pose distinct security challenges, making existing attack methods suitable for German-English models not directly applicable to Chinese models. However, these risks posed by this attack can still be exploited by attackers, thereby threatening Chinese models. Therefore, it is crucial to develop an attack evaluation method for Chinese models. Based on these considerations, we propose Cheater, a model hijacking attack method tailored for Chinese-English NLP tasks to evaluate the security of Chinese models. To successfully hijack the target model, Cheater first uses a public translation model to camouflage the hijacking data, generating a transitional dataset. It then embeds Chinese logical words into the transitional dataset to produce malicious data, which is used to hijack the target model. For the Bart[large] model, the experiment shows that Cheater achieves an attack success rate of 90.2% at a 0.5% data contamination rate.
As one of the most distinctive representations for distributed computing, an end-edge-cloud collaborative computing system is capable of effectively bringing such applications as Internet of things, large-scale language models, and digital twins into real life. By mimicking the neural activities that take place in the human brain, brain-inspired computing has various advantages, including energy efficiency, high speed, high error-tolerance, and desirable scalability. Through leveraging the event-driven mechanism and the sparsity in spike generation of spiking neural networks, the real-time processing capability and energy efficiency of an end-edge-cloud collaborative computing system can be significantly improved. In this paper, a distributed computing-oriented ISA (instruction set architecture) design for brain-inspired intelligence CPU is studied. Bearing in mind the requirements of delay-sensitive, low-power, and high diversity for end devices, we focus on the software-hardware interface, i.e., ISA, and propose a hardware design that is rooted in the current systems, easy to implement and upgrade, safety-aware and self-controllable, and compatible with heterogeneous architectures. Along with a corresponding CPU micro-architecture design, a dozen of instructions specifically conceived for brain-inspired computing are proposed based on a well established ISA, which sets the stage for empowering distributed computing systems with brain-inspired computing. We firmly believe that this paper has discovered a fruitful research field, and sincerely hope that more interests can be stimulated in ISA designs for brain-inspired intelligence CPU in both academic and industrial communities.
Multithread programming models are widely employed to facilitate application execution on multiple cores. However, interference caused by competition for the last level cache (LLC) among concurrently executed threads can lead to performance degradation. Intel cache allocation technology (CAT) provides a mechanism to assign cache ways to cores for achieving cache isolation. Unfortunately, prior studies on CAT-based partitioning are not applicable to multithreaded applications due to two reasons. Firstly, they are tailored for multi-application scenarios rather than single-application scenarios involving multiple related threads. Secondly, they are designed for improving IPC (instructions per cycle), which is not a suitable performance indicator in multithreaded scenarios. To bridge this gap, we present LPart, an intelligent cache partitioning technique for multithreaded applications that significantly improve throughput in multicores with way-partitioned caches. LPart leverages deep reinforcement learning to assign an appropriate number of LLC ways for different threads within an application, without needing any prior knowledge of the application characteristics. We evaluate LPart on a microbenchmark, Redis, a commercial production-ready distributed storage system, and multiple application scenarios. The experimental results indicate that, compared with the default configuration, LPart achieves speedups up to 26.9%, 8.1%, 9.8%, and 24.1% respectively without requiring any changes to the operating system.