Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Message Passing Model for Communication on Random Regular Graphs
 

Summary: 1
A Message Passing Model for Communication
on Random Regular Graphs
Andreas Bieniek, Michael N¨olle, Gerald Schreiber
Abstract--- Randomized routing strategies are ap­
plied to avoid worst­case communication patterns
on communication networks used for parallel com­
puters. Instead of a randomized routing strategy
on a regular communication network, the random­
ization of the network itself is investigated in this
paper. A model to describe properties of random
regular graphs is presented. With the results of
the model it is possible to predict the number of
communication cycles necessary for the routing of
a given communication load. Each node transmits
the data in a buffered store and forward fashion.
Different strategies for buffering messages in case of
conflicts are incorporated into the stochastic model.
The number of communication cycles can be pre­
dicted without simulating the communication traf­

  

Source: Albert-Ludwigs-Universität Freiburg, Institut für Informatik,, Lehrstuhls für Mustererkennung und Bildverarbeitung

 

Collections: Computer Technologies and Information Sciences