Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhenxu Fan

dblp:424/0595 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-2902-5020ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 61% Embedded and real-time systems · 30% High-performance computing · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.912025
Improved NSGA-II Using Q-Learning and Shortest Workflow First for Tri-Objective Large-Scale Heterogeneous Multi-Workflow Scheduling · IEEE Trans. Serv. Comput. 2025
Embedded and real-time systems › real-time scheduling
multi-objective scheduling
0.912025
Improved NSGA-II Using Q-Learning and Shortest Workflow First for Tri-Objective Large-Scale Heterogeneous Multi-Workflow Scheduling · IEEE Trans. Serv. Comput. 2025
Cloud and datacenter computing
workflow scheduling
0.912025
Improved NSGA-II Using Q-Learning and Shortest Workflow First for Tri-Objective Large-Scale Heterogeneous Multi-Workflow Scheduling · IEEE Trans. Serv. Comput. 2025
High-performance computing
scientific computing systems
0.312025
Improved NSGA-II Using Q-Learning and Shortest Workflow First for Tri-Objective Large-Scale Heterogeneous Multi-Workflow Scheduling · IEEE Trans. Serv. Comput. 2025

Methods — techniques the papers use, named apart from their topics

q-learning · 0.9genetic algorithm · 0.9NSGA-II · 0.9
YearPublicationVenuePosition
2025 Improved NSGA-II Using Q-Learning and Shortest Workflow First for Tri-Objective Large-Scale Heterogeneous Multi-Workflow Scheduling
abstract
In recent years, as the demand for computing power in scientific computing has progressively increased, thfige scale of scientific applications has also grown, at the same time the number of cloud platform tenants is also expanding dramatically, cloud platforms often need to handle multiple large-scale heterogeneous workflows at the same time. Moreover, the rapid increment in the scale and performance of cloud computing centers has brought about even greater energy consumption, a large number of studies for multi-objective task scheduling usually focus on cost and makespan as the optimization objectives but often neglect the optimization of energy consumption. In order to solve the above problems, a shortest workflow first adaptive fast nondominated sorting genetic algorithm (SWFAGA) is proposed. First, a shortest workflow first workflows combinatorial encoding method is proposed which can encode multiple workflows as chromosomes based on the heterogeneity of workflows. Second, an adaptive crossover strategy based on Q-learning to improve the convergence speed without adding extra time overhead. In addition, a reference point-based convergence calculation method is devised. Finally, through the heterogeneous large-scale real-world multi-workflow, SWFAGA is verified to outperform state-of-the-art multi-objective optimization scheduling algorithms in terms of operational efficiency, stability, convergence, and diversity.
Yong Wang 0076, Zhenxu Fan, Gaige Wang
IEEE Trans. Serv. Comput.2