Automatic memory reclamation for lock-free data structures

Nachshon Cohen, Erez Petrank

نتاج البحث: فصل من :كتاب / تقرير / مؤتمرمنشور من مؤتمرمراجعة النظراء

ملخص

Lock-free data-structures are widely employed in practice, yet designing lock-free memory reclamation for them is notoriously difficult. In particular, all known lock-free reclamation schemes are "manual" in the sense that the developer has to specify when nodes have retired and may be reclaimed. Retiring nodes adequately is non-trivial and often requires the modification of the original lock-free algorithm. In this paper we present an automatic lock-free reclamation scheme for lock-free data-structures in the spirit of a mark-sweep garbage collection. The proposed algorithm works with any normalized lock-free algorithm and with no need for the programmer to retire nodes or make changes to the algorithm. Evaluation of the proposed scheme on a linked-list and a hash table shows that it performs similarly to the best manual (lock-free) memory reclamation scheme.

اللغة الأصليةالإنجليزيّة
عنوان منشور المضيفOOPSLA 2015 - Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming Systems, Languages, and Applications
المحررونPatrick Eugster, Jonathan Aldrich
الصفحات260-279
عدد الصفحات20
رقم المعيار الدولي للكتب (الإلكتروني)9781450336895
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 23 أكتوبر 2015
الحدث2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015 - Pittsburgh, الولايات المتّحدة
المدة: ٢٥ أكتوبر ٢٠١٥٣٠ أكتوبر ٢٠١٥

سلسلة المنشورات

الاسمProceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA
مستوى الصوت25-30-Oct-2015

!!Conference

!!Conference2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015
الدولة/الإقليمالولايات المتّحدة
المدينةPittsburgh
المدة٢٥/١٠/١٥٣٠/١٠/١٥

All Science Journal Classification (ASJC) codes

  • !!Software

بصمة

أدرس بدقة موضوعات البحث “Automatic memory reclamation for lock-free data structures'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا