Skip to main content

A flexible architectural study methodology

  • Performance Modelling And Simulation
  • Conference paper
  • First Online:
Graph Reduction (GR 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 279))

Included in the following conference series:

  • 174 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. P. Hudak, B. Goldberg, “Experiments in Diffused Combinator Reduction”, 1984 ACM Symposium on LISP and Functional Programming, Austin, Texas, 1984.

    Google Scholar 

  4. P. Hudak, B. Goldberg, “Serial Combinators: ‘Optimal’ Grains of Parallelism”, Functional Programming and Computer Architecture Conference, Nancy, France, September, 1985.

    Google Scholar 

  5. B. Keller, F. Lin, “Simulated Performance of a Reduction Based Multi-processor”, IEEE Computer, July, 1984.

    Google Scholar 

  6. M. MacDougall, “ASPOL Reference Manual”, Control Data Corporation, Sunnyvale, CA, 1972 (latest revision).

    Google Scholar 

  7. H. Richards, Jr., “An Overview of the Burroughs NORMA”, Burroughs Austin Research Center, January, 1985.

    Google Scholar 

  8. H. Schwetman, “CSIM: A C-Based Process Oriented Simulation Language,” MCC Technical Report PP-080-85, 1985 (latest revision).

    Google Scholar 

  9. 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. D. A. Turner, “SASL Language Manual”, Computing Laboratory, University of Kent, Canterbury, England.

    Google Scholar 

  11. D. A. Turner, “A New Implementation Technique for Applicative Languages”, Software-Practice & Experience, Vol. 9, 31–49, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joseph H. Fasel Robert M. Keller

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tighe, S., Zink, K., Brice, R., Alexander, W. (1987). A flexible architectural study methodology. In: Fasel, J.H., Keller, R.M. (eds) Graph Reduction. GR 1986. Lecture Notes in Computer Science, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18420-1_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-18420-1_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18420-1

  • Online ISBN: 978-3-540-47963-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics