Thanks to visit codestin.com
Credit goes to github.com

Skip to content

manishc1/Gossip

Repository files navigation

Advanced Operating System Project

Gossip Algorithm Implementation

Group Members : 1. Amol Deshpande		amold1
	  		  	2. Bharat Prakash		bhp1
				3. Manish Chavan		manishc1

Directions

1. Two ways to start

   	   	a. spawner:start(operation to perform , # of nodes , # of fragments , input file)
		   		i. If input file is absent or the operation is invalid, error will be thrown and will have to start all over again.

		b. spawner:start(# of nodes , # of fragments , input file)
		   		i. If input file is absent, error will be thrown and will have to start all over again.
				ii. Then an appropriate function can be called to do operation (refer the menu).
					Eg, findMax() , updateFragment(FragmentId , [10.5 , 13.65]).

2. It is desirable that in a single execution, only one operation is computed.
   Though the distinct operations can be computed in single execution

3. Output will be directed to "operation + # of node .csv" in same drectory.
   Eg, max100.csv for max calculation for 100 nodes.
   The Output are of the form
   	   	Operation , Name of the node , # number of total messages , # number of total messages at last value , Value

4. Avg and Median are implemented with two approaches
   So for execution use two functions for each operation
   findAvg() and findFineAvg()
   findMedian() and findFineMedian()

About

Gossip Implementation

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages