Bibliography

1. Adve SV, Gharachorloo K. Shared memory consistency models: A tutorial. Computer. 1996;29(12):66–76.

2. Afek Y, Attiya H, Dolev D, Gafni E, Merritt M, Shavit N. Atomic snapshots of shared memory. Journal of the ACM (JACM). 1993;40(4):873–890.

3. Afek Y, Dauber D, Touitou D. Wait-free made fast. In: STOC’95: Proc of the Twenty-seventh Annual ACM Symposium on Theory of Computing. NY, USA: ACM Press; 1995;538–547.

4. Afek Y, Stupp G, Touitou D. Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract). In: PODC’ 00: Proc of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 2000;71–80.

5. Afek Y, Weisberger E, Weisman H. A completeness theorem for a class of synchronization objects. In: PODC’ 93: Proc of the Twelfth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1993;159–170.

6. Agarwal A, Cherian M. Adaptive backoff synchronization techniques. In: Proc of the Sixteenth International Symposium on Computer Architecture. May 1989;396–406.

7. Agesen O, Detlefs D, Garthwaite A, Knippel R, Ramakrishna YS, White D. An efficient meta-lock for implementing ubiquitous synchronization. ACM SIGPLAN Notices. 1999;34(10):207–222.

8. Ajtai M, Komlós J, Szemerédi E. An O(n log n) sorting network. Combinatorica. 1983;3(1):1–19.

9. Amdahl GM. Validity of the single-processor approach to achieving large scale computing capabilities. In: AFIPS Conference Proceedings. Reston, VA, USA: AFIPS Press; April 1967;483–485.

10. Anderson JH. Composite registers. Distributed Computing. 1993;6(3):141–154.

11. Anderson JH, Moir M. Universal constructions for multi-object operations. In: PODC’ 95: Proc of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1995;184–193.

12. J. H. Anderson, M. G. Gouda, and A. K. Singh. The elusive atomic register. Technical Report TR 86.29, University of Texas at Austin, 1986.

13. Anderson JH, Gouda MG, Singh AK. The elusive atomic register. Journal of the ACM. 1994;41(2):311–339.

14. Anderson TE. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems. 1990;1(1):6–16.

15. Arora NS, Blumofe RD, Plaxton CG. Thread scheduling for multiprogrammed multiprocessors. In: Proc of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures. NY, USA: ACM Press; 1998;119–129.

16. Aspnes J, Herlihy M, Shavit N. Counting networks. Journal of the ACM. 1994;41(5):1020–1048.

17. Bacon DF, Konuru RB, Murthy C, Serrano MJ. Thin locks: Featherweight synchronization for Java. In: PLDI’ 98: Proc of the ACM SIGPLAN 1998 conference on Programming Language Design and Implementation. NY, USA: ACM Press; 1998;258–268.

18. Batcher K. Sorting Networks and Their Applications. In: Reston, VA, USA 1968;307–314. Proc of the AFIPS Spring Joint Computer Conference. 32.

19. Bayer R, Schkolnick M. Concurrency of operations on B-trees. Acta Informatica. 1977;9:1–21.

20. Blumofe RD, Leiserson CE. Scheduling multithreaded computations by work stealing. Journal of the ACM (JACM). 1999;46(5):720–748.

21. Boehm HJ. Threads cannot be implemented as a library. In: PLDI’ 05: Proc of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation. NY, USA: ACM Press; 2005;261–268.

22. Borowsky E, Gafni E. Immediate atomic snapshots and fast renaming. In: PODC’ 93: Proc of the Twelfth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1993;41–51.

23. Burns JE, Lynch NA. Bounds on shared memory for mutual exclusion. Information and Computation. December 1993;107(2):171–184.

24. Burns JE, Peterson GL. Constructing multi-reader atomic values from non-atomic values. In: PODC’ 87: Proc of the Sixth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1987;222–231.

25. Busch C, Mavronicolas M. A combinatorial treatment of balancing networks. Journal of the ACM. 1996;43(5):794–839.

26. Chandra TD, Jayanti P, Tan K. A polylog time wait-free construction for closed objects. In: PODC’ 98: Proc of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1998;287–296.

