Qin Xiong
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
Qin Xiong has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
You Zhou
School of Optical and Electronic Information, Huazhong University of Science and Technology, Wuhan, China
2 shared publicationsYue Zhu
Wuhan National Laboratory for Optoelectronics, Huazhang University of Science and Technology, Wuhan, China
2 shared publicationsChangsheng Xie
Huazhong University of Science and Technology, Wuhan, China
1 shared publication- Changsheng Xie
Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, China
1 shared publication Chaojie Huang
Chongqing Institute of Green and Intelligent Technology School of Information and Software Engineering Chinese Academy of Sceinces University of Electronic Science and Technology of China China
1 shared publicationFei Wu
Huazhong University of Science and Technology, Wuhan, China
1 shared publication
Latest Publications
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 381-388
Characterizing 3D Charge Trap NAND Flash: Observations, Analyses and Applications
In the 3D era, the Charge Trap (CT) NAND flash is employed by mainstream products, thus having a deep understanding of its characteristics is becoming increasingly crucial for designing flash-based systems. In this paper, to enable such understanding, we implement comprehensive experiments on advanced 3D CT NAND flash chips by developing an ARM-and FPGA-based evaluation platform. Based on the experimental results, we first make distinct observations on the characteristics of 3D CT NAND flash, including its performance and reliability features. Then we give analyses of the observations from physical and circuit aspects. Finally, based on the unique characteristics of 3D CT NAND flash, suggestions to optimize the flash management algorithms in real applications are presented.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 381-388
Characterizing 3D Charge Trap NAND Flash: Observations, Analyses and Applications
In the 3D era, the Charge Trap (CT) NAND flash is employed by mainstream products, thus having a deep understanding of its characteristics is becoming increasingly crucial for designing flash-based systems. In this paper, to enable such understanding, we implement comprehensive experiments on advanced 3D CT NAND flash chips by developing an ARM-and FPGA-based evaluation platform. Based on the experimental results, we first make distinct observations on the characteristics of 3D CT NAND flash, including its performance and reliability features. Then we give analyses of the observations from physical and circuit aspects. Finally, based on the unique characteristics of 3D CT NAND flash, suggestions to optimize the flash management algorithms in real applications are presented.
- Open Access
- 12 April 2018
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 14 (2) , 1-31
Characterizing 3D Floating Gate NAND Flash
As both NAND flash memory manufacturers and users are turning their attentions from planar architecture towards three-dimensional (3D) architecture, it becomes critical and urgent to understand the characteristics of 3D NAND flash memory. These characteristics, especially those different from planar NAND flash, can significantly affect design choices of flash management techniques. In this article, we present a characterization study on the state-of-the-art 3D floating gate (FG) NAND flash memory through comprehensive experiments on an FPGA-based 3D NAND flash evaluation platform. We make distinct observations on its performance and reliability, such as operation latencies and various error patterns, followed by careful analyses from physical and circuit-level perspectives. Although 3D FG NAND flash provides much higher storage densities than planar NAND flash, it faces new performance challenges of garbage collection overhead and program performance variations and more complicated reliability issues due to, e.g., distinct location dependence and value dependence of errors. We also summarize the differences between 3D FG NAND flash and planar NAND flash and discuss implications on the designs of NAND flash management techniques brought by the architecture innovation. We believe that our work will facilitate developing novel 3D FG NAND flash-oriented designs to achieve better performance and reliability.
- 12 April 2018
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Storage
- Vol. 14 (2) , 1-31
Open AccessCharacterizing 3D Floating Gate NAND Flash
As both NAND flash memory manufacturers and users are turning their attentions from planar architecture towards three-dimensional (3D) architecture, it becomes critical and urgent to understand the characteristics of 3D NAND flash memory. These characteristics, especially those different from planar NAND flash, can significantly affect design choices of flash management techniques. In this article, we present a characterization study on the state-of-the-art 3D floating gate (FG) NAND flash memory through comprehensive experiments on an FPGA-based 3D NAND flash evaluation platform. We make distinct observations on its performance and reliability, such as operation latencies and various error patterns, followed by careful analyses from physical and circuit-level perspectives. Although 3D FG NAND flash provides much higher storage densities than planar NAND flash, it faces new performance challenges of garbage collection overhead and program performance variations and more complicated reliability issues due to, e.g., distinct location dependence and value dependence of errors. We also summarize the differences between 3D FG NAND flash and planar NAND flash and discuss implications on the designs of NAND flash management techniques brought by the architecture innovation. We believe that our work will facilitate developing novel 3D FG NAND flash-oriented designs to achieve better performance and reliability.
- Open Access
Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called $\triangle$STSP) is Christofides algorithm which was proposed in 1976 and is a $\frac{3}{2}$-approximation. Since then no proved improvement is made and improving upon this bound is a fundamental open question in combinatorial optimization. In this paper, for the first time, we propose Truncated Generalized Beta distribution (TGB) for the probability distribution of optimal tour lengths in a TSP. We then introduce an iterative TGB approach to obtain quality-proved near optimal approximation, i.e., (1+$\frac{1}{2}(\frac{\alpha+1}{\alpha+2})^{K-1}$)-approximation where $K$ is the number of iterations in TGB and $\alpha (>>1)$ is the shape parameters of TGB. The result can approach the true optimum as $K$ increases.Open AccessObtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called $\triangle$STSP) is Christofides algorithm which was proposed in 1976 and is a $\frac{3}{2}$-approximation. Since then no proved improvement is made and improving upon this bound is a fundamental open question in combinatorial optimization. In this paper, for the first time, we propose Truncated Generalized Beta distribution (TGB) for the probability distribution of optimal tour lengths in a TSP. We then introduce an iterative TGB approach to obtain quality-proved near optimal approximation, i.e., (1+$\frac{1}{2}(\frac{\alpha+1}{\alpha+2})^{K-1}$)-approximation where $K$ is the number of iterations in TGB and $\alpha (>>1)$ is the shape parameters of TGB. The result can approach the true optimum as $K$ increases. - 1 November 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 313-317
Genetic and particle swarm hybrid QoS anycast routing algorithm
Anycast is proposed in IPv6 as a new communication model and becoming increasingly important. Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. The QoS anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. A hybrid algorithm which combines genetic algorithm and particle swarm optimization algorithm is proposed to solve anycast routing problem with multiple QoS constraints. The algorithm uses an update operator to solve the problem which the routing paths can learn from other bester paths, so that whole population tends to the best path progressively. The simulation results show that our algorithm can overcome the disadvantages of genetic algorithm and particle swarm optimization algorithm, and achieve better QoS performance. It has faster convergence speed and can escape from local optimum.
- 1 November 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 313-317
Genetic and particle swarm hybrid QoS anycast routing algorithm
Anycast is proposed in IPv6 as a new communication model and becoming increasingly important. Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. The QoS anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. A hybrid algorithm which combines genetic algorithm and particle swarm optimization algorithm is proposed to solve anycast routing problem with multiple QoS constraints. The algorithm uses an update operator to solve the problem which the routing paths can learn from other bester paths, so that whole population tends to the best path progressively. The simulation results show that our algorithm can overcome the disadvantages of genetic algorithm and particle swarm optimization algorithm, and achieve better QoS performance. It has faster convergence speed and can escape from local optimum.