Applications :

		1> FFT
		2> Sorting
		3> Matrix multiplication
		4> N queens problem

1> FFT 

   i> Required files :

		a> fftmaster.java
		b> fftworker.java

	ii> Execution
      * In one window run the JMPFServer using the command
         <cdacb>/usr1/java/JMPF>java JMPFServer
		* In second window run the fftmaster using command
			<cdacb>/usr1/java/JMPF>java fftmaster
		* In next 4 windows run the fftworker alongwith the process-id using the command
			<cdacb>/usr1/java/JMPF>java fftworker 0
 			<cdacb>/usr1/java/JMPF>java fftworker 1
			<cdacb>/usr1/java/JMPF>java fftworker 2
			<cdacb>/usr1/java/JMPF>java fftworker 3

		* Enter the number of elements the fftmaster as 4 since 4 workers are there.
		* Enter the values of each.

2> Sorting

   i> Required files :

      a> sortmst.java
      b> sortwrk.java
 		c> generate.c
		d> data files (say) file1, file2.. etc.

   ii> Execution
      * In one window run the JMPFServer using the command
         <cdacb>/usr1/java/JMPF>java JMPFServer

		* COmpile the generate.c file and execute it for generating the list of numbers for sorting.  Store the first set of files in (say) file1 and next set of numbers in another file (say) file2.

      * In second window run the sortmst using command
         <cdacb>/usr1/java/JMPF>java sortmst 

      * In next 2 windows run the sortwrk alongwith the process-id using the command
         <cdacb>/usr1/java/JMPF>java sortwrk 0
         <cdacb>/usr1/java/JMPF>java sortwrk 1

      * Enter the file names to sort as file1 and file2 and destination file to put the output as (say) file3 (2 workers since 2files are there to sort).

3> Matrix multiplication 
 
   i> Required files :
 
      a> matrixmaster.java
      b> matrixworker.java
 
   ii> Execution
      * In one window run the JMPFServer using the command
         <cdacb>/usr1/java/JMPF>java JMPFServer

      * In second window run the matrixmaster using command
         <cdacb>/usr1/java/JMPF>java matrixmaster

		* Enter the number of rows and columns in first matrix A as (say) 3.

		* Enter the number of rows and columns in second matrix B as (say) 3.

		* Enter the elements of each matrices A and B.

      * In next 3 windows run the matrixworker alongwith the process-id (since the matrices to multiply is a 3X3 matrix.
using the command since the matrices to multiply is a 3X3 matrix.
         <cdacb>/usr1/java/JMPF>java matrixworker 0
         <cdacb>3usr1/java/JMPF>java matrixworker 1
         <cdacb>/usr1/java/JMPF>java matrixworker 2

4> N queen's problem 
 
   i> Required files :

      a> queenmaster.java
      b> queenworker.java
		c> gui.java
		d> gui.html

   ii> Execution
      * In one window run the JMPFServer using the command
         <yamuna>/usr1/java/JMPF>java JMPFServer

      * In second window run the queenmaster using command
         <yamuna>/usr1/java/JMPF>java queenmaster

      * In next 4 windows run the queenworker alongwith the process-id using the command
         <yamuna>/usr1/java/JMPF>java queenworker 1
         <yamuna>/usr1/java/JMPF>java queenworker 2
         <yamuna>/usr1/java/JMPF>java queenworker 3
         <yamuna>/usr1/java/JMPF>java queenworker 4

      * Enter the size of the chess board (in excuting queenmaster window) as (say) 4. since 4 workers are there.
        (At present the queen master supporting only size 4 but queen worker will support N size.  As soon as I get the loop for N queens I will send it to you Sir).

      * Execute the gui.html in another window using the command
			<yamuna>/usr1/java/JMPF>appletviewer gui.html

Note : When JMPFServer is running in cdacb the java.hpc should be 202.141.63.1
       When JMPFServer is running in yamuna the java.hpc should be 202.141.63.191


