research-article

A comparison of alternatives for communicating with spawned processes

Authors:

Nicholas Radcliffe,

Layne Watson,

Masha SosonkinaAuthors Info & Claims

ACMSE '11: Proceedings of the 49th annual ACM Southeast Conference

Pages 132 - 137

https://doi.org/10.1145/2016039.2016078

Published: 24 March 2011 Publication History

Get Access

Abstract

Motivated by prior work with the global optimization algorithm pVTDIRECT95 [2], this paper considers two methods for simplifying communication with spawned processes. Tests are performed for each method, and mean runtimes and standard deviations for the two methods are compared. In general, the performance of the two methods is quite similar, although other aspects of each method set the methods apart. In particular, restrictions on how the spawning has to be done determines the practicality of the method.

References

[1]

D. R. Jones, C. D. Perttunen, B. E. Stuckman. 1993, "Lipschitzian Optimization without the Lipschitz Constant," Journal of Optimization Theory and Applications, 79, no. 1, 157--181.

Digital Library

Google Scholar

[2]

J. He, L. T. Watson, M. Sosonkina. 2009, "Algorithm 897: VTDIRECT95: Serial and Parallel Codes for the Global Optimization Algorithm DIRECT," ACM Transactions on Mathematical Software, 36, no. 3, 1--24.

Digital Library

Google Scholar

[3]

L. T. Watson, C. A. Baker. 2001, "A Fully-distributed Parallel Global Search Algorithm," Engineering Computations, 18, no. 1--2, 155--169.

Crossref

Google Scholar

[4]

B. Barney. (2010, October 12). Introduction to Parallel Computing. Retrieved from https://computing.-llnl.gov/tutorials/parallel_comp/.

Google Scholar

[5]

W. Gropp, R. Thakur, E. Lusk. 1999, Using Mpi-2: Advanced Features of the Message Passing Interface (1st ed.), MIT Press, Cambridge, MA, USA.

Digital Library

Google Scholar

[6]

M. Snir, S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra. 1998, MPI---The Complete Reference, Volume 1: The MPI Core (2nd. (Revised) ed.), MIT Press, Cambridge, MA, USA.

Digital Library

Google Scholar

Cited By

View all

Carretero Perez JMartín-Álvarez IAliaga JCastillo MIserte SMayo R(2024)Dynamic spawning of MPI processes applied to malleabilityInternational Journal of High Performance Computing Applications10.1177/1094342023117652738:2(69-93)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1177/10943420231176527
Aliaga JCastillo MIserte SMartín-Álvarez IMayo R(2022)A Survey on Malleability Solutions for High-Performance Distributed ComputingApplied Sciences10.3390/app1210523112:10(5231)Online publication date: 22-May-2022
https://doi.org/10.3390/app12105231
Martín GSingh DMarinescu MCarretero J(2015)Enhancing the performance of malleable MPI applications by using performance-aware dynamic reconfigurationParallel Computing10.5555/2794085.279414746:C(60-77)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.5555/2794085.2794147

Index Terms

A comparison of alternatives for communicating with spawned processes
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Communications management
        Process management

Recommendations

Multicore Scheduling for Lightweight Communicating Processes
COORDINATION '09: Proceedings of the 11th International Conference on Coordination Models and Languages

Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically composed of a large number of small isolated concurrent components. These ...
Multicore scheduling for lightweight communicating processes

Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A typical process-oriented design involves the composition of a large number of small isolated component ...
Synchronization of communicating processes

Formalization of a well-defined synchronization mechanism can be used to prove that concurrently running processes of a system communicate correctly. This is demonstrated for a system consisting of many sending processes which deposit messages in a ...

Comments

Information & Contributors

Information

Published In

ACMSE '11: Proceedings of the 49th annual ACM Southeast Conference

March 2011

399 pages

ISBN:9781450306867

DOI:10.1145/2016039

Conference Chair:
Victor Clincy
Kennesaw State University
,
General Chairs:
Ken Hoganson
Kennesaw State University
,
Jose Garrido
Kennesaw State University
,
Program Chair:
Venu Dasigi
Southern Polytechnic State University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Conference

ACM SE '11

Sponsor:

ACM SE '11: ACM Southeast Regional Conference

March 24 - 26, 2011

Georgia, Kennesaw

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
65
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Carretero Perez JMartín-Álvarez IAliaga JCastillo MIserte SMayo R(2024)Dynamic spawning of MPI processes applied to malleabilityInternational Journal of High Performance Computing Applications10.1177/1094342023117652738:2(69-93)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1177/10943420231176527
Aliaga JCastillo MIserte SMartín-Álvarez IMayo R(2022)A Survey on Malleability Solutions for High-Performance Distributed ComputingApplied Sciences10.3390/app1210523112:10(5231)Online publication date: 22-May-2022
https://doi.org/10.3390/app12105231
Martín GSingh DMarinescu MCarretero J(2015)Enhancing the performance of malleable MPI applications by using performance-aware dynamic reconfigurationParallel Computing10.5555/2794085.279414746:C(60-77)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.5555/2794085.2794147

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Multicore Scheduling for Lightweight Communicating Processes

Multicore scheduling for lightweight communicating processes

Synchronization of communicating processes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations