Shuo Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shuo Zhang has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
Bao Wan-Su
1 shared publication- Chao Shi
Alibaba Group, Hangzhou, China
1 shared publication - Ding Chen
School of Defence Science and Technology, Xi’an Technological University , No. 2 Xuefu Middle Road, Weiyang District, Xi’an City, Shaanxi Province 710021
1 shared publication - Dong Wu
Alibaba Group, Hangzhou, China
1 shared publication - Erci Xu
Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Feng-Guang Li
Zhengzhou Information Science and Technology Institute
1 shared publication
Latest Publications
- Open Access
- 8 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (2) , 1-29
Evolving the Cloud Block Store with Performance, Elasticity, Availability, and Hardware Offloading
In this paper, we qualitatively and quantitatively discuss the design choices, production experience, and lessons in building the Elastic Block Storage ( EBS ) at Alibaba Cloud over the past decade. To cope with hardware advancement and users’ demands, we shift our focus from design simplicity in EBS1 to high performance and space efficiency in EBS2 , and finally reducing network traffic amplification in EBS3 . In addition to the architectural evolutions, we also summarize development lessons and experiences as four topics, including: (i) achieving high elasticity in latency, throughput, IOPS, and capacity; (ii) improving availability by minimizing the blast radius of individual, regional, and global failure events; (iii) identifying the motivations and key tradeoffs in various hardware offloading solutions; and (iv) identifying the pros/cons of alternative solutions and explaining why seemingly promising ideas would not work in practice.
- 8 February 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 21 (2) , 1-29
Open AccessEvolving the Cloud Block Store with Performance, Elasticity, Availability, and Hardware Offloading
In this paper, we qualitatively and quantitatively discuss the design choices, production experience, and lessons in building the Elastic Block Storage ( EBS ) at Alibaba Cloud over the past decade. To cope with hardware advancement and users’ demands, we shift our focus from design simplicity in EBS1 to high performance and space efficiency in EBS2 , and finally reducing network traffic amplification in EBS3 . In addition to the architectural evolutions, we also summarize development lessons and experiences as four topics, including: (i) achieving high elasticity in latency, throughput, IOPS, and capacity; (ii) improving availability by minimizing the blast radius of individual, regional, and global failure events; (iii) identifying the motivations and key tradeoffs in various hardware offloading solutions; and (iv) identifying the pros/cons of alternative solutions and explaining why seemingly promising ideas would not work in practice.
- Open Access
- 1 January 2021
- Published by Acta Physica Sinica, Chinese Physical Society and Institute of Physics, Chinese Academy of Sciences in Acta Physica Sinica
- Vol. 70 (21) , 210303
A quantum state readout method based on a single ancilla qubit
- 1 January 2021
- Published by Acta Physica Sinica, Chinese Physical Society and Institute of Physics, Chinese Academy of Sciences in Acta Physica Sinica
- Vol. 70 (21) , 210303
Open AccessA quantum state readout method based on a single ancilla qubit
- Open Access
Realization of t-bit semiclassical quantum Fourier transform on IBM's quantum cloud computer
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT using arbitrary-scale quantum register. Using our method, the scale of quantum register can be determined flexibility according to the scale of quantum system, enabling the quantum resource and speed of realizing QFT to be optimal. By developing a feasible method to realize the control quantum gate R_k, we experimentally demonstrate the 2-bit semiclassical QFT over (Z_(2^3)) on IBM's quantum cloud computer, showing the feasibility of our proposed method. Then, we compare the actual performance of 2-bit semiclassical QFT and standard QFT in the experiments. Experimental data show that the fidelity of the result of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to less two-qubit controlled gates are required in the semiclassical QFT. Furthermore, based on the proposed method, we successfully implement the Shor's algorithm to factorize N=15.
Open AccessRealization of t-bit semiclassical quantum Fourier transform on IBM's quantum cloud computer
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT using arbitrary-scale quantum register. Using our method, the scale of quantum register can be determined flexibility according to the scale of quantum system, enabling the quantum resource and speed of realizing QFT to be optimal. By developing a feasible method to realize the control quantum gate R_k, we experimentally demonstrate the 2-bit semiclassical QFT over (Z_(2^3)) on IBM's quantum cloud computer, showing the feasibility of our proposed method. Then, we compare the actual performance of 2-bit semiclassical QFT and standard QFT in the experiments. Experimental data show that the fidelity of the result of 2-bit semiclassical QFT is higher than that of standard QFT, which is mainly due to less two-qubit controlled gates are required in the semiclassical QFT. Furthermore, based on the proposed method, we successfully implement the Shor's algorithm to factorize N=15.
- 1 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 29 (15301605) , 1-7
An Enhanced Coverage Control Protocol for Wireless Sensor Networks
Wireless sensor networks (WSNs) of limited power need to utilize reasonable coverage control protocol to reduce overall energy consumption by turning off redundant sensors while maintaining the required coverage quality. However, the two most well-known off-duty eligibility rules of coverage control protocols (Ottawa and CCP) are either unnecessary or insufficient conditions which consequently lead to redundant sensors or blind points. In this paper we propose a necessary and sufficient off-duty eligibility rule which can guarantee no blind points incurred while maintaining the number of on-duty nodes to a minimum. Based on this rule, a novel coverage control protocol denoted as Enhanced Coverage Control Protocol (ECCP) is presented. Simulation results demonstrate that ECCP can conserve the network's energy with less on-duty sensors than Ottawa, and preserve the coverage quality more accurate than CCP. Therefore, ECCP is an efficient and reliable coverage control protocol with no redundant sensors and blind points.
- 1 January 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 29 (15301605) , 1-7
An Enhanced Coverage Control Protocol for Wireless Sensor Networks
Wireless sensor networks (WSNs) of limited power need to utilize reasonable coverage control protocol to reduce overall energy consumption by turning off redundant sensors while maintaining the required coverage quality. However, the two most well-known off-duty eligibility rules of coverage control protocols (Ottawa and CCP) are either unnecessary or insufficient conditions which consequently lead to redundant sensors or blind points. In this paper we propose a necessary and sufficient off-duty eligibility rule which can guarantee no blind points incurred while maintaining the number of on-duty nodes to a minimum. Based on this rule, a novel coverage control protocol denoted as Enhanced Coverage Control Protocol (ECCP) is presented. Simulation results demonstrate that ECCP can conserve the network's energy with less on-duty sensors than Ottawa, and preserve the coverage quality more accurate than CCP. Therefore, ECCP is an efficient and reliable coverage control protocol with no redundant sensors and blind points.