Search NASA⌕ Search

Engineering topics

You, Yang

Publications and source records attributed to You, Yang.

Experimental Study on Charging Process in the COREX Melter Gasifier

Burden distribution plays an important role in achieving high stability and energy efficiency in the COREX melter gasifier. In this work, a 1/7.5 scale experimental apparatus is established to investigate the burden distribution under the independent and mixed charging conditions. The effects of GIMBAL distributor angle, rotational speed, DRI-flap angle, and charging pattern on these charging conditions are investigated. The results show that the non-uniform distribution of pellet in circumferential direction is intrinsic to the discharge system due to the shape of the DRI flap. The charging pattern has a significant impact on the ore-to-coal volume ratio and bed voidage. The ore-to-coal volume ratio reaches the peak at 550 to 650 mm, indicating that the reduction burden near the wall is heavier than that in the center. The voidage in the middle region is smaller than that of the center and near-wall region. The results also reveal the size segregation along the radial direction of the burden pile. The smaller particles tend to accumulate in the center while the larger ones segregate more near the wall. The findings obtained from experiments should be helpful for the efficient operation of the COREX melter gasifier.

01 COAL, LIGNITE, AND PEAT↗

Accurate, Fast and Scalable Kernel Ridge Regression on Parallel and Distributed Systems

