Optimizing Scientific Simulations with Python-Driven Parallelism on Azure Batch: A Hybrid Cloud Architecture for High-Performance Computing
Bibliographic record
Abstract
Scientific computing applications often demand high-performance environments capable of processing large-scale simulations with precision and speed. This paper presents a hybrid cloud architecture that integrates on-premise systems with Microsoft Azure Batch to execute computationally intensive scientific workloads. By leveraging Python-based parallelism libraries such as Dask and multiprocessing, the framework enables scalable and distributed execution of simulation tasks without the complexity of manual resource orchestration. Azure Batch is utilized to provision and manage compute pools dynamically, offering elasticity, job queuing, and auto-scaling for cost-effective resource utilization. A robust job submission pipeline is designed using Azure Storage, Python APIs, and Azure Queue, facilitating seamless data ingestion and result aggregation. The architecture is validated through experiments simulating fluid dynamics and material science models, showcasing significant reductions in execution time compared to traditional single-node processing. The results confirm the viability of the proposed system in accelerating time-to-insight for research-intensive applications. This study contributes a modular, cloud-optimized approach for high-performance scientific simulations that minimizes infrastructure overhead while maintaining computational rigor and reproducibility
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".