bib/WFS.bib

@misc{j1975shared
,title={Shared data controlled by a plurality of users}
,author={J, B.P. and M, S.R.}
,url={https://www.google.com/patents/US3886525}
,year={1975}
,month=may # "~27"
,publisher={Google Patents}
,note={US Patent 3,886,525}
}

@inproceedings{LaninShasha1986TSM
,author = {Vladimir Lanin and Dennis Shasha}
,title = {A symmetric concurrent B-tree algorithm}
,booktitle = {ACM '86: Proceedings of 1986 ACM Fall joint computer conference}
,year = {1986}
,isbn = {0-8186-4743-4}
,pages = {380--389}
,location = {Dallas, Texas, United States}
,publisher = {IEEE Computer Society Press}
,address = {Los Alamitos, CA, USA}
,url = {http://portal.acm.org/citation.cfm?id=324589#}
,lastchecked="March 1, 2005"
}

@article{Herlihy90
,author="Maurice Herlihy"
,title="A Methodology for Implementing Highly Concurrent Data Structures"
,Year="1990"
,Month="March"
,institution="Digital Equipment Corporation"
,journal="Proceedings of the 2\textsuperscript{nd} {ACM} {SIGPLAN}
Principles and Practice of Parallel Programming"
,pages="197-206"
}

@inproceedings{MauriceHerlihy90a
,author="Maurice P. Herlihy"
,title="A Methodology for Implementing Highly Concurrent Data Structures"
,booktitle="Proceedings of the 2nd ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming"
,pages="197--206"
,location="Seattle, WA, USA"
,year="1990"
,month="March"
,doi="10.1145/99163.99185"
}

@article{Herlihy91
,author="Maurice Herlihy"
,title="Wait-Free Synchronization"
,Year="1991"
,Month="January"
,institution="Digital Equipment Corporation"
,journal="ACM TOPLAS"
,volume="13"
,number="1"
,pages="124-149"
,publisher={ACM Press}
,doi="10.1145/114005.102808"
}

@article{Herlihy93
,author="Maurice Herlihy"
,title="A Methodology for Implementing Highly Concurrent Data Objects"
,Year="1993"
,Month="November"
,journal="{ACM} Transactions on Programming Languages and Systems"
,volume="15"
,number="5"
,pages="745-770"
,doi="10.1145/161468.161469"
}

@techreport{JohnsonLockFreePerf93
,author="Theodore Johnson"
,title="Characterizing the Performance of Algorithms for Lock-Free Objects"
,institution="University of Florida"
,address="Gainesville, Florida"
,year="1993"
,number="TR93"
}

@inproceedings{BrianNBershad93a
,author = "Brian N. Bershad"
,title = "Practical Considerations for Non-Blocking Concurrent Objects"
,booktitle = "International Conference on Distributed Computing Systems"
,pages = "264--273"
,year = "1993"
,url="Available:
\url{http://citeseer.ist.psu.edu/cache/papers/cs/3947/ftp:zSzzSzftp.cs.cmu.eduzSzprojectzSzmachzSzdoczSzpublishedzSznon-blocking.pdf/bershad93practical.pdf}
[Viewed March 1, 2005]"
}

@article{Kirousis94
,author="Lefteris M. Kirousis and Paul Spirakis and Phillippas Tsigas"
,title="Reading Many Variables in One Atomic Operation: Solutions with
Linear or Sublinear Complexity"
,Year="1994"
,Month="July"
,journal="IEEE Transactions on Parallel and Distributed Systems"
,volume="5"
,number="7"
,pages="688-696"
}

@conference{Valois95a
,author="John D. Valois"
,title="Lock-Free Linked Lists Using Compare-and-Swap"
,Year="1995"
,location="Ottowa, Ontario, Canada"
,booktitle="Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing"
,series="PODC '95"
,pages="214--222"
,doi="10.1145/224964.224988"
,publisher="ACM"
,address="New York, NY, USA"
}

@unpublished{MagedMichael95a
,Author="Maged M. Michael and Michael L. Scott"
,Title="Correction of a Memory Management Method for Lock-Free Data Structures"
,month="December"
,year="1995"
,note="Technical Report TR599"
,organization="Computer Science Department, University of Rochester"
,url="https://pdfs.semanticscholar.org/cec0/ad7b0fc2d4d6ba45c6212d36217df1ff2bf2.pdf"
,lastchecked="November 14, 2016"
}

@conference{MichaelScott96
,author="M.M Michael and M. L. Scott"
,title="Simple, Fast, and Practical Non-Blocking and Blocking Concurrent
Queue Algorithms"
,Year="1996"
,Month="May"
,booktitle="Proc of the Fifteenth ACM Symposium on Principles of Distributed Computing"
,pages="267--275"
,doi="10.1145/248052.248106"
,note="Available:
\url{http://www.research.ibm.com/people/m/michael/podc-1996.pdf}
[Viewed January 26, 2009]"
}

@article{MagedMichael1993JPDC
,author = {Michael, Maged M. and Scott, Michael L.}
,title = {Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors}
,journal = {J. Parallel Distrib. Comput.}
,volume = {51}
,number = {1}
,year = {1998}
,issn = {0743-7315}
,pages = {1--26}
,doi = {10.1006/jpdc.1998.1446}
,publisher = {Academic Press, Inc.}
,address = {Orlando, FL, USA}
}

@conference{Bacon01a
,author="David E. Bacon and V. T. Rajan"
,title="Concurrent Cycle Collection in Reference Counted Systems"
,Year="2001"
,Month="June"
,booktitle="Proceedings of European Conference on Object Oriented Programming"
,pages="@@--@@"
}

@conference{Detlefs01a
,author="David L. Detlefs and Paul A. Martin and Mark Moir and Guy L. Steel Jr."
,title="Concurrent Cycle Collection in Reference Counted Systems"
,Year="2001"
,Month="June"
,booktitle="Proceedings of European Conference on Object Oriented Programming"
}

@article{DavidLDetlefs2002a
,author = {David L. Detlefs and Paul A. Martin and Mark Moir and Steele, Jr., Guy L.}
,title = {Lock-free reference counting}
,journal = {Distributed Computing}
,volume = {15}
,number = {4}
,year = {2002}
,issn = {0178-2770}
,pages = {255--271}
,doi = {10.1017/s00446-002-0079-z}
,publisher = {Springer-Verlag}
}

@conference{Michael02a
,author="Maged M. Michael"
,title="Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic
Reads and Writes"
,Year="2002"
,Month="August"
,booktitle="{Proceedings of the 21\textsuperscript{st} Annual ACM
Symposium on Principles of Distributed Computing}"
,pages="21-30"
}

@conference{Michael02b
,author="Maged M. Michael"
,title="High Performance Dynamic Lock-Free Hash Tables and List-Based Sets"
,Year="2002"
,Month="August"
,booktitle="{Proceedings of the 14\textsuperscript{th} Annual ACM
Symposium on Parallel
Algorithms and Architecture}"
,pages="73-82"
}

@conference{HerlihyLM03
,author="Maurice Herlihy and Victor Luchangco and Mark Moir"
,title="Obstruction-Free Synchronization: Double-Ended Queues as an Example"
,Year="2003"
,Month="May"
,booktitle="{Proceedings of the 23\textsuperscript{rd} IEEE International
Conference on Distributed Computing Systems (ICDCS)}"
,publisher="The Institute of Electrical and Electronics Engineers, Inc."
,pages="73-82"
,address="Providence, RI"
,url="http://www.cs.brown.edu/people/mph/HerlihyLM03/main.pdf"
,lastchecked="November 13, 2016"
}

@InProceedings{HerlihyLM02
,author={Maurice Herlihy and Victor Luchangco and Mark Moir}
,title="The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized,
Lock-Free Data Structures"
,booktitle={Proceedings of 16\textsuperscript{th} International
Symposium on Distributed Computing}
,location="Toulouse, France"
,year=2002
,month="October"
,pages="339-353"
,doi="10.1007/3-540-36108-1_23"
}

@inproceedings{383979
,author="Maurice Herlihy"
,title="On Beyond Registers: Wait-Free Readable Objects"
,booktitle={Proceedings of the Twentieth Annual ACM Symposium on Principles of
Distributed Computing}
,year={2001}
,isbn={1-58113-383-9}
,pages={26--42}
,location={Newport, Rhode Island, United States}
,publisher={ACM Press}
}

@inproceedings{AndersonMoir95
,author="James H. Anderson and Mark Moir"
,title="Universal Constructions for Large Objects"
,booktitle="{WDAG}: International Workshop on Distributed Algorithms"
,year={1995}
,pages="168-182"
,publisher="LNCS, Springer-Verlag"
}

@phdthesis{KeirAnthonyFraserPhD
,author="Keir Anthony Fraser"
,title="Practical Lock-Freedom"
,school="King's College, University of Cambridge"
,year="2003"
}

@article{KeirFraser2007withoutLocks
,author = {Fraser, Keir and Harris, Tim}
,title = {Concurrent programming without locks}
,journal = {ACM Trans. Comput. Syst.}
,volume = {25}
,number = {2}
,year = {2007}
,issn = {0734-2071}
,pages = {1--61}
,doi = {10.1145/1233307.1233309}
,publisher = {ACM}
,address = {New York, NY, USA}
}

@inproceedings{Herlihy:2007:SOS:1760631.1760646
,author = {Herlihy, Maurice and Lev, Yossi and Luchangco, Victor and Shavit, Nir}
,title = {A Simple Optimistic Skiplist Algorithm}
,booktitle = {Proceedings of the 14th International Conference on Structural Information and Communication Complexity}
,series = {SIROCCO'07}
,year = {2007}
,isbn = {978-3-540-72918-1}
,location = {Castiglioncello, LI, Italy}
,pages = {124--138}
,numpages = {15}
,url = {http://dl.acm.org/citation.cfm?id=1760631.1760646}
,acmid = {1760646}
,publisher = {Springer-Verlag}
,address = {Berlin, Heidelberg}
}

@unpublished{Treiber86
,Author="R. K. Treiber"
,Title="Systems Programming: Coping with Parallelism"
,month="April"
,year="1986"
,organization="IBM Almaden Research Center"
,note="{RJ} 5118"
}

@inproceedings{DBLP:conf/europar/Michael03
,author    = {Maged M. Michael}
,title     = {CAS-Based Lock-Free Algorithm for Shared Deques}
,booktitle = {Euro-Par}
,year      = {2003}
,pages     = {651-660}
,ee        = {http://dx.doi.org/10.1007/978-3-540-45209-6_92}
,doi       = {10.1007/978-3-540-45209-6_92}
,crossref  = {DBLP:conf/europar/2003}
,bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/europar/2003
,editor    = {Harald Kosch and
       L{\'a}szl{\'o} B{\"o}sz{\"o}rm{\'e}nyi and
       Hermann Hellwagner}
,title     = {Euro-Par 2003. Parallel Processing, 9th International Euro-Par
       Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings}
,booktitle = {Euro-Par}
,publisher = {Springer}
,series    = {Lecture Notes in Computer Science}
,volume    = {2790}
,year      = {2003}
,isbn      = {3-540-40788-X}
,bibsource = {DBLP, http://dblp.uni-trier.de}
}

@unpublished{AndreiAlexandrescu04a
,Author="Andrei Alexandrescu"
,Title="Lock-Free Programming"
,month="December"
,year="2004"
,note="Available:
\url{http://www.nwcpp.org/Downloads/2005/Lock-Free.pdf}
[Viewed January 26, 2005]"
}

@unpublished{CScottAnanian04a
,Author="C. Scott Ananian"
,Title="Non-Blocking Synchronization and Object-Oriented Operating System
Design"
,month="Unknown"
,year="2004?"
,note="Available:
\url{Unknown}
[Viewed Not Yet]"
}

@article{MagedMichael04a
,author="Maged M. Michael"
,title="Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects"
,Year="2004"
,Month="June"
,journal="IEEE Transactions on Parallel and Distributed Systems"
,volume="15"
,number="6"
,pages="491-504"
,url={http://www.research.ibm.com/people/m/michael/ieeetpds-2004.pdf}
,lastchecked="March 1, 2005"
}

@article{MagedMichael04NBSmalloc
,author="Maged M. Michael"
,title="Scalable lock-free dynamic memory allocation"
,Year="2004"
,journal="SIGPLAN Not."
,volume="39"
,number="6"
,pages="35--46"
,doi={10.1145/996893.996848}
,publisher="ACM"
,address="New York, NY, USA"
}

@phdthesis{Sundell04
,author="H\.{a}kan Sundell"
,title="Efficient and Practical Non-Blocking Data Structures"
,school="Chalmers University of Technology"
,year="2004"
,url="http://www.cs.chalmers.se/~phs/phd.pdf"
}

@inproceedings{HansJBoehm2004
,author="Hans-J. Boehm"
,title="An Almost Non-Blocking Stack"
,booktitle="Proc. 23rd  ACM Symp. on Principles of Distributed Computing"
,year="2004"
,pages="40-49"
}

@inproceedings{TimothyLHarris2001
,author = {Timothy L. Harris}
,title = {A Pragmatic Implementation of Non-blocking Linked-Lists}
,booktitle = {Proc. 15th Intl. Conf. on Distributed Computing}
,year = {2001}
,isbn = {3-540-42605-1}
,pages = {300--314}
,publisher = {Springer-Verlag}
}

@inproceedings{SteveHeller2005LazyList
,author = {Steve Heller and Maurice Herlihy and Victor Luchangco and Mark Moir and
William N. {Scherer III} and Nir Shavit}
,title = {A Lazy Concurrent List-Based Set Algorithm}
,booktitle = {Principles of Distributed Systems, 9th International Conference OPODIS 2005}
,year = {2005}
,isbn = {3-540-36321-1}
,pages = {3--16}
,publisher = {Springer-Verlag}
}

@article{OriShalev2006SplitOrderListHash
,author = {Shalev, Ori and Shavit, Nir}
,title = {Split-ordered lists: Lock-free extensible hash tables}
,journal = {J. ACM}
,issue_date = {May 2006}
,volume = {53}
,number = {3}
,month = may
,year = {2006}
,issn = {0004-5411}
,pages = {379--405}
,numpages = {27}
,url = {http://doi.acm.org/10.1145/1147954.1147958}
,doi = {10.1145/1147954.1147958}
,acmid = {1147958}
,publisher = {ACM}
,address = {New York, NY, USA}
,keywords = {Concurrent data structures, compare-and-swap, hash table, non-blocking synchronization}
}

@article{SamyAlBahra2013NBS
,author = {Al Bahra, Samy}
,title = {Nonblocking Algorithms and Scalable Multicore Programming}
,journal = {Commun. ACM}
,issue_date = {July 2013}
,volume = {56}
,number = {7}
,month = jul
,year = {2013}
,issn = {0001-0782}
,pages = {50-61}
,numpages = {12}
,url = {http://doi.acm.org/10.1145/2483852.2483866}
,doi = {10.1145/2483852.2483866}
,acmid = {2483866}
,publisher = {ACM}
,address = {New York, NY, USA}
}

@unpublished{DanAlitarh2013PracticalProgress
,Author="Dan Alistarh and Keren Censor-Hillel and Nir Shavit"
,Title="Are Lock-Free Concurrent Algorithms Practically Wait-Free?"
,month="December"
,year="2013"
,eprint="1311.3200v2"
,note="ArXiv:1311.3200v2"
}