Aasish Kumar Sharma is a researcher/scientific employee at Göttingen University employed under Professor Dr. Julian Kunkel and is focusing in high-performance computing performance optimization. His work includes developing efficient task scheduling algorithms for HPC systems, published in leading journals. Aasish is particularly interested in scalable solutions for heterogeneous architectures and has collected some publications and received the NHR Research Scholarship Award for his contributions. He is interested in optimization applying different smart algorithms, and emerging technologies like Artificial Intelligence/ Machine Learning (AI/ML) and Quantum Computing (QC) techniques. His previous work includes data engineering and big data analysis, and SQL query optimization while working as a Database Administrator. He is also a Microsoft Certified Trainer for Microsoft SQL Query Optimization for year 2025.
ResearchGate
Accurate benchmarking is a prerequisite for meaningful workload mapping and scheduling research. This thesis focuses on designing and executing systematic benchmarks for heterogeneous HPC systems using workflow-based workloads. The student will characterize system properties (compute, memory, I/O, network) and workload behavior (task duration, data transfer, dependencies) using real and synthetic workflows. The outcome will be a reproducible benchmarking methodology and datasets that can be used as ground truth for evaluating optimization and AI-based schedulers.
Exact solvers provide optimal solutions but scale poorly, while learning-based methods scale well but lack guarantees. This thesis investigates hybrid scheduling strategies that combine MILP or CP-SAT solutions on small subproblems with learning-based generalization for larger workflows. The focus is on feasibility preservation and performance trade-offs.
This thesis explores quantum-inspired optimization techniques, such as QUBO formulations, for workflow mapping problems in heterogeneous HPC environments. The student will translate classical scheduling constraints into QUBO models and compare solution feasibility and scalability against classical solvers.
As AI-driven schedulers increasingly influence resource allocation decisions, ethical considerations such as fairness, transparency, and accountability become critical. This thesis examines ethical risks in automated HPC scheduling and proposes evaluation criteria or design guidelines for responsible scheduling systems, grounded in real HPC use cases.
Constraint programming and mixed-integer linear programming are widely used for exact workflow scheduling but exhibit different scalability and modeling trade-offs. This thesis implements and compares MILP and CP-SAT formulations for workflow mapping and scheduling under heterogeneous resource constraints. The student will evaluate solution quality, feasibility guarantees, and solver performance across increasing problem sizes.
This project investigates how heterogeneous system resources and workflow characteristics can be modeled in a structured and extensible manner. The student will design data models for nodes, tasks, features, and performance properties, aligned with real HPC schedulers and workflow managers. The work emphasizes practical modeling choices that balance expressiveness and solvability, and results in machine-readable system and workload descriptions usable by optimization solvers.
All publications as BibTex