README of directory simple:
===========================

simple.f : 

     Simple redution.

pi.f:

     Numerical integration for pi.

prime.f:

     Computation of number of primes in a range from 2 to N (input)

     For sieving the corresponding prime number is sent from the owner
     node to all other nodes

prime1.f:

     The primes that are used for sieving are replicated on all nodes.

Some examples (tests) for the prime number programs:

   100        25 primes
  1000       168 primes
 10000      1229 primes
100000      9592 primes

There should be no restrictions in the use of this examples.

lprime.f: simpler version of prime.f (no dynamic arrays, no array syntax)

ca.f:     One-dimensional cellular automata (Fortran 90 version)

Attention in node.f

         DO I=1,N
            HOST_FELD_SC1 = ADP_NODE_RECV_HA_L1()
            IF (HOST_FELD_SC1) THEN
            END IF
         END DO

   The function call might be removed if the optimization assumes that
   this function call has no side effect, but actually it has.

Output is:

                                       *                                       
                                      * *                                      
                                     *   *                                     
                                    * * * *                                    
                                   *       *                                   
                                  * *     * *                                  
                                 *   *   *   *                                 
                                * * * * * * * *                                
                               *               *                               
                              * *             * *                              
                             *   *           *   *                             
                            * * * *         * * * *                            
                           *       *       *       *                           
                          * *     * *     * *     * *                          
                         *   *   *   *   *   *   *   *                         
         ...........................................................
         ...........................................................
         ...........................................................
         ...........................................................
       *             *                                   *             *       
      * *           * *                                 * *           * *      
     *   *         *   *                               *   *         *   *     
    * * * *       * * * *                             * * * *       * * * *    
HOST STOP 
