[1] Susanne A, Jeffery W. Self-organizing Data Structure[M]// Fiat A, Woeginger G. Online Algorithms: The State of the Art. Berlin, Germany: Springer-Verlag, 1998: 13-51.
[2] Valois J D. Lock-free Linked Lists Using Compare-and- swap[C]//Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing. New York, USA: ACM Press, 1995.
[3] Harris T L. A Pragmatic Implementation of Non-blocking Linked-lists[C]//Proceedings of the 15th International Con- ference on Distributed Computing. London, UK: [s. n.], 2001.
[4] Michael M M. High Performance Dynamic Lock-free Hash Tables and List-based Sets[C]//Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures. New York, USA: ACM Press, 2002.
[5] IBM. IBM System/370 Extended Architecture——Principles of Operation: USA, SA22-7085[P]. 1983-03-20.
[6] Treiber R K. Systems Programming: Coping with Parallelism[R]. IBM Almaden Research Center, Tech. Rep.: RJ 5118, 1986.
[7] Michael M M. Safe Memory Reclamation for Dynamic Lock- free Objects Using Atomic Reads and Writes[C]//Proceedings of the 21st Annual Symposium on Principles of Distributed Computing. New York, USA: [s. n.], 2002.
[8] Michael M M. Hazard Pointers: Safe Memory Reclamation for Lock-free Objects[J]. IEEE Transactions on Parallel and Distributed Systems, 2004, 15(8): 491-504.
[9] Michael M M. Scalable Lock-free Dynamic Memory Alloca- tion[C]//Proceedings of Special Interest Group on Programming Languages Notices. Verona, Italy: [s. n.], 2004.
[10] Mikhail F, Eric R. Lock-free Linked Lists and Skip Lists[C]// Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing. New York, USA: ACM Press, 2004.
[11] Steve H, Maurice H, Victor L, et al. A Lazy Concurrent List-based Set Algorithm[C]//Proceedings of the 9th Inter- national Conference on Principles of Distributed Systems. Pisa, Italy: [s. n.], 2005.
[12] Anastasia B, Erez P. Locality-conscious Lock-free Linked Lists[C]//Proceedings of the 12th International Conference on Distributed Computing and Networking. Berlin, Germany: [s. n.], 2011.
[13] Herlihy M, Shavit N. 多处理器编程的艺术[M]. 金 海, 胡 侃, 译. 北京: 机械工业出版社, 2009.
[14] Burrows M, Wheeler D J. A Block-sorting Lossless Data Compression Algorithm[R]. Digital Systems Research Center, Tech. Rep.: 124, 1994.
编辑 金胡考 |