Searcharxiv⌕ Search

arXiv subjects

Deyu Kong

Publications and source records attributed to Deyu Kong.

4 recordsLinked to original sources

Quantitative Accumulation of Invariant Circles Near a Non-splitting Separatrix

For a smooth area-preserving cylinder map with a non-splitting separatrix and an exact symplectic linearization at its saddle, we prove accumulation by smooth essential invariant circles when the boundary transition is sufficiently $C^4$-close to a translation. As an application, we give an answer to Herman's open problem in 1983.

math.DS↗

Quantitative Persistence and Regularity of Invariant Graphs for Dissipative Twist Maps

In this paper we study the robustness of invariant Lagrangian graphs for dissipative twist maps on $\mathbb T^d\times\mathbb R^d$ in the $C^r$ category, for any $r\ge 1$, and show their persistence as invariant global attractors under quantitative sharp conditions involving both the size of dissipation parameter and the perturbation at stake. Note that when $d>1$ the geometric Lagrangian property of the invariant manifold may be destroyed, so that the graph may persist but fail to be Lagrangian. In general, additional dynamical requirements on the twist maps come into play if we intend to preserve also the Lagrangian property. In this line, we first study their persistence for general perturbations, then we restrict to the class of exact conformally symplectic twist maps and provide quantitative sharp conditions for the persistence of invariant exact Lagrangian graphs, without assuming any condition on the tangential dynamics of the manifold. The persistence result relies on a combination of a suitable multidimensional Herman--Mather formula proved in this setting and contraction estimates that provide sharp bounds on the $C^1$-norm of the perturbation to get a unique, globally attracting $C^r$ graph. In dimension $d=1$, by further assuming that that the circle map induced by the graph has irrational rotation number, we prove that every $C^1$ invariant graph of a $C^k$ map is $C^k$ for $k=2,3,\ldots,\infty$. Analytic maps with Lipschitz, non-$C^1$ invariant graphs at every prescribed irrational rotation number show that this initial regularity assumption is essential.

math.DS↗

GX-Plug: a Middleware for Plugging Accelerators to Distributed Graph Processing

Recently, research communities highlight the necessity of formulating a scalability continuum for large-scale graph processing, which gains the scale-out benefits from distributed graph systems, and the scale-up benefits from high-performance accelerators. To this end, we propose a middleware, called the GX-plug, for the ease of integrating the merits of both. As a middleware, the GX-plug is versatile in supporting different runtime environments, computation models, and programming models. More, for improving the middleware performance, we study a series of techniques, including pipeline shuffle, synchronization caching and skipping, and workload balancing, for intra-, inter-, and beyond-iteration optimizations, respectively. Experiments show that our middleware efficiently plugs accelerators to representative distributed graph systems, e.g., GraphX and Powergraph, with up-to 20x acceleration ratio.

cs.DC↗

Clustering-based Partitioning for Large Web Graphs

Graph partitioning plays a vital role in distributedlarge-scale web graph analytics, such as pagerank and labelpropagation. The quality and scalability of partitioning strategyhave a strong impact on such communication- and computation-intensive applications, since it drives the communication costand the workload balance among distributed computing nodes.Recently, the streaming model shows promise in optimizing graphpartitioning. However, existing streaming partitioning strategieseither lack of adequate quality or fall short in scaling with alarge number of partitions.In this work, we explore the property of web graph clusteringand propose a novel restreaming algorithm for vertex-cut parti-tioning. We investigate a series of techniques, which are pipelinedas three steps, streaming clustering, cluster partitioning, andpartition transformation. More, these techniques can be adaptedto a parallel mechanism for further acceleration of partitioning.Experiments on real datasets and real systems show that ouralgorithm outperforms state-of-the-art vertex-cut partitioningmethods in large-scale web graph processing. Surprisingly, theruntime cost of our method can be an order of magnitude lowerthan that of one-pass streaming partitioning algorithms, whenthe number of partitions is large.

cs.DC↗