Skip to main content
Springer Nature Link
Log in

Modeling symmetric computer architectures by SWNs

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1994 (ICATPN 1994)

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

Included in the following conference series:

  • 141 Accesses

Abstract

Timed and Stochastic Well-formed colored nets (SWNs) have been introduced as a good modeling tool for complex systems with inherently high degree of symmetry. Analysis and simulation algorithms allow the automatic exploitation of model symmetries to improve their efficiency. Fairly strong constraints are posed over the color definition syntax in order to support such automatic symmetry exploitation as compared to other high level Petri net formalisms. In this paper we derive several models of parallel computer architectures in order to show not only that the formalism is adequate for this class of applications, but also how the different types of symmetries can be mapped into the allowed specification formalism. From this set of case studies we conclude that SWNs are an “intermediate level” formalism, closer to the application domain than P/T nets, yet requiring some ingenuity and experience from the modeler in order to exploit their (high) potential.

This work was supported by the ESPRIT-BRA project No.7269 “QMIPS” and the Italian MURST 40% project.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. H.J. Genrich. Equivalence transformations of Pr/T nets. In Proc. 9 th Europ. Workshop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.

    Google Scholar 

  2. Chuang Lin and Dan C. Marinescu. Stochastic high level Petri nets and applications. IEEE Transactions on Computers, 37(7):815–825, July 1988.

    Google Scholar 

  3. J. A. Carrasco. Automated construction of compound Markov chains from generalized stochastic high-level Petri nets. In Proc. 3rd Intern. Workshop on Petri Nets and Performance Models, pages 93–102, Kyoto, Japan, December 1989. IEEE-CS Press.

    Google Scholar 

  4. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. On well-formed coloured nets and their symbolic reachability graph. In Proc. 11 th International Conference on Application and Theory of Petri Nets, Paris, France, June 1990. Reprinted in High-Level Petri Nets. Theory and Application, K. Jensen and G. Rozenberg (editors), Springer Verlag, 1991.

    Google Scholar 

  5. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed coloured nets for symmetric modelling applications. IEEE Transactions on Computers, 42(11), November 1993.

    Google Scholar 

  6. G. Chiola, G. Franceschinis, and R. Gaeta. A symbolic simulation mechanism for well-formed coloured Petri nets. In Proc. 25th SCS Annual Simulation Symposium, Orlando, Florida, April 1992.

    Google Scholar 

  7. G. Chiola, R. Gaeta, and M. Ribaudo. Designing an efficient tool for Stochastic Well-Formed Coloured Petri Nets. In R. Pooley and J. Hillston, editors, Proc. 6 th Int. Conference on Modelling Techniques and Tools for Computer Performance Evaluation, pages 391–395, Edinburg, UK, September 1992. Antony Rowe Ltd.

    Google Scholar 

  8. C.E. Leiserson. Fat-trees: Universal networks for hardware efficient supercomputing. IEEE Transactions on Computers, C-34(10), October 1985.

    Google Scholar 

  9. Kay Hwang. Advanced Computer Architecture with Parallel Programming. McGraw Hill, 1993.

    Google Scholar 

  10. G. Chiola and G. Franceschinis. A structural colour simplification in Well-Formed coloured nets. In Proc. 4th Intern. Workshop on Petri Nets and Performance Models, pages 144–153, Melbourne, Australia, December 1991. IEEE-CS Press.

    Google Scholar 

  11. G. Chiola, S. Donatelli, and G. Franceschinis. GSPN versus SPN: what is the actual role of immediate transitions? In Proc. 4th Intern. Workshop on Petri Nets and Performance Models, pages 20–31, Melbourne, Australia, December 1991. IEEE-CS Press.

    Google Scholar 

  12. S. Caselli and G. Conte. GSPN models of concurrent architectures with mesh topology. In Proc. 4th Intern. Workshop on Petri Nets and Performance Models, pages 280–289, Melbourne, Australia, December 1991. IEEE-CS Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Torino, Corso Svizzera 185, 10149, Torino, Italy

    G. Chiola, G. Franceschinis & R. Gaeta

Authors
  1. G. Chiola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Franceschinis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Gaeta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Valette

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chiola, G., Franceschinis, G., Gaeta, R. (1994). Modeling symmetric computer architectures by SWNs. In: Valette, R. (eds) Application and Theory of Petri Nets 1994. ICATPN 1994. Lecture Notes in Computer Science, vol 815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58152-9_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-58152-9_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58152-9

  • Online ISBN: 978-3-540-48462-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics