Consider a xed number of par8cipants and two types of

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ndersa, , Jochen Specka, , Jesper Larsson Träff hCp://www.sciencedirect.com/science/ar8cle/pii/S0167819109000957 •  1: Using the LogP/LogGP model evaluate the cost of a simple broadcast over each of the previous 3 topologies. –  Consider a fixed number of par8cipants and two types of message (small and very large*). Order the three topologies based on the performance of the broadcast algorithm using the LogP parameters from 1 •  2: Consider a pipelined approach to the broadcast opera8on, where the original message is split in several size- iden8cal fragments. The broadcast of each fragment is pipelined with respect of all previous fragments. –  Consider again a fixed number of par8cipants and two types of messages (small and very large*). Order the three topologies based on the performance of the broadcast algorithm under same constraint as above (1) –  Consider now the case of an intermediate message and vary the number of par8cipants. Answer the previous ques8on again. •  rela8onship between the number of poten8al fragments and the number of par8cipants 1 hCp://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.95.3022...
View Full Document

This document was uploaded on 03/15/2014 for the course COSC 594 at University of Tennessee.

Ask a homework question - tutors are online