School of Business and Informatics University of Boras 501 90 Boras, Sweden;
Department of Computer Science and Engineering Chalmers University of Technology 412 96 Goeteborg, Sweden;
School of Business and Informatics University of Boras 501 90 Boras, Sweden;
Department of Computer Science and Engineering Chalmers University of Technology 412 96 Goeteborg, Sweden;
concurrent; data structure; non-blocking; shared memory;
机译:无锁并发算法实际上是免等待的吗?
机译:盛宴:轻量级锁定并发二进制搜索树
机译:无锁并发二项式堆
机译:一种用于并发袋的无锁算法
机译:证明一次,有效地运行任何地方:无锁无锁同时算法的工具
机译:基于无锁的多核并发垃圾收集器的研究
机译:并发袋的无锁算法