Transputer-based experiments with the ZAPP architecture

  • D. L. McBurney
  • M. R. Sleep
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 258)


We report experiments with a parallel architecture called ZAPP[2] simulated on several connected INMOS transputers. Besides the usual synthetic benchmarks (eg Nfib), our experiments covered a range of applications including matrix multiply, heuristic search and the 0–1 knapsack optimisation problem. Some of these applications cannot be adequately supported by the original ZAPP model. We report the modifications we made to ZAPP to accommodate them.

One experiment involved 40 transputers; we obtained a stopwatch speed of over one million function calls per second, corresponding to a relative speedup over a single simulated ZAPP element of 39.9, and a real performance improvement over a single transputer running the same algorithm directly programmed in OCCAM of more than 15. A similar experiment for matrix multiply confirmed that real improvements were obtained using ZAPP techniques.

Experiments with less structured problems, such as heuristic search and the 0–1 knapsack problem, revealed that the longer a problem took to solve using sequential implementation, the more likely it was to benefit from parallel solution using ZAPP techniques.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    VEGDAHL, S.R. A Survey of Proposed Architectures for the Execution of Functional Languages. IEEE Transactions on Computers, Vol. c-33, No.12, December 1984.Google Scholar
  2. [2]
    BURTON, F.W. and SLEEP, M.R. Executing functional programs on a virtual tree of processors. Proc.Conf.Functional Programming Languages and Computer Architecture, Portsmouth, New Hampshire, October 1982, pp.187–194.Google Scholar
  3. [3]
    KENNAWAY, J.R. and SLEEP, M.R. The zero assignment parallel processor (ZAPP) project. In: D.A. Duce (Editor). Distributed Computing Systems Programme, (Peter Peregrinus for IEE, 1984).Google Scholar
  4. [4]
    TRELEAVEN P.C., BROWNBRIDGE D.R. and HOPKINS R.P. Data-Driven and Demand-Driven Computer Architecture. ACM Computing Surveys 14(1) 1982.Google Scholar
  5. [5]
    HOROWITZ, E. and SAHNI, S. Fundamentals of Computer Algorithms. Pitman 1978.Google Scholar
  6. [6]
    HILLIS W.D. The Connection Machine. AI Memo No.646, MIT Artificial Intelligence Laboratory.Google Scholar
  7. [7]
    KENNAWAY, J.R. and SLEEP, M.R. Novel Architectures for Declarative Languages. Software and Microsystems, Vol. 2, No. 3 (1983).Google Scholar
  8. [8]
    OCCAM Programming Manual Prentice Hall International 1984Google Scholar
  9. [9]
    McBURNEY D. and SLEEP M.R. Transputer based experiments with the ZAPP architecture. University of East Anglia report no. SYS-C86-10. Oct. 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • D. L. McBurney
    • 1
  • M. R. Sleep
    • 1
  1. 1.Declarative Systems ProjectUniversity of East AngliaNorwichEngland

Personalised recommendations