AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (4.4 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access | Just Accepted

Stage-aware Bayesian-guided evolutionary algorithm for resource constrained serverless MapReduce scheduling

Chuanzhi Chen1, Hongyan Sang1( ), Biao Zhang1, Jinquan Zhang2, Hengwei Guo3

1 School of Artificial Intelligence and Computer Science, Liaocheng University, Liaocheng 252000, China

2 School of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China

3 School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China

Show Author Information

Abstract

Serverless computing features instant elasticity and fine-grained billing. It has emerged as a prominent paradigm for big data processing such as log analysis and monitoring. However, scheduling MapReduce jobs under serverless resource constraints is challenging because the stateless nature of functions conflicts with MapReduce stage dependencies, which increases scheduling complexity. Existing research has not adequately captured these structural constraints, causing traditional evolutionary algorithms to explore the search space inefficiently. This study addresses the MapReduce scheduling problem under serverless resource constraints with the objective of minimizing the makespan. Accordingly, a stage-aware Bayesian-guided evolutionary algorithm (BGA) is proposed that, unlike traditional evolutionary algorithms, guides evolution through Bayesian learning from elite patterns. First, a mixed-integer programming model is formulated to unify temporal and precedence constraints. Second, a Bayesian probability model for assigning tasks to function instances guides evolutionary sampling using elite patterns, reducing inefficient search. Finally, dependency-aware crossover is integrated with adaptive variable neighborhood search to ensure feasibility and enhance local exploitation. Experimental results show that BGA consistently achieves the lowest makespan among compared methods, with Relative Percentage Deviation (RPD) remaining within 2.40%-3.92%.

References

【1】
【1】
 
 
Tsinghua Science and Technology

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Chen C, Sang H, Zhang B, et al. Stage-aware Bayesian-guided evolutionary algorithm for resource constrained serverless MapReduce scheduling. Tsinghua Science and Technology, 2026, https://doi.org/10.26599/TST.2026.9010102

71

Views

2

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 01 April 2026
Revised: 25 August 2026
Accepted: 13 November 2026
Available online: 18 November 2026

© The author(s) 2026.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).