Change search
ReferencesLink to record
Permanent link

Direct link
A decentralized virtual memory scheme implemented on an emulated multiprocessor
Lund university.ORCID iD: 0000-0002-9637-2065
1989 (English)In: Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Vol.I: Architecture Track (IEEE Cat. No. 89TH0242-8), 1989, 286-95 p.Conference paper (Refereed)
Abstract [en]

A decentralized scheme for virtual memory management on MIMD (multiple-instruction-multiple-data) multiprocessors with shared memory has been developed. Control and data structures are kept local to the processing elements (PE), which reduces the global traffic and makes a high degree of parallelism possible. Each of the PEs in the target architecture consists of a processor and part of the shared memory and is connected to the others by a common bus. The traditional approach, based on replication or sharing of data structures is not suitable in this case when the number of PEs is of the magnitude of 100. This is due to the excessive global traffic caused by consistency or mutual exclusion protocols. A variant of the Dennings working set page replacement algorithm is used, in which each process owns a page list. Shared pages are not present in more than one list, and it is shown that this will not increase the page fault rate in most cases.

Place, publisher, year, edition, pages
1989. 286-95 p.
National Category
Computer Systems
URN: urn:nbn:se:kth:diva-109662OAI: diva2:584913
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
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: 28 hits
ReferencesLink to record
Permanent link

Direct link