Abstract
This paper presents a new algorithm for distributed shared virtual memory dedicated to diskless embedded systems. In this context, we adapt an existing algorithm in order to include a page replacement mechanism. We also propose a memory partition to optimize memory space use. In conclusion, our algorithm has a complexity comparable with the initial one.
| Original language | English |
|---|---|
| Pages | 355-362 |
| Number of pages | 8 |
| Publication status | Published - 1 Dec 1994 |
| Externally published | Yes |
| Event | Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Pol Duration: 21 Jun 1994 → 24 Jun 1994 |
Conference
| Conference | Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems |
|---|---|
| City | Poznan, Pol |
| Period | 21/06/94 → 24/06/94 |
Fingerprint
Dive into the research topics of 'Integrating page replacement in a distributed shared virtual memory'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver