Go backward to Proof of Correctness
Go up to Top
Go forward to Yet Another Solution
Mapping the Program to Machines
- von Neumann machine:
- Repeated sequence of assignments until fixed point.
- r := f(r); r := g(r); r := h(r).
- Assume computation of f is more efficient:
- Apply f twice as often.
- r := f(r); r := g(r); r := f(r); r := h(r).
- Multiprocessor mapping:
- Partition statements among processors.
- Each processor executes one of f, g, h.
Each UNITY programs describes a family of implementations!
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: intro.tex,v 1.2 1996/01/31 15:37:03 schreine Exp schreine