Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time

Authors Guy E. Blelloch , Yuanhao Wei

Thumbnail PDF


  • Filesize: 363 kB
  • 3 pages

Document Identifiers

Author Details

Guy E. Blelloch
  • Carnegie Mellon University, Pittsburgh, PA, USA
Yuanhao Wei
  • Carnegie Mellon University, Pittsburgh, PA, USA

Cite AsGet BibTex

Guy E. Blelloch and Yuanhao Wei. Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 51:1-51:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


We describe an algorithm for supporting allocation and free for fixed-sized blocks, for p asynchronous processors, with O(1) worst-case time per operation, Θ(p²) additive space overhead, and using only single-word read, write, and CAS. While many algorithms rely on having constant-time fixed-size allocate and free, we present the first implementation of these two operations that is constant time with reasonable space overhead.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Concurrent algorithms
  • malloc
  • free
  • fixed-size
  • concurrent
  • constant time


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Zahra Aghazadeh and Philipp Woelfel. Upper bounds for boundless tagging with bounded objects. In International Symposium on Distributed Computing (DISC), pages 442-457, 2016. Google Scholar
  2. Guy E. Blelloch and Yuanhao Wei. Concurrent reference counting and resource management in wait-free constant time, 2020. URL:
  3. Guy E Blelloch and Yuanhao Wei. LL/SC and atomic copy: Constant time, space efficient implementations using only pointer-width CAS. In International Symposium on Distributed Computing (DISC), 2020. Google Scholar
  4. Panagiota Fatourou and Nikolaos D Kallimanis. A highly-efficient wait-free universal construction. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 325-334, 2011. Google Scholar
  5. Anders Gidenstam, Marina Papatriantafilou, and Philippas Tsigas. NBmalloc: Allocating memory in a lock-free manner. Algorithmica, 58(2):304-338, 2010. Google Scholar
  6. Maged M Michael. Scalable lock-free dynamic memory allocation. In Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, pages 35-46, 2004. Google Scholar
  7. Ruslan Nikolaev and Binoy Ravindran. Universal wait-free memory reclamation. In ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), page 130–143, 2020. Google Scholar
  8. Sangmin Seo, Junghyun Kim, and Jaejin Lee. SFMalloc: A lock-free and mostly synchronization-free dynamic memory allocator for manycores. In International Conference on Parallel Architecture and Compilation Techniques (PACT), pages 253-263, 2011. Google Scholar
  9. Håkan Sundell. Wait-free reference counting and memory management. In International Parallel and Distributed Processing Symposium (IPDPS), 2005. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail