Kamalakanta Muduli

dblp:196/7619 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-4245-9149ORCID · verified

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
Parallel and multicore computing · 50% Cloud and datacenter computing · 44% Distributed systems · 6%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.912025
MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters · IEEE Trans. Serv. Comput. 2025
Parallel and multicore computing › task scheduling
dependency-aware scheduling
0.912025
MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters · IEEE Trans. Serv. Comput. 2025
Cloud and datacenter computing
job scheduling
0.912025
MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters · IEEE Trans. Serv. Comput. 2025
Parallel and multicore computing › task scheduling
learning-based scheduling
0.912025
MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters · IEEE Trans. Serv. Comput. 2025
Distributed systems › distributed machine learning
distributed training
0.312025
MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters · IEEE Trans. Serv. Comput. 2025
Parallel and multicore computing › parallel computing › parallel machine learning
parallel training
0.312025
MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters · IEEE Trans. Serv. Comput. 2025

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

massively parallel training · 0.9graph attention network · 0.9deep reinforcement learning · 0.9LSTM · 0.9
YearPublicationVenuePosition
2025 MPDA: A Massively Parallel Learning and Dependency-Aware Scheduling Algorithm for Data Processing Clusters
abstract
In the era of large-scale machine learning, largescale clusters are extensively used for data processing jobs. However, the state-of-the-art heuristic-based and Deep Rein-forcement Learning (DRL) based job scheduling mechanisms are facing challenges such as slow training speed and underexploitation of jobs' complex dependencies. We propose MPDA, a Massively Parallel learning and Dependency-Aware scheduling algorithm, consisting of a fast-training mechanism and a novel dependency-aware policy network, GATNetwork, to address these two challenges respectively. The fast-training mechanism is a two-level massively parallel training method that can significantly accelerate the training process and maximally utilize the resources of the cluster. Additionally, its decoupled learning and interacting design enables hybrid-workload training for MPDA, which guarantees the generalization and robustness of MPDA. The GATNetwork exploits the dependencies among stages/jobs using Graph Attention Network (GAT) and Long Short-Term Memory (LSTM) networks to improve the performance of the scheduling policy. The experiments show that MPDA accelerates the training speed by one to two orders of magnitude and achieves better scheduling performance, i.e., lower average job completion time, compared with existing scheduling algorithms.
Qing Li 0006, Xingchi Chen, Fa Zhu, Achyut Shankar, Fayez Alqahtani 0001, Kamalakanta Muduli, Bo Yi 0002, Yong Jiang 0001
IEEE Trans. Serv. Comput.7