arXiv subjects

Haohan Huang

Publications and source records attributed to Haohan Huang.

4 recordsLinked to original sources

arXiv2024

WindGP: Efficient Graph Partitioning on Heterogenous Machines

Graph Partitioning is widely used in many real-world applications such as fraud detection and social network analysis, in order to enable the distributed graph computing on large graphs. However, existing works fail to balance the computation cost and communication cost on machines with different power (including computing capability, network bandwidth and memory size), as they only consider replication factor and neglect the difference of machines in realistic data centers. In this paper, we propose a general graph partitioning algorithm WindGP, which can support fast and high-quality edge partitioning on heterogeneous machines. WindGP designs novel preprocessing techniques to simplify the metric and balance the computation cost according to the characteristics of graphs and machines. Also, best-first search is proposed instead of BFS and DFS, in order to generate clusters with high cohesion. Furthermore, WindGP adaptively tunes the partition results by sophisticated local search methods. Extensive experiments show that WindGP outperforms all state-of-the-art partition methods by 1.35 - 27 times on both dense and sparse distributed graph algorithms, and has good scalability with graph size and machine number.

cs.DC↗

arXiv2023

A five-point TENO scheme with adaptive dissipation based on a new scale sensor

In this paper, a new five-point targeted essentially non-oscillatory (TENO) scheme with adaptive dissipation is proposed. With the standard TENO weighting strategy, the cut-off parameter $C_T$ determines the nonlinear numerical dissipation of the resultant TENO scheme. Moreover, according to the dissipation-adaptive TENO5-A scheme, the choice of the cut-off parameter $C_T$ highly depends on the effective scale sensor. However, the scale sensor in TENO5-A can only roughly detect the discontinuity locations instead of evaluating the local flow wavenumber as desired. In this work, a new five-point scale sensor, which can estimate the local flow wavenumber accurately, is proposed to further improve the performance of TENO5-A. In combination with a hyperbolic tangent function, the new scale sensor is deployed to the TENO5-A framework for adapting the cut-off parameter $C_T$, i.e., the local nonlinear dissipation, according to the local flow wavenumber. Overall, sufficient numerical dissipation is generated to capture discontinuities, whereas a minimum amount of dissipation is delivered for better resolving the smooth flows. A set of benchmark cases is simulated to demonstrate the performance of the new TENO5-A scheme.

physics.flu-dyn↗

arXiv2022

The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights

Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning as a new approach for solving combinatorial problems, either directly as solvers or by enhancing exact solvers. Based on this context, the ML4CO aims at improving state-of-the-art combinatorial optimization solvers by replacing key heuristic components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate solver configuration. Three realistic datasets were considered: balanced item placement, workload apportionment, and maritime inventory routing. This last dataset was kept anonymous for the contestants.

cs.LG↗

arXiv2022

Efficient primal heuristics for mixed-integer linear programs

This paper is a short report about our work for the primal task in the Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For each dataset of our interest in the competition, we propose customized primal heuristic methods to efficiently identify high-quality feasible solutions. The computational studies demonstrate the superiority of our proposed approaches over the competitors'.

math.OC↗