A New Dynamic IPC-Memory Allocator Based on a Paging Approach - Archive ouverte HAL
Communication Dans Un Congrès Année : 2013

A New Dynamic IPC-Memory Allocator Based on a Paging Approach

Résumé

In a distributed system, multiple processes can communicate and exchange data. These processes can be either local (on the same host machine), or remote (on different ones). The POSIX IPC standard provides a set of mechanisms (such as shared memory, message queues and semaphores) for data sharing and synchronization between local processes. In particular, the shared memory mechanism allows multiple local processes/threads to share the same address space. However, this mechanism only allows the sharing of data that belongs to the basic types (such as integer, float, char, ...) and does not support natively the share of pointers. In addition, the shared memory area presents in the form of a contiguous space, which can lead to fragmentation (internal/external) and compaction problems during use. In this paper, we present a new dynamic shared memory allocator (DSMA) addressing these limitations. Other aspects are also taken into account by the allocator, such as portability, performance (response time for an allocation request) or the consistency of shared data in a concurrent access to the same shared memory space. The allocator is in the form of a C/C++ API, compiled and tested on three operating systems: Linux, Windows and Mac-OS.
Fichier non déposé

Dates et versions

hal-01126283 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01126283 , version 1

Citer

Ridha Benosman, Kamel Barkaoui, Yves Albrieux. A New Dynamic IPC-Memory Allocator Based on a Paging Approach. International Conference on High Performance Computing Simulation (HPCS 2013), Nov 2013, X, France. pp.382-389. ⟨hal-01126283⟩
134 Consultations
0 Téléchargements

Partager

More