“Bulletin Board”

 School of Mathematics - December 12, 2001

Mathematical Talks


Self-Stabilizing algorithms

C. Johnen
Professor, Laboratoire de Recherche en Informatique (LRI)
Universite de Paris Sud-Orsay

Date:Wed., Dec. 12, 2001
Time:14:00-15:00


Rewriting, automated deduction and functional programing

L. Puel
Professor, Laboratoire de Recherche en Informatique (LRI)
Universite de Paris Sud-Orsay


Date:Wed., Dec. 12, 2001
Time:15:00-16:00

See Photos

 
 
Self-Stabilizing algorithms

C. Johnen
Professor, Laboratoire de Recherche en Informatique (LRI)
Universite de Paris Sud-Orsay

Date:Wed., Dec. 12, 2001
Time:14:00-15:00


Abstract:
A distributed system is the interconnection of autonomous processors which collaborate to perform together a task. Distributed systems are very powerful but unfortunately, their managements are time and space consuming specially on huge systems that contain million of nodes.

The concept of self-stabilization (introduced by Dijkstra) is very useful for the management of distributed systems: a self-stabilizing algorithm tolerates topology changes in the graph netowork, crash failures, and data corruptions. A self-stabilizing algorithm will eventually perform properly its tasks whatever is the current state of the distributed system after a ?disturbance?.



Rewriting, automated deduction and
functional programing


L. Puel
Professor, Laboratoire de Recherche en Informatique (LRI)
Universite de Paris Sud-Orsay

Date:Wed., Dec. 12, 2001
Time:15:00-16:00


Information:
Place:Seminar Hall, School of Mathematics, Niavaran Building, Niavaran Sq.
Tel:(+98 21) 2290928
Fax:(+98 21) 2290648
e-mail:ipmmath@ipm.ir
See Photos
 
 
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right