Kernel Ridge Regression (KRR) is a fundamental method in machine learning. Given an n-by-d data matrix as input, a traditional implementation requires Θ(n2) memory to form an n-by-n kernel matrix and Θ(n3) flops to compute the final model. These time and storage costs prohibit KRR from scaling up to large datasets. For example, even on a relatively small dataset (a 520k-by-90 input requiring 357 MB), KRR requires 2 TB memory just to store the kernel matrix. Additionally, the reason is that n usually is much larger than d for real-world applications. On the other hand, weak scaling becomes a problem: if we keep d and n/p fixed as p grows (p is # machines), the memory needed grows as Θ(p) per processor and the flops as Θ(p2) per processor. In the perfect weak scaling situation, both the memory needed and the flops grow as Θ(1) per processor (i.e. memory and flops are constant). The traditional Distributed KRR implementation (DKRR) only achieved 0.32% weak scaling efficiency from 96 to 1536 processors. In this work, we propose two new methods to address these problems: the Balanced KRR (BKRR) and K-means KRR (KKRR). These methods consider alternative ways to partition the input dataset into p different parts, generating p different models, and then selecting the best model among them. Compared to a conventional implementation, KKRR2 (optimized version of KKRR) improves the weak scaling efficiency from 0.32% to 38% and achieves a 591x speedup for getting the same accuracy by using the same data and the same hardware (1536 processors). BKRR2 (optimized version of BKRR) achieves a higher accuracy than the current fastest method using less training time for a variety of datasets. For the applications requiring only approximate solutions, BKRR2 improves the weak scaling efficiency to 92% and achieves 3505x speedup (theoretical speedup: 4096x).

97 MATHEMATICS AND COMPUTING↗

Scaling Deep Learning on GPU and Knights Landing clusters

The speed of deep neural networks training has become a big bottleneck of deep learning research and development. For example, training GoogleNet by ImageNet dataset on one Nvidia K20 GPU needs 21 days. To speed up the training process, the current deep learning systems heavily rely on the hardware accelerators. However, these accelerators have limited on-chip memory compared with CPUs. To handle large datasets, they need to fetch data from either CPU memory or remote processors. We use both self-hosted Intel Knights Landing (KNL) clusters and multi-GPU clusters as our target platforms. From an algorithm aspect, current distributed machine learning systems are mainly designed for cloud systems. These methods are asynchronous because of the slow network and high fault-tolerance requirement on cloud systems. We focus on Elastic Averaging SGD (EASGD) to design algorithms for HPC clusters. Original EASGD used round-robin method for communication and updating. The communication is ordered by the machine rank ID, which is inefficient on HPC clusters. First, we redesign four efficient algorithms for HPC systems to improve EASGD's poor scaling on clusters. Async EASGD, Async MEASGD, and Hogwild EASGD are faster \textcolor{black}{than} their existing counterparts (Async SGD, Async MSGD, and Hogwild SGD, resp.) in all the comparisons. Finally, we design Sync EASGD, which ties for the best performance among all the methods while being deterministic. In addition to the algorithmic improvements, we use some system-algorithm codesign techniques to scale up the algorithms. By reducing the percentage of communication from 87% to 14%, our Sync EASGD achieves 5.3x speedup over original EASGD on the same platform. We get 91.5% weak scaling efficiency on 4253 KNL cores, which is higher than the state-of-the-art implementation.

60 APPLIED LIFE SCIENCES↗

MIC-SVM: Designing A Highly Efficient Support Vector Machine For Advanced Modern Multi-Core and Many-Core Architectures

Support Vector Machine (SVM) has been widely used in data-mining and Big Data applications as modern commercial databases start to attach an increasing importance to the analytic capabilities. In recent years, SVM was adapted to the field of High Performance Computing for power/performance prediction, auto-tuning, and runtime scheduling. However, even at the risk of losing prediction accuracy due to insufficient runtime information, researchers can only afford to apply offline model training to avoid significant runtime training overhead. To address the challenges above, we designed and implemented MICSVM, a highly efficient parallel SVM for x86 based multi-core and many core architectures, such as the Intel Ivy Bridge CPUs and Intel Xeon Phi coprocessor (MIC).

42 ENGINEERING↗

Evaluating Multi-core Architectures through Accelerating the Three-Dimensional Lax–Wendroff Correction

Wave propagation forward modeling is a widely used computational method in oil and gas exploration. The iterative stencil loops in such problems have broad applications in scientific computing. However, executing such loops can be highly time time-consuming, which greatly limits application’s performance and power efficiency. In this paper, we accelerate the forward modeling technique on the latest multi-core and many-core architectures such as Intel Sandy Bridge CPUs, NVIDIA Fermi C2070 GPU, NVIDIA Kepler K20x GPU, and the Intel Xeon Phi Co-processor. For the GPU platforms, we propose two parallel strategies to explore the performance optimization opportunities for our stencil kernels. For Sandy Bridge CPUs and MIC, we also employ various optimization techniques in order to achieve the best.

3D Wave Forward Modeling↗

An Adaptive Cross-Architecture Combination Method for Graph Traversal

Breadth-First Search (BFS) is widely used in many real-world applications including computational biology, social networks, and electronic design automation. The combination method, using both top-down and bottom-up techniques, is the most effective BFS approach. However, current combination methods rely on trial-and-error and exhaustive search to locate the optimal switching point, which may cause significant runtime overhead. To solve this problem, we design an adaptive method based on regression analysis to predict an optimal switching point for the combination method at runtime within less than 0.1% of the BFS execution time.

You, Yang↗

Influences of air calcination and steam activation on microstructure and photocatalytic activity of continuous TiO{sub 2} fibers

Graphical abstract: Display Omitted Highlights: ► Effects of air calcination and steam activation on TiO{sub 2} fibers were studied. ► The photocatalytic activity was evaluated by degradation of formaldehyde. ► Steam activation promoted the anatase–rutile phase transformation. ► Steam activation decreased grain size and increased special surface area. ► Steam activation improved photocatalytic activity of TiO{sub 2} fibers. -- Abstract: Effects of air calcination and steam activation, on phase transformation, microstructure and photocatalytic activity of continuous TiO{sub 2} fibers prepared by sol–gel method were studied. The fibers were characterized by XRD, SEM, and N{sub 2} adsorption–desorption. The photocatalytic activity was evaluated by photocatalytic degradation of formaldehyde. Results showed that 100% rutile fibers heat-treated in air and steam were obtained at 800 °C and 600 °C, respectively. The anatase grain sizes and special surface areas of the fibers heat-treated at 500 °C in air and steam were 31.6 nm, 22.7 nm, 26.7 m{sup 2}/g and 32.3 m{sup 2}/g, respectively. The degradation rates of formaldehyde over the fibers heat-treated at 500 °C in air and steam were 92.3% and 98.6% after 14 h under UV irradiation, respectively. Compared with the air calcination, the steam activation promoted the anatase–rutile phase transformation, reduced the grain size, increased the special surface area, and improved photocatalytic activity of continuous TiO{sub 2} fibers.

36 MATERIALS SCIENCE↗