27. G. Chapman, J. Cleese, T. Gilliam, E. Idle, T. Jones, and M. Palin. Monty phyton and the holy grail, Motion Picture, Michael White Productions, Released 10 May 1975, USA.

28. Chase D, Lev Y. Dynamic circular work-stealing deque. In: SPAA’ 05: Proc of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. NY, USA: ACM Press; 2005;21–28.

29. Church A. A note on the entscheidungs problem. Journal of Symbolic Logic 1936.

30. T. Craig. Building FIFO and priority-queueing spin locks from atomic swap. Technical Report TR 93-02-02, University of Washington, Department of Computer Science, February 1993.

31. Dice D. Implementing fast Java monitors with relaxed-locks. Proc of the JavaTM Virtual Machine Research and Technology Symposium on JavaTM Virtual Machine Research and Technology Symposium April 23–24, 2001;13.

32. Dice D, Shalev O, Shavit N. Transactional locking II. Proc of the Twentieth International Symposium on Distributed Computing (DISC 2006) 2006;194–208.

33. Dijkstra EW. The structure of the THE multiprogramming system. Communications of the ACM. 1968;11(5):341–346 ACM Press.

34. Dolev D, Shavit N. Bounded concurrent time-stamping. SIAM Journal of Computing. 1997;26(2):418–455.

35. Dowd M, Perl Y, Rudolph L, Saks M. The periodic balanced sorting network. Journal of the ACM. 1989;36(4):738–757.

36. Doyle AC. A Study in Scarlet and the Sign of Four NY: Berkley Publishing Group; 1994.

37. Dwork C, Waarts O. Simple and efficient bounded concurrent timestamping and the traceable use abstraction. Journal of the ACM (JACM). 1999;46(5):633–666.

38. Ellis C. Concurrency in linear hashing. ACM Transactions on Database Systems (TODS). 1987;12(2):195–217.

39. Fich FE, Hendler D, Shavit N. On the inherent weakness of conditional primitives. Distributed Computing. 2006;18(4):267–277.

40. Fischer MJ, Lynch NA, Paterson MS. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM). 1985;32(2):374–382.

41. Flood CH, Detlefs D, Shavit N, Zhang X. Parallel garbage collection for shared memory multiprocessors. In: JVM’ 01 Proc of the JavaTM Virtual Machine Research and Technology Symposium on JavaTM Virtual Machine Research and Technology Symposium. Berkelay, CA, USA: USENIX Association; 2001.

42. K. Fraser. Practical Lock-Freedom. Ph.D. dissertation, Kings College, University of Cambridge, Cambridge, England, September 2003.

43. B. Gamsa, O. Kreiger, E. W. Parsons, and M. Stumm. Performance issues for multiprocessor operating systems. Technical report, Computer Systems Research Institute, University of Toronto, 1995.

44. Gao H, Groote JF, Hesselink WH. Lock-free dynamic hash tables with open addressing. Distributed Computing. 2005;18(1):21–42.

45. Goodman JR, Vernon MK, Woest PJ. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In: Proc of the Third International Conference on Architectural support for Programming Languages and Operating Systems. ACM Press 1989;64–75.

46. Gosling J, Joy B, Steele Jr GL, Bracha G. The Java Language Specification third edition Upper Saddle River, New Jersey, USA: Prentice Hall PTR; 2005.

47. Gottlieb A, Grishman R, Kruskal CP, McAuliffe KP, Rudolph L, Snir M. The NYU ultracomputer-designing an MIMD parallel computer. IEEE Transactions on Computers. February 1984;C-32(2):175–189.

48. Greenwald M. Two-handed emulation: How to build non-blocking implementations of complex data-structures using DCAS. In: PODC’ 02: Proc of the Twenty-first Annual Symposium on Principles of Distributed Computing. NY, USA: ACM Press; July 2002;260–269.

49. Guerraoui R, Herlihy M, Pochon B. Toward a theory of transactional contention managers. In: PODC’ 05: Proc of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing. Las Vegas, NY, USA: ACM Press; 2005;258–264.

