= Acronimul Proiectului: pgraph =
 
 * Nume scurt:  '''pgraph'''
 * SVN: https://svn-batch.grid.pub.ro/svn/PP2009/proiecte/pgraph
 * Membrii echipei:Antonio-Gabriel Sturzu-asturzu, Adela-Diana Almasi, Alexandrina Floroiu;
 * Descriere proiect: The purpose of this project is to try to parallelize some graph algorithms and see how well they scale 

== Activitate proiect ==

== Technologies we used ==

 * [https://computing.llnl.gov/tutorials/openMP/] (OPENMP)
 * [https://computing.llnl.gov/tutorials/mpi/] (MPI)
 * Languages: C/C++

== Steps ==

1.Search and see which graph algorithms can be parallelized

2.Implement the serial versions of the graph algorithms we chose

3.Test the correctness of the serial algorithms using some online
evaluators.We used the one on [http://infoarena.ro/]

4.Build case tests with some hand made generators to verify 
the correctness and performance of the parallel [[BR]]  algorithms that will be implemented

5.Implement in OpenMP and MPI the parallel versions of the graph algorithms

6.Test the performance and correctness of the parallel algorithms on the fep cluster


== Results ==

The results we obtained are in the powerpoint presentation located [[BR]] in the svn repository
in the folder named Presentation.

== References ==

All the articles and books that we used are on the svn repository in the
Documentation folder.[[BR]]They include articles on distributed algorithms for graphs,
some articles on parallel CREW PRAM[[BR]] algorithms for graphs and the CLR Introduction
to Algorithms book(doesn't need any introduction)[[BR]] which was the main reference 
for the serial algorithms.