{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/lockfree-queue","name":"lockfree-queue","description":"Michael and Scott queues are described in their PODC 1996 paper:\n\nhttp://dl.acm.org/citation.cfm?id=248052.248106\n\nThese are single-ended concurrent queues based on a singlly linked\nlist and using atomic CAS instructions to swap the tail pointers.\nAs a well-known efficient algorithm they became the basis for Java's\nConcurrentLinkedQueue.","version":"0.2.4","softwareVersion":"0.2.4","license":"https://spdx.org/licenses/BSD-3-Clause","codeRepository":"https://github.com/rrnewton/haskell-lockfree","issueTracker":"https://github.com/rrnewton/haskell-lockfree/issues","url":"https://github.com/rrnewton/haskell-lockfree/wiki","keywords":["bsd3","concurrent","data","library","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"ryanglscott"},{"@type":"Person","name":"RyanNewton"},{"@type":"Person","name":"peter_fogg"}],"author":[{"@type":"Person","name":"ryanglscott"},{"@type":"Person","name":"RyanNewton"},{"@type":"Person","name":"peter_fogg"}],"copyrightHolder":[{"@type":"Person","name":"ryanglscott"},{"@type":"Person","name":"RyanNewton"},{"@type":"Person","name":"peter_fogg"}],"dateCreated":"2012-10-01","dateModified":"2022-08-26","datePublished":"2022-08-26","copyrightYear":2012,"downloadUrl":"https://hackage.haskell.org/package/lockfree-queue-0.2.4/lockfree-queue-0.2.4.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/lockfree-queue"],"https://www.w3.org/ns/activitystreams#likes":106,"https://forgefed.org/ns#forks":25}