50. Haldar S, Vidyasankar K. Constructing 1-writer multireader multivalued atomic variables from regular variables. Journal of the ACM. 1995;42(1):186–203.

51. Haldar S, Vitányi P. Bounded concurrent timestamp systems using vector clocks. Journal of the ACM (JACM). 2002;49(1):101–126.

52. Hansen PB. Structured multi-programming. Communications of the ACM. 1972;15(7):574–578.

53. Harris T. A pragmatic implementation of non-blocking linked-lists. In: Proc of Fifteenth International Symposium on Distributed Computing (DISC 2001), Lisbon, Portugal, volume 2180 of Lecture Notes in Computer Science. Springer-Verlag October 2001;300–314.

54. Harris T, Marlowe S, Peyton-Jones S, Herlihy M. Composable memory transactions. In: PPoPP’ 05: Proc of the Tenth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. NY, USA: ACM Press; 2005;48–60.

55. Heller S, Herlihy M, Luchangco V, Moir M, Scherer III WN, Shavit N. A Lazy Concurrent List-Based Set Algorithm. Proc of the Ninth International Conference on Principles of Distributed Systems (OPODIS 2005) 2005;3–16.

56. Hendler D, Shavit N. Non-blocking Steal-half Work Queues. In: Proc of the Twenty-first Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press 2002;280–289.

57. Hendler D, Shavit N, Yerushalmi L. A scalable lock-free stack algorithm. In: SPAA’ 04: Proc of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. NY, USA: ACM Press; 2004;206–215.

58. Hennessy JL, Patterson DA. Computer Architecture: A Quantitative Approach Morgan Kaufmann Publishers 1995.

59. Hensgen D, Finkel R, Manber U. Two algorithms for barrier synchronization. International Journal of Parallel Programming. 1988;17(1):1–17 0885-7458.

60. Herlihy M. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems. November 1993;15(5):745–770.

61. Herlihy M, Luchangco V, Moir M. Obstruction-Free Synchronization: Double-Ended Queues as an Example. In: ICDCS’ 03: Proc of the Twenty-third International Conference on Distributed Computing Systems. Washington, DC, USA: IEEE Computer Society; 2003;522.

62. Herlihy M. Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS). 1991;13(1):124–149.

63. Herlihy M, Shavit N. On the nature of progress. In: Principles of Distributed Systems—15th International Conference, OPODIS 2011. December 13–16, 2011;313–328.

64. M. Herlihy, Y. Lev, and N. Shavit. A lock-free concurrent skiplist with wait-free search. Unpublished Manuscript, Sun Microsystems Laboratories, Burlington, Massachusetts, 2007.

65. Herlihy M, Lim B-H, Shavit N. Scalable concurrent counting. ACM Transactions on Computer Systems. 1995;13(4):343–364.

66. Herlihy M, Luchangco V, Moir M, Scherer III WN. Software transactional memory for dynamic-sized data structures. In: PODC’ 03, Proc of the Twenty-second Annual Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 2003;92–101.

67. Herlihy M, Moss JEB. Transactional memory: architectural support for lock-free data structures. In: Proc of the Twentieth Annual International Symposium on Computer Architecture. San Diego, California: ACM Press; 1993;289–300.

68. M. Herlihy, N. Shavit, and M. Tzafrir. Concurrent cuckoo hashing. Technical report, Providence RI, Brown University, 2007.

69. Herlihy M, Wing JM. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS). 1990;12(3):463–492.

70. Hoare CAR. “partition: Algorithm 63,” “quicksort: Algorithm 64,” and “find: Algorithm 65”. Communications of the ACM. 1961;4(7):321–322.

71. Hoare CAR. Monitors: an operating system structuring concept. Communications of the ACM. 1974;17(10):549–557.

72. Hsu M, Yang WP. Concurrent operations in extendible hashing. In: Symposium on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.; 1986;241–247.

73. Huang JS, Chow YC. Parallel sorting and data partitioning by sampling. In: Proc of the IEEE Computer Society's Seventh International Computer Software and Applications Conference. 1983;627–631.

74. Hunt GC, Michael MM, Parthasarathy S, Scott ML. An efficient algorithm for concurrent priority queue heaps. Inf Process Lett. 1996;60(3):151–157.

