| [1]
GUIBAS L J, SEDGEWICK R. A dichromatic framework for balanced trees［C］// Proceedings of 19th Annual Symposium on Foundations of Computer Science. Piscataway, NJ: IEEE Press, 1978: 8-21.
[2]
NURMI O, SOISALON-SOININEN E. Chromatic binary search trees: A structure for concurrent rebalancing［J］. Acta Informatica, 1996,33(6): 547-557.
[3]
BOYAR J, FAGERBERG R, LARSEN K S. Amortization results for chromatic search trees, with an application to priority queues［J］ . Journal of Computer and System Sciences, 1997,55(3): 504-521.
[4]
BARNES G. A Method for implementing lock-free shared data structures［C］// SPAA93: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures. New York: ACM Press,1993:261-270.
[5]
ELEEN F, FATOUROU P, UPPERT E R, et al.Non-blocking binary search trees［C］// Proceedings of the 29th SIGACT-SIGOPS Symposium on Principles of Distributed Computing. New York: ACM Press,2010:131-141.
[6]
BRONSON N G, ASPER J C, HAFI H C, et al.A practical concurrent binary search tree［C］// Proceedings of the 15th SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York: ACM Press,2010:187-197.
[7]
SHAVIT N. Data structures in the multicore age［J］. Communications of the ACM,2011, 54(3):76-84.
[8]
HERLIHY M P, WING J M. Linearizability: A correctness condition for concurrent objects［J］. ACM Transactions on Programming Languages and Systems, 1990,12(3): 463-492.
[9]
PRECHELT L. Technical opinion: Comparing Java vs. C/C efficiency differences to interpersonal differences［J］. Communications of the ACM, 1999,42(10):109-112.
[10]
HEYDON A, NAJORK M. Performance limitations of the Java core libraries［C］// Proceedings of the ACM 1999 Conference on Java Grande. New York: ACM Press,1999:35-41.
[11]
KLEMM R. Practical guidelines for boosting Java server performance［C］// Proceedings of the ACM 1999 Conference on Java Grande. New York: ACM Press,1999:25-34.
[12]
BULL J, SMITH L, WESTHEAD M,et al. A methodology for benchmarking Java Grande applications［C］// Proceedings of the ACM 1999 Conference on Java Grande. New York: ACM Press,1999:81-88.
[13]
HERLIHY M, LEV Y, LAUCHANGCO V, et al.A provably correct scalable concurrent skip list［EB/OL］. [2010-10-10]. http://www.cs.tau.ac.il/~shanir/nir-pubs-web/Papers/OPODIS2006-BA.pdf. |
