Yao Xiao

Yao Xiao

Auto-generated profile, based on publicly available information

Yao Xiao

College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AZAmelie Chi Zhou
Amelie Chi Zhou
YXYao Xiao
Yao Xiao
YGYifan Gong
Yifan Gong
BHBingsheng He
Bingsheng He
JZJidong Zhai
Jidong Zhai
RMRui Mao
Rui Mao

25 November 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AZAmelie Chi Zhou
Amelie Chi Zhou
BSBingkun Shen
Bingkun Shen
YXYao Xiao
Yao Xiao
SIShadi Ibrahim
Shadi Ibrahim
BHBingsheng He
Bingsheng He
Graph processing is an emerging computation model for a wide range of applications and graph partitioning is important for optimizing the cost and performance of graph processing jobs. Recently, many graph applications store their data on geo-distributed datacenters (DCs) to provide services worldwide with low latency. This raises new challenges to existing graph partitioning methods, due to the multi-level heterogeneities in network bandwidth and communication prices in geo-distributed DCs. In this paper, we propose an efficient graph partitioning method named Geo-Cut, which takes both the cost and performance objectives into consideration for large graph processing in geo-distributed DCs.Geo-Cut adopts two optimization stages. First, we propose a cost-aware streaming heuristic and utilize the one-pass streaming graph partitioning method to quickly assign edges to different DCs while minimizing inter-DC data communication cost. Second, we propose two partition refinement heuristics which identify the performance bottlenecks of geo-distributed graph processing and refine the partitioning result obtained in the first stage to reduce the inter-DC data transfer time while satisfying the budget constraint. Geo-Cut can be also applied to partition dynamic graphs thanks to its lightweight runtime overhead. We evaluate the effectiveness and efficiency of Geo-Cut using real-world graphs with both real geo-distributed DCs and simulations. Evaluation results show that Geo-Cut can reduce the inter-DC data transfer time by up to 79% (42% as the median) and reduce the monetary cost by up to 75% (26% as the median) compared to state-of-the-art graph partitioning methods with a low overhead.

1 May 2022 in Future Generation Computer Systems
Verified
Journal Article
Closed access
YXYao Xiao
Yao Xiao
AZAmelie Chi Zhou
Amelie Chi Zhou
XYXuan Yang
Xuan Yang
BHBingsheng He
Bingsheng He

22 June 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AZAmelie Chi Zhou
Amelie Chi Zhou
WXWeilin Xue
Weilin Xue
YXYao Xiao
Yao Xiao
BHBingsheng He
Bingsheng He
SIShadi Ibrahim
Shadi Ibrahim
Reynold C.K. ChengReynold C.K. Cheng
Reynold C.K. Cheng
In many data-intensive applications, workflow is often used as an important model for organizing data processing tasks and resource provisioning is an important and challenging problem for improving the performance of workflows. Recently, system variations in the cloud and large-scale clusters, such as those in I/O and network performances and failure events, have been observed to greatly affect the performance of workflows. Traditional resource provisioning methods, which overlook these variations, can lead to suboptimal resource provisioning results. In this paper, we provide a general solution for workflow performance optimizations considering system variations. Specifically, we model system dynamics as time-dependent random variables and take their probability distributions as optimization input. Despite its effectiveness, this solution involves heavy computation overhead. Thus, we propose three pruning techniques to simplify workflow structure and reduce the probability evaluation overhead. We implement our techniques in a runtime library, which allows users to incorporate efficient probabilistic optimization into existing resource provisioning methods. Experiments show that probabilistic solutions can improve the performance by up to 65% compared to state-of-the-art static solutions, and our pruning techniques can greatly reduce the overhead of our probabilistic approach.

3 April 2025 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
HTHaobin Tan
Haobin Tan
YXYao Xiao
Yao Xiao
AZAmelie Chi Zhou
Amelie Chi Zhou
KLKezhong Lu
Kezhong Lu
XYXuan Yang
Xuan Yang
Graph partitioning is of great importance to optimizing the performance and cost of geo-distributed graph analytics applications. However, it is non-trivial to obtain efficient and effective partitioning due to the challenges brought by the large graph scales, dynamic graph changes and the network heterogeneity in geo-distributed data centers (DCs). Existing studies usually adopt heuristic-based methods to achieve fast and balanced partitioning for large graphs, which are not powerful enough to address the complexity in our problem. Further, graph structures of many applications can change at various frequencies. Dynamic partitioning methods usually focus on achieving low latency to quickly adapt to changes, which unfortunately sacrifices partitioning effectiveness. Also, such methods are not aware of the dynamicity of graphs and can over sacrifice effectiveness for unnecessarily low latency. To address the limitations of existing studies, we propose DistRLCut, a novel graph partitioner which leverages Multi-Agent Reinforcement Learning (MARL) to solve the complexity of the partitioning problem. To achieve fast partitioning for large graphs, DistRLCut adapts MARL to a distributed implementation which significantly accelerates the learning process. Further, DistRLCut incorporates two techniques to trade-off between partitioning effectiveness and efficiency, including local training and agent sampling. By adaptively tuning the number of local training iterations and the agent sampling rate, DistRLCut is able to achieve good partitioning results within an overhead constraint required by graph dynamicity. Experiments using real cloud DCs and real-world graphs show that, compared to state-of-the-art static partitioning methods, DistRLCut improves the performance of geo-distributed graph analytics by 11%-95%. DistRLCut can partition over 28 million edges per second, showcasing its scalability for large graphs. With varying graph changing frequencies, DistRLCut can improve the performance by up to 71% compared to state-of-the-art dynamic partitioning.