1. Read the copyright notice that appears in file copy
2. Go to ai.h file
   and decide whether you want to compile
   for BSPlib or LAM-MPI and def/undef statements accordingly.
3. Go to file bt.c (multiplicative binomial tree parallel valuation) 
   or  gbt.c (general additive binomial tree parallel valuation) 
   to decide whehter to use American or European style 
   and PUT or CALL option valuations.
4. You are ready to compile
   Edit Makefile and uncomment
   one of the BT=bt  BT=gbt lines to indicate whether
   you want to compile on or the other valuation (multiplicative or
   general additive). Save and exit.
5. Compile using
   % make allbsp
   for BSPlib
   % make allmpi
   for LAM-MPI
6. Ready to run.

7. In BSPlib i run the executable bspbt for example by issuing
   bsprun -noload -local -npes 16 bspbt 32 8192 <mdata

   where  32 : is the block factor b. For more informations read the
   paper "Architecture independent parallel binomial tree option 
   price valuations" by A. Gerbessiotis.
   8192 : is the horizon
   mdata: is data-file for the option.
   mdata has the same format as the file used for the 
   sequential binomial tree valuation program. Read the information
   in option02.tar that can be found elsewhere in this site.
   An example mdata is also provided.
8. In LAM-MPI i run the executabl mpibt for example by issuing
   mpirun -np 16 mpibt 32 8192 <mdata
9. Good Luck!
