1 / 9

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

huela
Télécharger la présentation

Raymond'S Tree DMX Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Wesley Thomas Raymond'S Tree DMX Algorithm

  2. 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

  3. 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

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

  5. 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

  6. Results

  7. Results Cont.

  8. 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).

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

More Related