
   Description of the test
   ========================

   This test executes the parallel cholesky factorization
   using one-dimensional array of processes. 

   The matrix distribution used is naive one-dimensional 
   homogeneous distribution using horizontal striping of matrices.

   This test uses MPI. This test uses all the processe available for
   computation.
   
   The time of execution of the algorithm is returned.

   Files
   -----

   cholesky.c ----> Contains the algorithm execution code
   counter.h  ----> Contains the parameters:
                   Size of the problem

   HOW TO RUN
   ----------

   shell$ hmpibcast cholesky.c cholesky_i.c cholesky_i.h counter.h

   shell$ hmpiload -o cholesky cholesky.c

   shell$ hmpirun cholesky
   N=1000, p=4, time(sec)=3.654564055