75. Intel Corporation. Pentium Processor User's Manual Intel Books 1993.

76. Israeli A, Rappaport L. Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC’ 94: Proc of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; August 14–17 1994;151–160.

77. Israeli A, Li M. Bounded time stamps. Distributed Computing. 1993;6(5):205–209.

78. Israeli A, Shaham A. Optimal multi-writer multi-reader atomic register. In: PODC’ 92: Proc of the Eleventh Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1992;71–82.

79. Jayanti P. Robust wait-free hierarchies. Journal of the ACM. 1997;44(4):592–614.

80. Jayanti P. A lower bound on the local time complexity of universal constructions. In: PODC’ 98: Proc of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1998;183–192.

81. Jayanti P, Toueg S. Some results on the impossibility, universality, and decidability of consensus. In: WDAG’ 92: Proc of the Sixth International Workshop on Distributed Algorithms. London, UK: Springer-Verlag; 1992;69–84.

82. Jiménez-González D, Larriba-Pey J, Navarro J. CC-Radix: A cache conscious sorting based on Radix sort. In: Proc Eleventh Euromicro Conference on Parallel, Distributed, and Network-Based Processing. 2003;101–108.

83. L. M. Kirousis, P. G. Spirakis, and P. Tsigas. Reading many variables in one atomic operation: Solutions with linear or sublinear complexity. In IEEE Trans. Parallel Distributed System, 5(7): 688–696, Piscataway, NJ, USA, 1994, IEEE Press.

84. M. R. Klugerman. Small-depth counting networks and related topics. Technical Report MIT/LCS/TR-643, MIT Laboratory for Computer Science, 1994.

85. Klugerman M, Greg Plaxton C. Small-depth counting networks. In: STOC’ 92: Proc of the Twenty-fourth Annual ACM Symposium on Theory of Computing. NY, USA: ACM Press; 1992;417–428.

86. Knuth DE. The Art of Computer Programming: Second Ed (Addison-Wesley Series in Computer Science and Information) Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc.; 1978.

87. Kumar V. Concurrent operations on extendible hashing and its performance. Communications of the ACM. 1990;33(6):681–694.

88. Lamport L. A new solution of Dijkstra's concurrent programming problem. Communications of the ACM. 1974;17(5):543–545.

89. Lamport L. Time, clocks, and the ordering of events. Communications of the ACM. July 1978;21(7):558–565.

90. Lamport L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers. September 1979;C-28(9):690.

91. Lamport L. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems. 1983;5(2):190–222.

92. Lamport L. Invited address: Solved problems, unsolved problems and non-problems in concurrency. In: Proc of the Third Annual ACM Symposium on Principles of Distributed Computing. ACM Press 1984;1–11.

93. Lamport L. The mutual exclusion problem—Part I: A theory of interprocess communication. Journal of the ACM (JACM). 1986;33(2):313–326 ACM Press.

94. Lamport L. The mutual exclusion problem—Part II: Statement and solutions. Journal of the ACM (JACM). 1986;33(2):327–348.

95. Lamport L. A fast mutual exclusion algorithm. ACM Trans Comput Syst. 1987;5(1):1–11.

96. Lampson B, Redell D. Experience with processes and monitors in mesa. Communications of the ACM. 1980;2(23):105–117.

97. Larus JR, Rajwar R. Transactional Memory San Francisco: Morgan and Claypool; 2006.

98. Lea D. Java community process, JSR 166, concurrency utilities. http://gee.cs.oswego.edu/dl/concurrency-interest/index.html; 2003.

99. Lea D. Concurrent hash map in JSR 166 concurrency utilities. http://gee.cs.oswego.edu/dl/concurrency-interest/index.html; Dec 2007.

100. D. Lea, Personal Communication, 2007.

101. Lee S-J, Jeon M, Kim D, Sohn A. Partitioned parallel radix sort. J Parallel Distributed Computing. 2002;62(4):656–668.

102. C. E. Leiserson and H. Prokop. A minicourse on multithreaded programming, Massachusetts Institute of Technology, Available on the Internet from http://theory.lcs.mit.edu/~click, 1998. citeseer.ist.psu.edu/leiserson98minicourse.html.

103. Y. Lev, M. Herlihy, V. Luchangco, and N. Shavit. A Simple Optimistic Skiplist Algorithm. Fourteenth Colloquium on structural information and communication complexity (SIROCCO) 2007 pp. 124–138, June 5–8, 2007, Castiglioncello (LI), Italy.

104. Li M, Tromp J, Vitányi PMB. How to share concurrent wait-free variables. Journal of the ACM. 1996;43(4):723–746.

105. Lim B-H. Personal Communication Cambridge: Massachusetts; 1995.

106. Lo W-K, Hadzilacos V. All of us are smarter than any of us: wait-free hierarchies are not robust. In: STOC’ 97: Proc of the Twenty-ninth Annual ACM Symposium on Theory of Computing. NY, USA: ACM Press; 1997;579–588.

107. Lotan I, Shavit N. Skiplist-based concurrent priority queues. In: Proc of the Fourteenth International Parallel and Distributed Processing Symposium (IPDPS). Cancun, Mexico 2000;263–268.

108. Loui M, Abu-Amara H. Memory requirements for agreement among unreliable asynchronous processes. In: Preparata FP, ed. Greenwich, CT: JAI Press; 1987;163–183. Advances in Computing Research. volume 4.

109. Luchangco V, Nussbaum D, Shavit N. A Hierarchical CLH Queue Lock. In: Proc of the European Conference on Parallel Computing (EuroPar 2006). Dresdan, Germany 2006;801–810.

110. P. Magnussen, A. Landin, and E. Hagersten. Queue locks on cache coherent multiprocessors. In Proc. of the Eighth International Symposium on Parallel Processing (IPPS), pp. 165–171, April 1994. IEEE Computer Society, April 1994. Vancouver, British Columbia, Canada, NY, USA, 1987, ACM Press.

111. Manson J, Pugh W, Adve SV. The Java memory model. In: POPL’ 05: Proc of the Thirty-second ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. NY, USA: ACM Press; 2005;378–391.

112. McKenney PE. Selecting locking primitives for parallel programming. Communications of the ACM. 1996;39(10):75–82.

113. Mellor-Crummey J, Scott ML. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems. 1991;9(1):21–65.

114. Michael MM. High performance dynamic lock-free hash tables and list-based sets. In: SPAA’ 02: Proc of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures. Winnipeg, Manitoba, Canada, NY, USA: ACM Press; 2002;73–82.

115. Michael MM, Scott ML. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing. ACM Press 1996;267–275.

116. Misra J. Axioms for memory access in asynchronous hardware systems. ACM Transactions on Programming Languages and Systems (TOPLAS). 1986;8(1):142–153.

117. Moir M. Practical implementations of non-blocking synchronization primitives. In: PODC’ 97: Proc of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1997;219–228.

118. Moir M. Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. In: PODC’ 00: Proc of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 2000;61–70.

119. Moir M, Nussbaum D, Shalev O, Shavit N. Using elimination to implement scalable and lock-free fifo queues. In: SPAA’ 05: Proc of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. NY, USA: ACM Press; 2005;253–262.

120. Moir M, Marathe V, Shavit N. Composite abortable locks. In: Proc of the 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS). 2006;1–10.

121. Newton I, Cohen (Translator) IB, Whitman (Translator) A. The Principia: Mathematical Principles of Natural Philosophy CA, USA: University of California Press; 1999.

122. Pagh R, Rodler FF. Cuckoo hashing. J Algorithms. 2004;51(2):122–144.

123. Papadimitriou CH. The serializability of concurrent database updates. Journal of the ACM (JACM). 1979;26(4):631–653.

124. Peterson G. Myths about the mutual exclusion problem. Information Processing Letters. June 1981;12(3):115–116.

125. Peterson GL. Concurrent reading while writing. ACM Trans Program Lang Syst. 1983;5(1):46–55.

126. Plotkin SA. Sticky bits and universality of consensus. In: PODC’ 89: Proc of the Eighth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1989;159–175.

127. W. Pugh. Concurrent maintenance of skip lists. Technical Report CS-TR-2222.1, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, 1989.

128. Pugh W. Skip lists: a probabilistic alternative to balanced trees. ACM Transactions on Database Systems. 1990;33(6):668–676.

129. Purcell C, Harris T. Non-blocking hashtables with open addressing Lecture Notes in Computer Science Distributed Computing. In: DISC. Springer Berlin/Heidelberg 2005;108–121.

130. Radovient Z, Hagersten E. Hierarchical Backoff Locks for Nonuniform Communication Architectures. In: Ninth International Symposium on High Performance Computer Architecture. California, USA: Anaheim; February 2003;241–252.

131. Raynal M. Algorithms for Mutual Exclusion Cambridge, MA: The MIT Press; 1986.

132. Reif JH, Valiant LG. A logarithmic time sort for linear size networks. Journal of the ACM. 1987;34(1):60–76.

133. Rudolph L, Segall Z. Dynamic decentralized cache schemes for mimd parallel processors. In: Proceedings of the 11th Annual International Symposium on Computer Architecture, ISCA '84. New York, NY, USA: ACM; 1984;340–347.

134. Rudolph L, Slivkin-Allalouf M, Upfal E. A simple load balancing scheme for task allocation in parallel machines. In: Proc of the Third Annual ACM Symposium on Parallel Algorithms and Architectures. ACM Press July 1991;237–245.

135. Saks M, Shavit N, Woll H. Optimal time randomized consensus—making resilient algorithms fast in practice. In: SODA’ 91: Proc of the Second Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics; 1991;351–362.

136. Scherer III WN, Lea D, Scott ML. Scalable synchronous queues. In: PPoPP’ 06: Proc of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. NY, USA: ACM Press; 2006;147–156.

137. Scherer III WN, Scott ML. Advanced contention management for dynamic software transactional memory. In: PODC’ 05: Proc of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 2005;240–248.

138. Scott ML. Non-blocking timeout in scalable queue-based spin locks. In: PODC’ 02: Proc of the Twenty-first Annual Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 2002;31–40.

139. Scott ML, Scherer III WN. Scalable queue-based spin locks with timeout. ACM SIGPLAN Notices. 2001;36(7):44–52.

140. Sendak M. Where the Wild Things Are NY, USA: Publisher: HarperCollins; 1988.

141. Shalev O, Shavit N. Split-ordered lists: lock-free extensible hash tables. Journal of the ACM. 2006;53(3):379–405 ACM Press.

142. Shavit N, Touitou D. Software transactional memory. Distributed Computing. 1997;Special Issue 10(2):99–116.

143. Shavit N, Zemach A. Diffracting trees. ACM Trans Comput Syst. 1996;14(4):385–428.

144. Shenk E. The consensus hierarchy is not robust. In: PODC’ 97: Proc of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1997;279.

145. R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center, April 1986. San Jose, CA.

146. Turing A. On computable numbers, with an application to the entscheidungs problem. Proc Lond Math Soc 1937; Historical document.

147. Valois JD. Lock-free linked lists using compare-and-swap. In: PODC’ 95: Proc of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing. Ottowa, Ontario, Canada, NY, USA: ACM Press; 1995;214–222.

148. Vitányi P, Awerbuch B. Atomic shared register access by asynchronous hardware. In: Twenty-seventh Annual Symposium on Foundations of Computer Science. Los Angeles, CA, USA: IEEE Computer Society Press; October 1986;233–243.

149. Weihl WE. Local atomicity properties: modular concurrency control for abstract data types. ACM Transactions on Programming Languages and Systems (TOPLAS). 1989;11(2):249–282.

150. Wolfe RN. A protocol for wait-free, atomic, multi-reader shared variables. In: PODC’ 87: Proc of the Sixth Annual ACM Symposium on Principles of Distributed Computing. NY, USA: ACM Press; 1987;232–248.

151. Yew P, Tzeng N, Lawrie D. Distributing hot-spot addressing in large-scale multiprocessors. IEEE Transactions on Computers. April 1987;C-36(4):388–395.

..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.236.142.143