In this short paper we tackle the issue of scalability of core memory allocators, which is an orthogonal optimization with respect to reducing the pressure to core allocators by (a), (b), or (c). In particular, our contribution is the design of a non-blocking (lock-free) allocator implementing the buddy-system specification, where concurrent allocations/dellocations are not coordinated via spin-locks, but by only relying on individual Read-Modify-Write (RMW) instructions executed along the critical path of allocation/deallocation operations. These instructions are exploited to detect whether concurrent requests have conflicted on the same portion of the allocator metadata
Marotta, R., Ianni, M., Scarselli, A., Pellegrini, A., Quaglia:, F. (2018). A Non-blocking Buddy System for Scalable Memory Allocation on Multi-core Machines. In 2018 IEEE International Conference on Cluster Computing (CLUSTER). IEEE [10.1109/CLUSTER.2018.00034].
A Non-blocking Buddy System for Scalable Memory Allocation on Multi-core Machines
Alessandro Pellegrini
;Francesco Quaglia:
2018-09-01
Abstract
In this short paper we tackle the issue of scalability of core memory allocators, which is an orthogonal optimization with respect to reducing the pressure to core allocators by (a), (b), or (c). In particular, our contribution is the design of a non-blocking (lock-free) allocator implementing the buddy-system specification, where concurrent allocations/dellocations are not coordinated via spin-locks, but by only relying on individual Read-Modify-Write (RMW) instructions executed along the critical path of allocation/deallocation operations. These instructions are exploited to detect whether concurrent requests have conflicted on the same portion of the allocator metadataFile | Dimensione | Formato | |
---|---|---|---|
Mar18.pdf
solo utenti autorizzati
Tipologia:
Documento in Pre-print
Licenza:
Copyright dell'editore
Dimensione
272.64 kB
Formato
Adobe PDF
|
272.64 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.