Raymond'S Tree DMX Algorithm Wesley Thomas Raymond'S Tree DMX Algorithm

Raymond’s Overview Token based DMX Works only on logical tree networks Processes send requests towards token holder Requests are queue at neighboring processes Tokens are sent towards first requestors

Experimental Setup 50 processes Average load 25 processes request CS from start Varying tree heights from 2 to 100 10 runs for each tree height Trees are built by creating a chain with the specified height and randomly adding children until process limit is reached

Tree Generation 1 10 2 3 12 9 4 5 8 7 6 11 Example: Height = 6 Process Count = 12

Experimental Setup Continued Measuring Time and Messages Time is measured as number of steps Steps are counted when a process does the following: Request CS Enter CS Exit CS Send Token Receive Request Receive Token

Results

Results Cont.

Conclusions Time is a trivial measurement when also measuring number of messages Very small tree heights have an advantage as the number of messages passed is less than in trees with larger heights Trees that are 2 in height average 1.78 messages per process It appears that as systems move closer to chain-like topologies, the number of messages increase (slowly).

Future Work Use different process counts Use different loads and run loads during different times of the simulation