A flexible architectural study methodology

  • Steven Tighe
  • Ken Zink
  • Richard Brice
  • William Alexander
Performance Modelling And Simulation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 279)


An efficient emulation/simulation system for evaluating architectures and scheduling strategies for reduction systems is described. Execution traces of example programs are generated by the emulator. The execution method of the emulator exercises all possible parallelism available in the execution model under study. The trace of each program execution is then reduced to an “architecturally neutral” precedence graph. The precedence graph can then be used repeatedly in simulations to study the effects of changes in architecture or scheduling strategy.


Program Execution Process Node Execution Model Execution Trace Trace File 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Cla86]
    C. Clack, S. Peyton Jones, “The Four-Stroke Reduction Machine”, Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, Cambridge, Mass., August 4–6, 1986.Google Scholar
  2. [Dar81]
    J. Darlington, M. Reeve, “ALICE: A Multi-processor Reduction Machine for the Parallel Evaluation of Applicative Languages”, ACM Functional Programming and Computer Architecture Conference, Portsmouth, New Hampshire, October 1981.Google Scholar
  3. [Hud84]
    P. Hudak, B. Goldberg, “Experiments in Diffused Combinator Reduction”, 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas, 1984.Google Scholar
  4. [Hud85]
    P. Hudak, B. Goldberg, “Serial Combinators: ‘Optimal’ Grains of Parallelism”, Functional Programming and Computer Architecture Conference, Nancy, France, September, 1985.Google Scholar
  5. [Kel84]
    B. Keller, F. Lin, “Simulated Performance of a Reduction Based Multi-processor”, IEEE Computer, July, 1984.Google Scholar
  6. [Mac72]
    M. MacDougall, “ASPOL Reference Manual”, Control Data Corporation, Sunnyvale, CA, 1972 (latest revision).Google Scholar
  7. [Ric85]
    H. Richards, Jr., “An Overview of the Burroughs NORMA”, Burroughs Austin Research Center, January, 1985.Google Scholar
  8. [Sch85]
    H. Schwetman, “CSIM: A C-Based Process Oriented Simulation Language,” MCC Technical Report PP-080-85, 1985 (latest revision).Google Scholar
  9. [Tig87]
    S. Tighe, “A Study of the Parallelism Inherent in Combinator Reduction”, Proceedings of the 1987 Hawaii International Conference on System Sciences, Kona, Hawaii, Jan. 6–9, 1987.Google Scholar
  10. [Tur76]
    D. A. Turner, “SASL Language Manual”, Computing Laboratory, University of Kent, Canterbury, England.Google Scholar
  11. [Tur79]
    D. A. Turner, “A New Implementation Technique for Applicative Languages”, Software-Practice & Experience, Vol. 9, 31–49, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Steven Tighe
    • 1
  • Ken Zink
    • 1
  • Richard Brice
    • 1
  • William Alexander
    • 2
  1. 1.Parallel Processing Program, MCCUSA
  2. 2.Database Program, MCCUSA

Personalised recommendations