Thu 29 Oct 2015 13:52 - 14:15 at Grand Station 1 - 7. Runtime Chair(s): Michael Pradel

We demonstrate that general-purpose memory allocation involving many threads on many cores can be done with high performance, multicore scalability, and low memory consumption. For this purpose, we have designed and implemented scalloc, a concurrent allocator that generally performs and scales in our experiments better than other allocators while using less memory, and is still competitive otherwise. The main ideas behind the design of scalloc are: uniform treatment of small and big objects through so-called virtual spans, efficiently and effectively reclaiming free memory through fast and scalable global data structures, and constant-time (modulo synchronization) allocation and deallocation operations that trade off memory reuse and spatial locality without being subject to false sharing.

Thu 29 Oct
Times are displayed in time zone: (GMT-04:00) Eastern Time (US & Canada) change

13:30 - 15:00: OOPSLA - 7. Runtime at Grand Station 1
Chair(s): Michael PradelTU Darmstadt, Germany
oopsla201513:30 - 13:52
Yudi ZhengUniversity of Lugano, Lubomír BulejUniversità della Svizzera italiana, Walter BinderUniversity of Lugano
oopsla201513:52 - 14:15
Martin AignerUniversity of Salzburg, Austria, Christoph KirschUniversity of Salzburg, Austria, Michael LippautzUniversity of Salzburg, Austria, Ana SokolovaUniversity of Salzburg, Austria
DOI Pre-print Media Attached
oopsla201514:15 - 14:37
Brett BostonMassachusetts Institute of Technology, USA, Adrian SampsonCornell University & Microsoft Research, Dan GrossmanUniversity of Washington, USA, Luis CezeUniversity of Washington, USA
Pre-print Media Attached
oopsla201514:37 - 15:00
Michael JantzUniversity of Tennessee, USA, Forrest RobinsonUniversity of Kansas, USA, Prasad KulkarniUniversity of Kansas, Kshitij DoshiIntel, USA
DOI Media Attached