Anomalies and Similarities Among Consensus Numbers of Variously-Relaxed Queues
暂无分享,去创建一个
[1] Jennifer L. Welch,et al. Improved Time Bounds for Linearizable Implementations of Abstract Data Types , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.
[2] Hagit Attiya,et al. Sequential consistency versus linearizability , 1994, TOCS.
[3] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[4] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[5] Nir Shavit,et al. The computability of relaxed data structures: queues and stacks as examples , 2016, Distributed Computing.
[6] Ana Sokolova,et al. Quantitative relaxation of concurrent data structures , 2013, POPL.
[7] Jennifer L. Welch,et al. Improving Average Performance by Relaxing Distributed Data Structures , 2014, DISC.
[8] Vassos Hadzilacos,et al. All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust , 2000, SIAM J. Comput..
[9] Yehuda Afek,et al. Quasi-Linearizability: Relaxed Consistency for Improved Concurrency , 2010, OPODIS.
[10] Jennifer L. Welch,et al. Generic Proofs of Consensus Numbers for Abstract Data Types , 2015, OPODIS.
[11] Martha J. Kosa. Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types , 1999, Chic. J. Theor. Comput. Sci..
[12] Wei Chen,et al. On the power of breakable objects , 2013, Theor. Comput. Sci..