Research Article
Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm
|
International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
|
| Volume 4 - Issue 8 |
| Published: December 2012 |
| Authors: E. M. Badr |
10.5120/ijais12-450735
|
E. M. Badr . Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm. International Journal of Applied Information Systems. 4, 8 (December 2012), 1-6. DOI=10.5120/ijais12-450735
@article{ 10.5120/ijais12-450735,
author = { E. M. Badr },
title = { Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm },
journal = { International Journal of Applied Information Systems },
year = { 2012 },
volume = { 4 },
number = { 8 },
pages = { 1-6 },
doi = { 10.5120/ijais12-450735 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A E. M. Badr
%T Some Computational Results on MPI Parallel Implementation of Derived Subgraph Algorithm%T
%J International Journal of Applied Information Systems
%V 4
%N 8
%P 1-6
%R 10.5120/ijais12-450735
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The aim of this paper is to present an experimental evaluation of a parallel derived subgraph algorithm PDSA using MPI. The performance of the algorithm PDSA is verified by computational experiments on some special graphs with different size, run in a cluster of workstations. MPI seems to be appropriate for these kind of experiments as the results are reliable and efficient.
References
- I. Rival (Ed. ), Graphs And Order, Reidel, Dordrecht-Boston,(1985), p. 25.
- R. P. Stanley, Enumerative Combinatorics, vol. I, Wadsworth & Broks/Cole, Belmont, CA, (1986).
- B. Poonen, Union-Closed Families, J. Combin. Theory, A 59 (1992), 253-268.
- M. H. El-Zahar , A Graph-Theoretic Version Of The Union-Closed Sets Conjecture, J. Graph Theory 26 (1997), no. 3, 155-163.
- B. Llano, J. Montellano-Ballesteros, E. Rivera-Campo and R. Strauz " On Conjecture of Frankl and El-Zahar" J. Graph Theory 57: 344-352 (2008).
- M. I. Moussa and E. M. Badr, A Computational Study for the Graph-Theoretic Version of the Union-Closed Sets Conjecture, International Journal of Computer Applications, Volume 50 – No. 12, July 2012.
- I. Foster, Desiging and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley, 1995.
- W. Groop, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message Passing-Interface. MIT Press, 1994.
- E. M. Badr, M. I. Moussa, K. Paparrizos, N. Samaras and A. Sifaleras, Some Computational results on MPI Parallel Implementations of Dense Simplex Methods, Transactions on Engineering, Computing and Technology, vol. 17, pp. 228-231, 2006.
Index Terms
Keywords