Xiaoshe Dong

Xiaoshe Dong

Auto-generated profile, based on publicly available information

Xiaoshe Dong

School of Computer Science and Technology, Xi'an Jiaotong university

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2020 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
JLJingbo Li
Jingbo Li
XZXingjun Zhang
Xingjun Zhang
LHLi Han
Li Han
ZJZeyu Ji
Zeyu Ji
XDXiaoshe Dong
Xiaoshe Dong
CHChenglong Hu
Chenglong Hu

2 January 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZWZiheng Wang
Ziheng Wang
XDXiaoshe Dong
Xiaoshe Dong
HCHeng Chen
Heng Chen
YKYan Kang
Yan Kang
The National Institute of Standards and Technology (NIST) approved XMSS as part of the post-quantum cryptography (PQC) development effort in 2018. XMSS is currently one of only two standardized PQC algorithms, but its performance limits its use. For example, the fastest record for some standardized parameters still takes more than a minute to generate a keypair. In this article, we present the first GPU implementation for XMSS and its variant XMSS $^{\mathsf {MT}}$ . The high parallelism of GPUs is especially effective for reducing latency in key generation and improving throughput for signing and verifying. In order to meet various application scenarios, we provide three parallel XMSS schemes: algorithmic parallelism , multi-keypair data parallelism , and single-keypair data parallelism . For these schemes, we design custom parallel strategies that use more than 10,000 cores for all parameters provided by NIST. In addition, we analyze the availability of most previous serial optimizations and explore numerous techniques to fully exploit GPU performance. Our evaluations are made with the XMSSMT-SHA2_20/2_256 parameter set on a GeForce RTX 3090. The result shows the key generation latency is 3.20 ms, a speedup of 21,899× compared to the GPU ported version, which is also 54× speedup faster than the fastest work (174 ms). When 16384 tasks are executed, the throughput (task/s) for signing/verifying in the single-key and multi-key cases is 311,424/415,100 and 145,100/419,887, respectively. Compared to the throughput for signing/verifying (1695/4000) of the fastest work, we obtain a speedup of 184×/104× and 86×/105× in single-key and multi-key cases, respectively.

11 September 2024 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
ZWZiheng Wang
Ziheng Wang
XDXiaoshe Dong
Xiaoshe Dong
HCHeng Chen
Heng Chen
YKYan Kang
Yan Kang
QWQiang Wang
Qiang Wang
Quantum computers pose a serious threat to existing cryptographic systems. While Post-Quantum Cryptography (PQC) offers resilience against quantum attacks, its performance limitations often hinder widespread adoption. Among the three National Institute of Standards and Technology (NIST)-selected general-purpose PQC schemes, SPHINCS ${}^{+}$ is particularly susceptible to these limitations. We introduce CUSPX ( CU DA SP HIN CS ${}^{+}$ ), the first large-scale parallel implementation of SPHINCS ${}^{+}$ capable of running across 10,000 cores. CUSPX leverages a novel three-level parallelism framework, applying it to algorithmic parallelism , data parallelism , and hybrid parallelism . Notably, CUSPX introduces parallel Merkle tree construction algorithms for arbitrary parallel scales and several load-balancing solutions, further enhancing performance. By treating tasks parallelism as the top level of parallelism, CUSPX provides a four-level parallel scheme that can run with any number of tasks. Evaluated on a single GeForce RTX 3090 using the SPHINCS ${}^{+}$ -SHA-256-128s-simple parameter set, CUSPX achieves a single task's signature generation latency of 0.67 ms, demonstrating a 5,105 $\times$ speedup over a single-thread version and an 18.50 $\times$ speedup over the previous fastest implementation.

16 November 2019 in Electronics
Verified
Journal Article
Open access
PDF file
YWYufei Wang
Yufei Wang
XDXiaoshe Dong
Xiaoshe Dong
XZXingjun Zhang
Xingjun Zhang
LWLongxiang Wang
Longxiang Wang
In recent years, NAND Flash-based solid-state drives (SSDs) have become more widely used in data centers and consumer markets. Data centers generally choose to provide high-quality storage services by deploying a large number of SSDs, but there are no effective preventive measures to reduce the impact of SSD failures currently. Some existing studies have analyzed the relevant factors related to SSD failures from different angles, but the characteristics of reliability changes exhibited by SSD throughout the life cycle have not been explored in depth. On the other hand, although the 3D manufacturing process has increased the storage density of the SSD, the mutual influence between the flash units has also increased, resulting in severe degradation of the performance and lifetime of the SSD. Therefore, in order to fully understand the reliability varying process of SSD throughout the life cycle, we first designed an SSD lifetime endurance test method, then conducted the endurance test and collected the reliability data for the entire life cycle of the 3D TLC SSD in the laboratory environment with reference to the JEDEC standard. Through the analysis of experimental data and its statistical correlation, it is found that SSD will produce a large number of uncorrectable errors before reaching the endurance limit, and there will be a phenomenon of continuous high operating temperature, as well as showing some intrinsic relationships about SSD reliability data. The findings in this paper are valuable for identifying whether an SSD is going to fail.

13 August 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
ZWZiheng Wang
Ziheng Wang
XDXiaoshe Dong
Xiaoshe Dong
YKYan Kang
Yan Kang
HCHeng Chen
Heng Chen

9 October 2021 in Future Internet
Verified
Journal Article
Open access
PDF file
YWYinfeng Wang
Yinfeng Wang
LWLongxiang Wang
Longxiang Wang
XDXiaoshe Dong
Xiaoshe Dong
To optimize the data migration performance between different supercomputing centers in China, we present TCP-DQN, which is an intelligent TCP congestion control method based on DQN (Deep Q network). The TCP congestion control process is abstracted as a partially observed Markov decision process. In this process, an agent is constructed to interact with the network environment. The agent adjusts the size of the congestion window by observing the characteristics of the network state. The network environment feeds back the reward to the agent, and the agent tries to maximize the expected reward in an episode. We designed a weighted reward function to balance the throughput and delay. Compared with traditional Q-learning, DQN uses double-layer neural networks and experience replay to reduce the oscillation problem that may occur in gradient descent. We implemented the TCP-DQN method and compared it with mainstream congestion control algorithms such as cubic, Highspeed and NewReno. The results show that the throughput of TCP-DQN can reach more than 2 times of the comparison method while the latency is close to the three compared methods.