Project Seminar "Parallel and Distributed Software and Algorithms"
Wolfgang Schreiner <Wolfgang.Schreiner@risc.uni-linz.ac.at>
315.538, SS 1998 (Start: March 11)
Wed 14:00-15:30, HA 105
Time: 15:30, Room: meeting room Hagenberg.
- Seminar Organization
Contents, scheduling of presentations.
- "DAJ -- A Toolkit for Distributed Algorithms in Java"
Talk by Wolfgang Schreiner (45+ mins).
- "Distributed Snapshots -- The Chandy-Lamport Algorithm"
Talk by Wolfgang Schreiner (90 mins): how to determine a consistent global
snapshot of an asynchronously executing network; implementatin in DAJ.
- "The CFLP System"
Talk by Mircea Marin (45+ mins): a functional-logic language with constraint
solving capabilities and its distributed implementation by
- "Fisher's Protocol: A Verification with Process Algebra"
Talk by Yaroslav Usenko (30+ mins): modeling of a communication protocol and
- "Hybrid I/O Automata"
Talk by Antonin Tesacec (30+ mins): specification of hybrid I/O automata.
Talk by Harald Deischinger (45+ mins): report on the CalTech system for
distributed Java programming and its installation in the RISC-Linz computer
- "Temporal Logic Verification of a Distributed Algorithm"
Talk by Christian Mittermaier (45+ mins): formal verification of a distributed
algorithm based on a temporal logic framework.
- "Distributed Maple"
Announcemnt of Wolfgang Schreiner about the implementation of a distributed
Maple variant (5 mins).
- "CORBA Fundamentals"
Talk by Karl Traunmüller (45+ mins): fundamentals of distributed object
technology and of CORBA (Common Object Request Broker Architecture).
- "Distributed Design Patterns"
Talk by Alexander Podoplelov (45+ mins).
- Imperative Program Specialization: A Case Study
Robert Glueck (DIKU, University of Copenhagen, Denmark)
Partial evaluation is an automatic program optimization technique,
similar in concept to, but in several ways different from optimizing
compilers. Optimization is achieved by changing the times at which
computations are performed. A partial evaluator can be used to
overcome losses in performance that are due to highly parameterized,
This talk gives a short introduction to program specialization by
off-line partial evaluation. We show how a binding-time analysis can
be used to identify potential sources for specialization in numerical
algorithms. To demonstrate the effectiveness of this approach we used
an automatic partial evaluator for Fortran which we developed. Results
for several well-known numerical algorithms show that some remarkable
speedup factors can be obtained.
Joint work with R.Baier, R.Nakashige, R.Zoechling.
- "Active Objects"
Talk by Alexander Podoplelov (45+ mins) about some distributed design pattern.
- "Temporal Logic Specification of Real-Time Systems"
Talk by Wolfgang Schreiner about a paper by Lamport et al (30+ mins).
- "STeP: The Standford Temporal Logic Prover"
Talk by Christian Mittermaier (45+ mins), see the STeP
- "Parallel Convex Hull Construction"
Talk by Harald Deischinger (30+ mins) about the implementation of a parallel
algorithm from computational geometry in DAJ.
- "CORBA Programming"
Talk by Karl Traunmüller (45+ mins): programming with the CORBA installation
in the RISC-Linz network.
- "The CFLP System"
Talk by Mircea Marin (30+ mins) about the current state of the system.
- Algebraic Verification of a Distributed Summation Algorithm
Talk by Yarislav Usenko (45+ mins).
Talk by Antonin Tesacec about the transformation of synchronous network
algorithms to asynchronous network algorithms (45+ mins).
Maintained by: Wolfgang Schreiner
Last Modification: June 3, 1998