Change search
ReferencesLink to record
Permanent link

Direct link
A model for parallel simulation of distributed shared memory
KTH, Superseded Departments, Teleinformatics.
Lund university.ORCID iD: 0000-0002-9637-2065
KTH, Superseded Departments, Teleinformatics.
1996 (English)Conference paper (Refereed)
Abstract [en]

We present an execution model for parallel simulation of a distributed shared memory architecture. The model captures the processor-memory interaction and abstracts the memory subsystem. Using this model we show how parallel, on-line, partially-ordered memory traces can be correctly predicted without interacting with the memory subsystem. We also outline a parallel optimistic memory simulator that uses these traces, finds a global order among all events, and returns correct data and timing to each processor. A first evaluation of the amount of concurrency that our model can extract for an ideal multiprocessor shows that processors may execute relatively long instruction sequences without violating the causality constraints. However parallel simulation efficiency is highly dependent on the memory consistency model and the application characteristics.

Place, publisher, year, edition, pages
1996. 179-84 p.
National Category
Computer Systems
URN: urn:nbn:se:kth:diva-109655OAI: diva2:584907
Proceedings of MASCOTS ‘96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
NR 20140805Available from: 2013-01-09 Created: 2013-01-08 Last updated: 2013-01-09Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Brorsson, Mats
By organisation
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 25 hits
ReferencesLink to record
Permanent link

Direct link