From: bb@uni-paderborn.de (Bernard Bauer)
Newsgroups: news.announce.conferences
Subject: TUTORIAL on PARALLEL COMPUTING, PUBLIC DAY of PARALLELISM
Date: 9 Apr 92 16:17:27 GMT
Expires: Fri, 12 Jun 1992 07:00:00 GMT
Organization: Uni-GH Paderborn


                       **************************
                       * Call for Participation *
                       **************************

         Tutorial "Parallel Computing"        Public Day of Parallelism


         -- basic algorithms                  -- current research
         -- mapping & load balancing          -- projects & results
         -- combinatorial optimization        -- invited speakers
         -- neural networks                   -- discussions & contacts

            June 10 - 11, 1992               June 12, 1992
            ^^^^^^^^^^^^^^^^^^               ^^^^^^^^^^^^^^^


                     University of PADERBORN, Germany

                          Organized by the
                 Research Community Northrhine-Westfalia
                          "Parallel Computing"

                          Arranged by the
                 Paderborn Center for Parallel Computing




Tutorial "Parallel Computing"          Public Day of Parallelism
=============================          =========================

The first tutorial of the              The Public Day of Parallelism is a one-
Northrhine-Westfalian research         day forum for the presentation of
community "Parallel Computing"         results of the research community NRW
focusses on four important topics      "Parallel Computing", giving researchers
in parallel computing:                 the opportunity
* basic algorithms                     to present their works in the field of
* mapping & load balancing             parallel computing.
* combinatorial optimization
* neural networks.                     The flexible planning of the day
                                       provides the participants with ample
                                       possibilities for private conversations
                                       in a relaxed workshop atmosphere.





TUTORIUM                         B A S I C   A L G O R I T H M S
================================================================================

FRIEDEMANN MATTERN               Distributed algorithms are characterized by
Dr. Friedemann Mattern is        several autonomous processes working on parts
Professor at the University      of a common problem at the same time exchanging
of Saarland at Saarbruecken.     information via messages. Those algorithms are
He concerns himself with         often used in distributed systems without
distributed algorithms and       shared memory. This leads to interesting
the programming of distributed   problems, i.e. termination detection.
systems. His book "Verteilte     The tutorial presents typical basic problems
Basisalgorithmen" is published   and shows simple algorithms for the solution,
in "Informatik Fachberichte"     i.e. wave algorithms, algorithms for determi-
(1989).                          ning a constant snapshot of the global status,
parallel termination detection, realizing mutual exclusion and solving the
election problem, garbage-collection algorithms and others. The relations
between the different problems are presented and it will be shown that methods
frequently used are based on others. Solutions will presented by examples and
partly illustrated by time diagrams. The central terms T i m e and C a u s a -
l i t y will be explained and furthermore, it will be shown that distributed
programs have typical properties of relativistical systems. Moreover, useful
methods and techniques for the construction and analysis of distributed
algorithms but also for the programming of distributed and parallel systems
in general will be presented.




TUTORIUM                         M A P P I N G  &  L O A D   B A L A N C I N G
================================================================================

BURKHARD MONIEN                  Powerful methods for mapping and load balancing
Dr. Burkhard Monien is           have a central bearing on the efficient use
Professor for Computer           of large asynchronous parallel systems. The
Science und chairman of          tutorial will introduce the basic methods
the Paderborn Center for         and focus on the following points:
Parallel Computing at the        1. Networks
University of Paderborn.            In addition to grids, hypercubes, DeBruijn-
He has been working on              and butterfly- networks, etc., multistage
topics in parallel computing        networks will be presented and their
for several years now.              properties compared.
Focal points are parallel        2. Mapping
algorithms, mapping, load           Mapping of networks mentioned above will be
balancing and methods of            explained in some examples. Especially the
parallel simulation.                properties of the transputer system in
                                    Paderborn (320 processors, free configurable)
   will be described.
3. Load balancing
   Load balancing strategies can be classified in four categories, depending on
   whether the gaining of information or the load distribution is done locally
   or in a global way. At least one example of each category will be presented.
4. Strategies with load balancing algorithms
   For branch & bound algorithms problems in the field of combinatorical
   optimization can reach nearly optimal speedups with load balancing strategies
   being chosen dependent on the problem. Some of these will be discussed.




TUTORIUM                         C O M B.  O P T I M I Z A T I O N
================================================================================

ACHIM BACHEM                     New arrangements of parallelizing optimization
Dr. Achim Bachen is Professor    algorithms will be presented. Beginning with
for Applied  Mathematics and     theoretical considerations and results in
director of the Institute for    complexity theory we will deal with the nume-
Mathematics at the University    rics of parallel optimization strategies.
of Cologne. He has concentrated  Finally we will report about practical experi-
on combinatorial optimization    ences with parallel methods for combinatorial
problems in parallel computing,  optimizations. In short:
i.e. vehicle routing, online     1.  General principles of parallel computing
shortest-path problems and       2.  Algorithms
parallel linear programming.     2.1 Parallel algorithms for the solution of linear
                                     equation systems
                                 2.2 Parallel linear programming
2.3 Shortest-path algorithms and dynamic programming on parallel computers
2.4 Network flow problems and parallel matching
2.5 The idea of simulated trading
3.  Practical experiences
3.1 Parallelizing traveling salesman heuristics
3.2 Vehicle routing with simulated trading
3.3 Parallel implementations of the Karmarkar method




TUTORIUM                         N E U R A L   N E T W O R K S
================================================================================

WERNER VON SEELEN                The tutorial can only give an overview of
Dr. Werner von Seelen is         neural networks:
Professor for Theoretical        1. Architecture and function of nerve cells
Biology and head of the             Main points of natural neural networks will
Institute for Neural Computer       be presented, putting emphasis on the
Science of the Ruhr-University      structure of the nervous system, learning,
at Bochum. He has focussed on       synaptic plasticity and the operation of
the examination of neural           receptive fields.
networks, especially on the      2. Artifical neural networks
development of principals of        A systematic overlook of methods and models
neural architectures for            used in the field of neural networks will
technical applications in           be given. Elements of neural networks and
autonomous vehicles and robots.     their dynamic behavior will be discussed.
                                 3. Learning strategies
   Different types of learning rules will be described: supervised and unsuper-
   vised learning, local vs. non-local learning rules. Supervised learning can
   be seen as an error minimization process. We will present the convergence
   theorem for perceptrons and also the Widroff-Hoff rule and backpropagation.
   As an example for unsupervised learning competitive learning will be
   explained in detail.
4. Applications
   Finally typical applications will be presented: self organization, pattern
   recognition and associative memories.



P R O G R A M  -- S C H E D U L E
================================================================================

Wednesday, June 10, 1992 -- Tutorial

from   9:15  registration
      10:00  welcome
      10:15  basic algorithms I
      11:45  lunch
      13:15  basic algorithms II
      14:15  coffee break
      14:45  mapping & load balancing I
      16:15  coffee break
      16:45  mapping & load balancing II
from  18:00  GET IN - dinner


Thursday,  June 11, 1992 -- Tutorial

from   9:00  combinatorial optimization I
      10:30  break
      11:00  combinatorial optimization II
      12:00  lunch
      13:30  neural networks I
      15:00  coffee break
      15:30  neural networks II
      16:30  end


Friday,    June 12th, 1992 -- Public Day of Parallelism

from   9:00  registration
       9:30  welcome
from  10:15  lectures
             (for reasons of actuality the subjects are not known yet.)
      17:30  end




I N F O R M A T I O N
================================================================================

ORGANIZER:

Research Community Northrhine-Westfalia "Parallel Computing"
Coordination: Prof. Dr. B. Monien


ARRANGED BY:

Paderborn Center for Parallel Computing, University of Paderborn

Bernard Bauer                   |  e-mail: bb@uni-paderborn.de
University of Paderborn         |  or:     pc-pc@uni-paderborn.de
FB 17 (Dept. of Math. & CS)     |  voice:  +49 +5251 60 33 42
Warburger Str. 100              |  or:     +49 +5251 60 26 54
4790 Paderborn, Germany         |  fax:    +49 +5251 60 38 36


LANGUAGE & REQUIREMENTS:

All lectures will be held in German.

Basic knowledge in parallel computing is advisable for participants.


FEES:

The Public Day of Parallelism on June 12, 1992 is free.

The normal fee for the tutorial is DM 800.-, including documents, refreshments
and the GET IN (with a buffet) in the evening. Costs for further board and
lodging are not included. For members of the NRW research community there is
no fee.

For university members, especially those from the new Laender, a support
program granting a rebate up to 100% has been launched. If you want to make
use of it, please attach a short list of reasons to your enrolment.


VENUE PADERBORN:
There are direct Bundesbahn-connections from Aachen, Duesseldorf, Cologne,
Muenster, Brunswik, Norddeich, Chemnitz, Erfurt, Leipzig and Berlin.
The next Intercity-stations with good connections to Paderborn are
Bielefed, Hamm and Dortmund.

Furthermore, there are direct air connections from Munich, Stuttgart,
Frankfurt, Berlin and London.

Motorway connection: A 33


FOR FURTHER INFORMATION, PLEASE CONTACT:

+----------------------------------------------------------------------+
| Paderborn Center for Parallel Computing                              |
| Bernard Bauer                   | e-mail: bb@uni-paderborn.de        |
| University of Paderborn         | or:     bb@pbinfo.uucp             |
| FB 17 (Dept. of Math. & CS)     | or:     ...!uunet!unido!pbinfo!bb  |
| Warburger Str. 100              | fax:    +49 +5251 60 38 36         |
| 4790 Paderborn, Germany         | voice:  +49 +5251 60 33 42         |
+----------------------------------------------------------------------+
Newsgroups: news.announce.conferences