Advertisement

Modelling architectural features with petrinets

  • Jean -Loup Baer
Section 7 Application Of Nets
Part of the Lecture Notes in Computer Science book series (LNCS, volume 255)

Abstract

In this paper we consider the use of Petri nets and extensions to describe features of existing architectures. Because the main attraction of Petri nets is in their ability to express synchronization and concurrency, our modelling is directed towards high-performance architectures. In particular, we show models for look-ahead processing schemes and the cache coherence problem.

Keywords

Result Register Program Counter Memory Controller Cache Coherence Reservation Station 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [Agerwala 74]
    Agerwala,T. "A Complete Model for Representing the Coordination of Asynchronous Processes", Hopkins Computer Research Report #32, July 1974Google Scholar
  2. [Agerwala 79]
    Agerwala, T. "Putting Petri Nets to Work", Computer, 12, 12, Dec 1979, pp 85–94Google Scholar
  3. [Archibald84]
    Archibald,J. and J.-L. Baer "An Economical Solution to the Cache Coherence Problem" Proc. 11th Symp. on Computer Architecture, 1984, pp. 355–362Google Scholar
  4. [Baer80]
    Baer, J.-L. Computer Systems Architecture, Computer Science Press, Rockville, Md, 1980Google Scholar
  5. [Baer85a]
    Baer,J.-L. and C.Girault "A Petri Net Model for a Solution to the Cache Coherence Problem", Proc. 1st Conf. on Supercomputing Systems, 1985, pp. 680–689Google Scholar
  6. [Baer85b]
    Baer,J.-L. and C.Girault "Design of a Parallel Architecture for the Cache Coherence Problem", Proc. Parallel Computing, Berlin, 1985Google Scholar
  7. [Bernstein66]
    Bernstein,A.J. "Analysis of Programs for Parallel Processing", IEEE TC, E-15, Oct 1966, pp 746–757Google Scholar
  8. [Best86]
    Best,E. and C.Fernandez "Notations and Terminology on Petri Net Theory", Arbeitspapiere der GMD 195, GMD, Jan 1986Google Scholar
  9. [Brams82]
    Brams, G.W. Réseaux de Petri: Théory et Pratique, Masson, Paris, vols 1 and 2, 1982Google Scholar
  10. [Genrich79]
    Genrich,H.J. and K.Lautenbach "The Analysis of Distributed Systems by Means of Predicate/Transition Nets" Lecture Notes in Computer Science, 70, Springer-Verlag, 1979Google Scholar
  11. [Jensen79]
    Jensen, K. "Coloured Petri Nets and the Invariant Method", Theoretical Computer Science, 14, 3, June 1981Google Scholar
  12. [Patil72]
    Patil,S.S. and J.B.Dennis "The Description and Realization of Digital Systems", Compcon Digest, 1972, pp. 223–227Google Scholar
  13. [Peterson81]
    Peterson, J.L. Petri Net Theory and the Modelling of Systems, Prentice-Hall, Englewood Cliffs, NJ 1981Google Scholar
  14. [Smith82]
    Smith, A.J. "Cache Memories", Computing Surveys, 14, 3, Sept. 1982, pp. 473–530Google Scholar
  15. [Thornton70]
    Thornton, J.E. Design of a Computer System, the Control Data 6600, Scott, Foresman and Co., Glenview, Ill, 1970Google Scholar
  16. [Tomasulo67]
    Tomasulo, R.M. "An Efficient Algorithm for Exploiting Multiple Arithmetic Units", IBM J. of Research and Development, 11, Jan 1967, pp. 25–33Google Scholar
  17. [Weiss84]
    Weiss, S. and J.E. Smith "Instruction Issue Logic in Pipelined Supercomputers", IEEE TC, C-33, 11, Nov 1984, pp. 1013–1022Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Jean -Loup Baer
    • 1
  1. 1.Department of Computer ScienceUniversity of WashingtonSeattle

Personalised recommendations