Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
Hostname: page-component-559fc8cf4f-qpj69 Total loading time: 0.39 Render date: 2021-03-08T07:02:24.635Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }
EnglishFrançais
Theory and Practice of Logic Programming Theory and Practice of Logic Programming

Article contents

Lock-free atom garbage collection for multithreaded Prolog - ERRATUM

Published online by Cambridge University Press:  09 June 2017

JAN WIELEMAKER  and
KERI HARRIS
Save pdf (0.05 mb)
Rights & Permissions[Opens in a new window]

Extract

Algorithm 4 on page 960 of the above named article (Wielemaker and Harris 2016) is flawed. The issue is illustrated by algorithm 1 (supplementary figure 1). If a thread A detects the condition table too full is false it proceeds adding its atom to the table. If thread B detects the table is (now) too full it starts a resize. The resize allocates a new table and copies the atoms from the old to the new table. If thread A adds the new atom after the copy loop passes its location and before thread B activates the new table the insertion is considered successful, but the new atom is only in the deactivated old table.

Type
Erratum
Information
Theory and Practice of Logic Programming , Volume 18 , Issue 1 , January 2018 , pp. 120
Copyright
Copyright © Cambridge University Press 2017 

References

Wielemaker, J. and Harris, K. 2016. Lock-free atom garbage collection for multithreaded prolog. TPLP 16, 5–6, 950–965.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 1
Total number of PDF views: 146 *
View data table for this chart

* Views captured on Cambridge Core between 09th June 2017 - 8th March 2021. This data will be updated every 24 hours.

Access

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Lock-free atom garbage collection for multithreaded Prolog - ERRATUM
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Lock-free atom garbage collection for multithreaded Prolog - ERRATUM
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Lock-free atom garbage collection for multithreaded Prolog - ERRATUM
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *