{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:38:00Z","timestamp":1761917880411,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030159955"},{"type":"electronic","value":"9783030159962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15996-2_17","type":"book-chapter","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T08:05:25Z","timestamp":1553501125000},"page":"230-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["LRMalloc: A Modern and Competitive Lock-Free Dynamic Memory Allocator"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Leite","sequence":"first","affiliation":[]},{"given":"Ricardo","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,26]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Berger, E.D., McKinley, K.S., Blumofe, R.D., Wilson, P.R.: Hoard: a scalable memory allocator for multithreaded applications. In: ACM SIGARCH Computer Architecture News, vol. 28, pp. 117\u2013128. ACM (2000)","DOI":"10.1145\/378995.379232"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Dechev, D., Pirkelbauer, P., Stroustrup, B.: Understanding and effectively preventing the ABA problem in descriptor-based lock-free designs. In: 13th IEEE International Symposium on Object\/Component\/Service-Oriented Real-Time Distributed Computing, pp. 185\u2013192. IEEE (2010)","DOI":"10.1109\/ISORC.2010.10"},{"key":"17_CR3","unstructured":"Evans, J.: A scalable concurrent malloc (3) implementation for FreeBSD. In: BSDCan Conference, Ottawa, Canada (2006)"},{"key":"17_CR4","unstructured":"Ghemawat, S., Menage, P.: TCMalloc: thread-caching malloc (2009). \n                      http:\/\/goog-perftools.sourceforge.net\/doc\/tcmalloc.html\n                      \n                    . (read on 14 June 2018)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/s00453-008-9268-x","volume":"58","author":"A Gidenstam","year":"2010","unstructured":"Gidenstam, A., Papatriantafilou, M., Tsigas, P.: NBmalloc: allocating memory in a lock-free manner. Algorithmica 58(2), 304\u2013338 (2010)","journal-title":"Algorithmica"},{"key":"17_CR6","unstructured":"Gloger, W.: Ptmalloc (2006). \n                      http:\/\/www.malloc.de\/en\n                      \n                    . (read on 14 June 2018)"},{"issue":"12","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1016\/j.jpdc.2007.04.010","volume":"67","author":"TE Hart","year":"2007","unstructured":"Hart, T.E., McKenney, P.E., Brown, A.D., Walpole, J.: Performance of memory reclamation for lockless synchronization. J. Parallel Distrib. Comput. 67(12), 1270\u20131285 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Larson, P.\u00c5., Krishnan, M.: Memory allocation for long-running server applications. In: ACM SIGPLAN Notices, vol. 34, no. 3, pp. 176\u2013185 (1998)","DOI":"10.1145\/301589.286880"},{"key":"17_CR9","unstructured":"Lea, D.: A memory allocator called Doug Lea\u2019s Malloc or dlmalloc for short (1996). \n                      http:\/\/g.oswego.edu\/dl\/html\/malloc.html\n                      \n                    . (read on 14 June 2018)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Lee, S., Johnson, T., Raman, E.: Feedback directed optimization of TCMalloc. In: Workshop on Memory Systems Performance and Correctness, p. 3. ACM (2014)","DOI":"10.1145\/2618128.2618131"},{"key":"17_CR11","unstructured":"Lever, C., Boreham, D.: malloc() performance in a multithreaded Linux environment. In: USENIX Annual Technical Conference, pp. 301\u2013311. USENIX (2000)"},{"issue":"6","key":"17_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/996893.996848","volume":"39","author":"MM Michael","year":"2004","unstructured":"Michael, M.M.: Scalable lock-free dynamic memory allocation. ACM Sigplan Not. 39(6), 35\u201346 (2004)","journal-title":"ACM Sigplan Not."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60368-9_19","volume-title":"Memory Management","author":"PR Wilson","year":"1995","unstructured":"Wilson, P.R., Johnstone, M.S., Neely, M., Boles, D.: Dynamic storage allocation: a survey and critical review. In: Baler, H.G. (ed.) IWMM 1995. LNCS, vol. 986, pp. 1\u2013116. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/3-540-60368-9_19"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2013 VECPAR 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15996-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:09:18Z","timestamp":1558343358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15996-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030159955","9783030159962"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15996-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VECPAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Vector and Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"S\u00e3o Pedro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vecpar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vecpar2018.ncc.unesp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}