Python-based social science applications’ profiling and optimization on HPC systems using task and data parallelism
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2023.14.3.48Keywords:
Python-based social science applications, High-performance computing systems, task and data parallelism, Optimization methodology, Machine learning model evaluationDimensions Badge
Issue
Section
License
Copyright (c) 2023 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This research addresses the pressing need to optimize Python-based social science applications for high-performance computing (HPC)Abstract
systems, emphasizing the combined use of task and data parallelism techniques. The paper delves into a substantial body of research,
recognizing Python’s interpreted nature as a challenge for efficient social science data processing. The paper introduces a Python
program that exemplifies the proposed methodology. This program uses task parallelism with multi-processing and data parallelism
with dask to optimize data processing workflows. It showcases how researchers can effectively manage large datasets and intricate
computations on HPC systems. The research offers a comprehensive framework for optimizing Python-based social science applications
on HPC systems. It addresses the challenges of Python’s performance limitations, data-intensive processing, and memory efficiency.
Incorporating insights from a rich literature survey, it equips researchers with valuable tools and strategies for enhancing the efficiency
of their social science applications in HPC environments.
How to Cite
Downloads
Similar Articles
- V Babydeepa, K. Sindhu, A hybrid feature selection and generative adversarial network for lung and uterus cancer prediction with big data , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Raja Selvaraj, Manikandasaran S. Sundari, EAM: Enhanced authentication method to ensure the authenticity and integrity of the data in VM migration to the cloud environment , The Scientific Temper: Vol. 14 No. 01 (2023): The Scientific Temper
- G. Vijayalakshmi, M. V. Srinath, Student’s Academic Performance Improvement Using Adaptive Ensemble Learning Method , The Scientific Temper: Vol. 16 No. 11 (2025): The Scientific Temper
- Sharada C, T N Ravi, S Panneer Arokiara, Lancaster sliced regressive keyword extraction based semantic analytics on social media documents , The Scientific Temper: Vol. 16 No. 08 (2025): The Scientific Temper
- S. Ramkumar, K. Aanandha Saravanan, Martin Joel Rathnam, M. Revathy, Integration of AI and agent-based modeling for simulating human-ecological systems , The Scientific Temper: Vol. 16 No. 03 (2025): The Scientific Temper
- Bommaiah Boya, Premara Devaraju, Integrating clinical and ECG data for heart disease prediction: A hybrid deep learning approach based on two modalities with particle swarm optimization , The Scientific Temper: Vol. 16 No. 05 (2025): The Scientific Temper
- A. Basheer Ahamed, M. Mohamed Surputheen, M. Rajakumar, Quantitative transfer learning- based students sports interest prediction using deep spectral multi-perceptron neural network , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- G. Deena, K. Raja, M. Azhagiri, W.A. Breen, S. Prema, Application of support vector classifier for mango leaf disease classification , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- S. Aasha, R. Sugumar, Lightweight Feature Selection Method using Quantum Statistical Ranking and Hybrid Beetle-Bat Optimization for Smart Farming , The Scientific Temper: Vol. 16 No. 09 (2025): The Scientific Temper
- J. Fathima Fouzia, M. Mohamed Surputheen, M. Rajakumar, Hybrid pigeon optimization-based feature selection and modified multi-class semantic segmentation for skin cancer detection (HPO-MMSS) , The Scientific Temper: Vol. 16 No. 05 (2025): The Scientific Temper
<< < 1 2 3 4 5 6 7 8 9 10 > >>
You may also start an advanced similarity search for this article.

