CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Dynamic Scheduling Algorithm for Spawn Processes in MPI-2 to Improve and Maintain Load Balancing

by Sherif Abdelazim Embaby, Ahmed Shawky Moussa, Ibrahim Farag
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 106 - Number 12
Year of Publication: 2014
Authors: Sherif Abdelazim Embaby, Ahmed Shawky Moussa, Ibrahim Farag
10.5120/18569-6055

Sherif Abdelazim Embaby, Ahmed Shawky Moussa, Ibrahim Farag . A Dynamic Scheduling Algorithm for Spawn Processes in MPI-2 to Improve and Maintain Load Balancing. International Journal of Computer Applications. 106, 12 ( November 2014), 1-6. DOI=10.5120/18569-6055

@article{ 10.5120/18569-6055,
author = { Sherif Abdelazim Embaby, Ahmed Shawky Moussa, Ibrahim Farag },
title = { A Dynamic Scheduling Algorithm for Spawn Processes in MPI-2 to Improve and Maintain Load Balancing },
journal = { International Journal of Computer Applications },
issue_date = { November 2014 },
volume = { 106 },
number = { 12 },
month = { November },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume106/number12/18569-6055/ },
doi = { 10.5120/18569-6055 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:39:11.945453+05:30
%A Sherif Abdelazim Embaby
%A Ahmed Shawky Moussa
%A Ibrahim Farag
%T A Dynamic Scheduling Algorithm for Spawn Processes in MPI-2 to Improve and Maintain Load Balancing
%J International Journal of Computer Applications
%@ 0975-8887
%V 106
%N 12
%P 1-6
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Some parallel applications that solve big problems in fields like weather forecasting, data analysis, energy fields, and protein folding need to create unpredicted processes at the application run time. The MPI package provides capability to not only write static parallel programs but also to create dynamic processes at run time. However, the MPI standard did not provide any way to schedule these dynamically created processes. Online scheduling can be a solution for this problem. Hence, this work introduces an online scheduling algorithm for dynamically created processes on cluster's nodes according to the machines performance. The objective of the algorithm is to achieve dynamic load balancing along the scheduler run time over heterogeneous cluster's machines. In addition, the proposed scheduler achieves load balancing over heterogeneous hardware according to the current real-time state of the nodes even if the processors are responding to other parallel simultaneous schedulers or running other parallel or sequential programs.

References
  1. "mpi-2: Extensions to the message passing interface" message passing interface forum, 1997. http://www. mpiforum. org.
  2. M´arcia C Cera, Guilherme P Pezzi, Elton N Mathias, Nicolas Maillard, and Philippe O a Navaux. Improving the dynamic creation of processes in MPI-2. Lecture Notes in Computer Science, 4192/2006:247–255, 2006.
  3. MPICH Organization. http://www. mpich. org/.
  4. Pavan Balaji, Darius Buntinas, David Goodell, William Gropp, Jayesh Krishna, Ewing Lusk, and Rajeev Thakur. PMI : A Scalable Parallel Process-Management Interface for Extreme-Scale Systems.
  5. William Gropp, David Ashton, Darius Buntinas, and Brian Toonen. MPICH2 Installers Guide. 2009.
  6. M´arcia C Cera, Guilherme P Pezzi, Nicolas B Maillard, and Philippe O A Navaux. Scheduling Dynamically Spawned Processes in MPI-2.
  7. Edgar Gabriel, Graham E Fagg, and Jack J Dongarra. Evaluating the Performance of MPI-2 Dynamic Communicators and One-Sided Communication. pages 88–97, 2003.
  8. Peter Brucker and P Brucker. Scheduling algorithms, volume 3. Springer, 2007.
  9. William Saphir, Leigh Ann Tanner, and Bernard Traversat. Job Management Requirements for NAS Parallel Systems and Clusters. NAS Technical Report NAS-95-006, pages 1–19, 1995.
  10. Subramanian Kannan, Mark Roberts, Peter Mayes, Dave Brelsford, and Joseph Skovira. Workload Management with LoadLeveler. IBM Corporation, International Technical Support Organization, 2001.
  11. Condor Team. Condor R version 6. 8. 2 manual. 2006.
  12. Songnian Zhou, Xiaohu Zheng, Jingwen Wang, and Pierre Delisle. Utopia: a load sharing facility for large, heterogeneous distributed computer systems. Software: Practice and Experience, 23(12):1305–1336, 1993.
  13. W Gropp and E Lusk. Dynamic process management in an MPI setting. ProceedingsSeventh IEEE Symposium on Parallel and Distributed Processing, pages 530–533, 1995.
  14. Message Passing and Interface Forum. MPI : A Message-Passing Interface Standard. Forum American Bar Association, 8(UT-CS-94-230):647, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Spawn processes Dynamic scheduling Parallel processing MPI

Powered by PhDFocusTM