Minghui Wu

Minghui Wu

Auto-generated profile, based on publicly available information

Minghui Wu

School of Information Engineering, China University of Geosciences, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
29 March 2024 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
JYJianguo Yu
Jianguo Yu
LGLin Ge
Lin Ge
MWMinghui Wu
Minghui Wu

29 March 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
MWMinghui Wu
Minghui Wu
YZYuqing Zhang
Yuqing Zhang
JYJianguo Yu
Jianguo Yu
ZZZhangbing Zhou
Zhangbing Zhou

14 December 2024 in Future Generation Computer Systems
Verified
Journal Article
Closed access
MWMinghui Wu
Minghui Wu
DSDawei Sun
Dawei Sun
SGShang Gao
Shang Gao
RBRajkumar Buyya
Rajkumar Buyya

3 June 2025 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MWMinghui Wu
Minghui Wu
DSDawei Sun
Dawei Sun
SGShang Gao
Shang Gao
Keqin LiKeqin Li
Keqin Li
RBRajkumar Buyya
Rajkumar Buyya
Load imbalance can lead to the emergence of stragglers, i.e., join instances that significantly lag behind others in processing data streams. Currently, state-of-the-art solutions are capable of balancing the load between join instances to mitigate stragglers by managing hot keys and random partitioning. However, these solutions rely on either complicated routing strategies or resource-inefficient processing structures, making them susceptible to frequent changes in load between instances. Therefore, we present Ls-Stream, a data stream scheduler that aims to support dynamic workload assignment for join instances to lighten stragglers. This paper outlines our solution from the following aspects: (1) The models for partitioning, communication, matrix, and resource are developed, formalizing problems like imbalanced load between join instances and state migration costs. (2) Ls-Stream employs a two-level routing strategy for workload allocation by combining hash-based and key-based data partitioning, specifying the destination join instances for data tuples. (3) Ls-Stream also constructs a fine-grained model for minimizing the state migration cost. This allows us to make tradeoffs between data transfer overhead and migration benefits. (4) Experimental results demonstrate significant improvements made by Ls-Stream: reducing maximum system latency by 49.3% and increasing maximum throughput by more than 2x compared to existing state-of-the-art works.

6 September 2025 in Future Generation Computer Systems
Verified
Journal Article
Closed access
YFYinuo Fan
Yinuo Fan
DSDawei Sun
Dawei Sun
MWMinghui Wu
Minghui Wu
SGShang Gao
Shang Gao
RBRajkumar Buyya
Rajkumar Buyya

11 November 2026 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MWMinghui Wu
Minghui Wu
DSDawei Sun
Dawei Sun
SGShang Gao
Shang Gao
Keqin LiKeqin Li
Keqin Li
RBRajkumar Buyya
Rajkumar Buyya