Efficient Simulation of Multiprocessors through Finite State Machines

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by C. Siegelin Articles by C. O'Donnell Articles by U. Finger

Proceedings of the 22nd EUROMICRO Conference

Prague, Czech Republic

September 02-September 05

ISBN: 0-8186-7487-3

	ASCII Text	x
	C. Siegelin, C. O'Donnell, U. Finger, "Efficient Simulation of Multiprocessors through Finite State Machines," EUROMICRO Conference, pp. 0202, Proceedings of the 22nd EUROMICRO Conference, 1996.

	BibTex	x
	@article{ 10.1109/EURMIC.1996.546383, author = {C. Siegelin and C. O'Donnell and U. Finger}, title = {Efficient Simulation of Multiprocessors through Finite State Machines}, journal ={EUROMICRO Conference}, volume = {0}, year = {1996}, isbn = {0-8186-7487-3}, pages = {0202}, doi = {http://doi.ieeecomputersociety.org/10.1109/EURMIC.1996.546383}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - EUROMICRO Conference TI - Efficient Simulation of Multiprocessors through Finite State Machines SN - 0-8186-7487-3 SP EP A1 - C. Siegelin, A1 - C. O'Donnell, A1 - U. Finger, PY - 1996 KW - finite state machines; simulation; multiprocessors; finite state machines; event-driven multiprocessor simulators; memory behaviour; cache behaviour VL - 0 JA - EUROMICRO Conference ER -

C. Siegelin, Dept. Inf., Ecole Nat. Superieure des Telecommun., Paris, France

C. O'Donnell, Dept. Inf., Ecole Nat. Superieure des Telecommun., Paris, France

U. Finger, Dept. Inf., Ecole Nat. Superieure des Telecommun., Paris, France

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EURMIC.1996.546383

Abstract: This paper introduces a new approach to the implementation of event-driven multiprocessor simulators. Cache and memory behaviour is modelled through finite state machines which use a very limited amount of storage rather than a full execution context (CPU registers, stack). The resulting simulator design is conceptually simple and clean. Furthermore, we make the point that finite state machines can be scheduled faster. Our performance figures show that simulation overhead is lower than for comparable multiprocessor simulators.

Index Terms:

finite state machines; simulation; multiprocessors; finite state machines; event-driven multiprocessor simulators; memory behaviour; cache behaviour

Citation:

C. Siegelin, C. O'Donnell, U. Finger, "Efficient Simulation of Multiprocessors through Finite State Machines," euromicro, pp.0202, Proceedings of the 22nd EUROMICRO Conference, 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.