Searcharxiv⌕ Search

arXiv subjects

Yuxi Hu

Publications and source records attributed to Yuxi Hu.

29 records · Page 2Linked to original sources

Enhancing Performance and Scalability of Large-Scale Recommendation Systems with Jagged Flash Attention

The integration of hardware accelerators has significantly advanced the capabilities of modern recommendation systems, enabling the exploration of complex ranking paradigms previously deemed impractical. However, the GPU-based computational costs present substantial challenges. In this paper, we demonstrate our development of an efficiency-driven approach to explore these paradigms, moving beyond traditional reliance on native PyTorch modules. We address the specific challenges posed by ranking models' dependence on categorical features, which vary in length and complicate GPU utilization. We introduce Jagged Feature Interaction Kernels, a novel method designed to extract fine-grained insights from long categorical features through efficient handling of dynamically sized tensors. We further enhance the performance of attention mechanisms by integrating Jagged tensors with Flash Attention. Our novel Jagged Flash Attention achieves up to 9x speedup and 22x memory reduction compared to dense attention. Notably, it also outperforms dense flash attention, with up to 3x speedup and 53% more memory efficiency. In production models, we observe 10% QPS improvement and 18% memory savings, enabling us to scale our recommendation systems with longer features and more complex architectures.

cs.LG↗

Asymptotic stability of composite waves of viscous shock and rarefaction for relaxed compressible Navier-Stokes equations

The time asymptotic stability for one-dimensional relaxed compressible Navier-Stokes equations is studied. We show that the composite waves of viscous shock and rarefaction are asymptotically nonlinear stable with both small wave strength and small initial perturbations. Moreover, as the relaxation parameter goes to zero, the solutions of relaxed system are shown to converge globally in time to that of classical system. The methods are based on relative entropy, the a-contraction with shifts theory and basic energy estimates.

math.AP↗

Fault Injection based Failure Analysis of three CentOS-like Operating Systems

The reliability of operating system (OS) has always been a major concern in the academia and industry. This paper studies how to perform OS failure analysis by fault injection based on the fault mode library. Firstly, we use the fault mode generation method based on Linux abstract hierarchy structure analysis to systematically define the Linux-like fault modes, construct a Linux fault mode library and develop a fault injection tool based on the fault mode library (FIFML). Then, fault injection experiments are carried out on three commercial Linux distributions, CentOS, Anolis OS and openEuler, to identify their reliability problems and give improvement suggestions. We also use the virtual file systems of these three OSs as experimental objects, to perform fault injection at levels of Light and Normal, measure the performance of 13 common file operations before and after fault injection.

cs.SE↗

Blow-up of solutions for relaxed compressible Navier-Stokes equations

We present a blow-up result for large data for relaxed compressible Navier-Stokes models avoiding the possibility of reaching the boundary of hyperbolicity. Thus a previous result is improved and further examples are given illustrating possible effects of a relaxation and contrasting the classical compressible Navier-Stokes equations without relaxation where solutions for large data exist globally.

math.AP↗

Software-Hardware Co-design for Fast and Scalable Training of Deep Learning Recommendation Models

Deep learning recommendation models (DLRMs) are used across many business-critical services at Facebook and are the single largest AI application in terms of infrastructure demand in its data-centers. In this paper we discuss the SW/HW co-designed solution for high-performance distributed training of large-scale DLRMs. We introduce a high-performance scalable software stack based on PyTorch and pair it with the new evolution of Zion platform, namely ZionEX. We demonstrate the capability to train very large DLRMs with up to 12 Trillion parameters and show that we can attain 40X speedup in terms of time to solution over previous systems. We achieve this by (i) designing the ZionEX platform with dedicated scale-out network, provisioned with high bandwidth, optimal topology and efficient transport (ii) implementing an optimized PyTorch-based training stack supporting both model and data parallelism (iii) developing sharding algorithms capable of hierarchical partitioning of the embedding tables along row, column dimensions and load balancing them across multiple workers; (iv) adding high-performance core operators while retaining flexibility to support optimizers with fully deterministic updates (v) leveraging reduced precision communications, multi-level memory hierarchy (HBM+DDR+SSD) and pipelining. Furthermore, we develop and briefly comment on distributed data ingestion and other supporting services that are required for the robust and efficient end-to-end training in production environments.

cs.DC↗

AFETM: Adaptive function execution trace monitoring for fault diagnosis

The high tracking overhead, the amount of up-front effort required to selecting the trace points, and the lack of effective data analysis model are the significant barriers to the adoption of intra-component tracking for fault diagnosis today. This paper introduces a novel method for fault diagnosis by combining adaptive function level dynamic tracking, target fault injection, and graph convolutional network. In order to implement this method, we introduce techniques for (i) selecting function level trace points, (ii) constructing approximate function call tree of program when using adaptive tracking, and (iii) constructing graph convolutional network with fault injection campaign. We evaluate our method using a web service benchmark composed of Redis, Nginx, Httpd, and SQlite. The experimental results show that this method outperforms log based method, full tracking method, and Gaussian influence method in the accuracy of fault diagnosis, overhead, and performance impact on the diagnosis target.

cs.SE↗

Asymptotic stability of rarefaction waves for compressible Navier-Stokes equations with relaxation

The asymptotic stability of rarefaction wave for 1-d relaxed compressible isentropic Navier-Stokes equations is established. For initial data with different far-field values, we show that there exists a unique global in time solution. Moreover, as time goes to infinity, the obtained solutions are shown to converge uniformly to rarefaction wave solution of $p$-system with corresponding Riemann initial data. The proof is based on $L^2$ energy methods.

math.AP↗

Global existence versus blow-up for multi-d hyperbolized compressible Navier-Stokes equations

We consider the non-isentropic compressible Navier-Stokes equations in two or three space dimensions for which the heat conduction of Fourier's law is replaced by Cattaneo's law and the classical Newtonian flow is replaced by a revised Maxwell flow. We show that a physical entropy exists for this new model. For two special cases, we show the global well-posedness of solutions with small initial data and the blow-up of solutions in finite time for a class of large initial data. Moreover, for vanishing relaxation parameters, the solutions (if it exists) are shown to converge to solutions of the classical system.

math.AP↗

Low Mach number limit of full compressible Navier-Stokes equations with revised Maxwell law

In this paper, we study the low Mach number limit of the full compressible Navier-Stokes equations with revised Maxwell law. By applying the uniform estimation of the error system, we prove that the solutions of the full compressible Navier-Stokes equations with time relaxation converge to that of the incompressible Navier-Stokes equations as the Mach number tends to zero. Moreover, the convergence rates are also obtained.

math.AP↗

Local well-posedness and global existence for a multi-component Novikov equation

Considered herein is a multi-component Novikov equation, which admits bi-Hamiltonian structure, infinitely many conserved quantities and peaked solutions. In this paper, we deduce two blow-up criteria for this system and global existence for some two-component case in $H^s$. Finally we verify that the system possesses peakons and periodic peakons.

math.AP↗