MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Time-Independent Gossiping on Full-Port Tori

Ulrich Meyer
Max-Planck-Institut für Informatik
Seminar des Graduiertenkollegs
AG 1, AG 2  
AG Audience
English

Date, Time and Location

Monday, 2 November 98
16:00
60 Minutes
45
015
Saarbrücken

Abstract

Near-optimal gossiping (all-to-all-broadcasting) algorithms are given for two- and higher dimensional tori-networks. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with a time-dependent routing pattern. We propose simple time-independent routing algorithms: in all steps, the processors forward the received packets in the same way.

Joint work with Jop Sibeyn.

Contact

Ülkü Coruh
0681/9325-526
--email hidden
passcode not visible
logged in users only