\bibitem{Agarwal}
A.~Agarwal and M.~Cherian.
\newblock Adaptive Backoff Synchronization Techniques.
\newblock In {\em Proceedings of the 16th International Symposium on Computer
  Architecture}, June 1989.

\bibitem{Alewife}
A.~{Agarwal et al.}
\newblock {The MIT Alewife Machine: A Large-Scale Distributed-Memory
  Multiprocessor}.
\newblock In {\em {Proceedings of Workshop on Scalable Shared Memory
  Multiprocessors}}. Kluwer Academic Publishers, 1991.
\newblock An extended version of this paper has been submitted for publication,
  and appears as MIT/LCS Memo TM-454, 1991.

\bibitem{randomload}
B. Aiello, R. Venkatesan and M. Yung.
\newblock Optimal Depth Counting Networks.
\newblock personal communication.

\bibitem{nets} 
J.~Aspnes, M.P. Herlihy, and N. Shavit.  \newblock
Counting Networks.  \newblock {\it Journal of the ACM}, Vol.~41, No.~5
(September 1994), pp. 1020-1048.

%\bibitem{Anderson}
%T.E. Anderson.
%\newblock The Performance of Spin Lock Alternatives for Shared-Memory
%  Multiprocessors.
%\newblock {\em IEEE Transactions on Parallel and Distributed Systems},
%  1(1):6--16, January 1990.

\bibitem{AHS}
J.~Aspnes, M.P. Herlihy, and N.~Shavit.
\newblock Counting Networks and Multi-Processor Coordination.
\newblock In {\em Proceedings of the 23rd Annual Symposium on Theory of
  Computing}, May 1991.

%\bibitem{Batcher}
%K.E. Batcher.
%\newblock Sorting Networks and their Applications.
%\newblock In {\em Proceedings of AFIPS Joint Computer Conference}, pages
 % 338--334, 1968.

\bibitem{Proteus-user}
E.A. Brewer, C.N. Dellarocas.
\newblock {\sc Proteus} {\em User Documentation}. MIT, 545 Technology
Square, Cambridge, MA 02139, 0.5 edition, December 1992.

\bibitem{Proteus}
E.A. Brewer, C.N. Dellarocas, A. Colbrook and W.E. Weihl.
\newblock {\sc Proteus:} A High-Performance Parallel-Architecture
Simulator. 
\newblock MIT Technical Report /MIT/LCS/TR-561, September 1991.

\bibitem{fastgen}
D.G. Carta
\newblock Two Fast Implementations of the ``Minimal Standard'' Random
Number Generator.
\newblock {\em CACM}, 33(1), January 1990.

%\bibitem{alpha}
%Digital Equipment Corporation.
%\newblock Alpha system reference manual.

%\bibitem{lamarca}
%E.W. Felten, A. LaMarca, R. Ladner
%\newblock Building Counting Networks from Larger Balancers
%\newblock University of Washington T.R. \#93-04-09 

%\bibitem{FetchInc}
%E. Freudenthal and A. Gottlieb.
%\newblock Process Coordination with Fetch-and-Increment.
%\newblock In  {\em Proceedings of the 4th International Conference on
%Architecture Support for Programming Languages and Operating Systems},
%April 1991, Santa Clara, California.  To appear.

%\bibitem{IMS}
%D.~Gawlick.
%\newblock Processing 'hot spots' in high performance systems.
%\newblock In {\em Proceedings COMPCON'85}, 1985.

\bibitem{DHW}
C. Dwork, M. P. Herlihy, and O. Waarts. 
Contention in shared memory algorithms. 
In {\em Proceedings of the 25th ACM Symposium on Theory of Computing}, pp.
174-183, May 1993. Expanded version: Digital Equipment Corporation Technical
Report CRL 93/12. 

\bibitem{Ku2}
S.N. Ethier and T.G. Kurtz.
{\sl Markov Processes: Characterization and Convergence.}
John Wiley and Sons, 1986.

\bibitem{Goodman}
J.R. Goodman, M.K. Vernon, and P.J. Woest.
\newblock Efficient Synchronization Primitives for Large-Scale Cache-Coherent
 multiprocessors.
\newblock In {\em Proceedings of the 3rd ASPLOS}, pages 64--75. ACM, April
  1989.

%\bibitem{Ultra}
%A.~Gottlieb, R.~Grishman, C.P. Kruskal, K.P. McAuliffe, L.~Rudolph, and
%  M.~Snir.
%\newblock The {NYU} {Ultracomputer} - designing an {MIMD} parallel computer.
%\newblock {\em IEEE Transactions on Computers}, C-32(2):175--189, February
%  1984.

%\bibitem{Gottlieb}
%A.~Gottlieb, B.D. Lubachevsky, and L.~Rudolph.
%\newblock Basic techniques for the efficient coordination of very large numbers
%  of cooperating sequential processors.
%\newblock {\em ACM Transactions on Programming Languages and Systems},
%  5(2):164--189, April 1983.

%\bibitem{Graunke}
%G.~Graunke and S.~Thakkar.
%\newblock Synchronization Algorithms for Shared-Memory Multiprocessors.
%\newblock {\em IEEE Computer}, 23(6):60--70, June 1990.

%\bibitem{beng}
%M. Herlihy, B.H. Lim and N. Shavit.
%\newblock Low Contention Load Balancing on Large Scale Multiprocessors.
%\newblock {\em Proceedings of the 3rd Annual ASM Symposium on
%Parallel Algorithms and Architectures}, July 1992, San Diego, CA. 
%\newblock Full version available as a DEC TR.

%\bibitem{beng}
%M. Herlihy, B.H. Lim and N. Shavit.
%\newblock Scalable Concurrent Counting. 
%\newblock To appear.

%\bibitem{transmem}
%M.~Herlihy ansd J.E.B.~Moss
%\newblock Transactional Memory: Architectural Support for Highly Concurrent
%Data Structures

%\bibitem{waitfree}
%M.P. Herlihy.
%\newblock Wait-Free Synchronization.
%\newblock {\em ACM Transactions on Programming Languages and Systems},
%  13(1):123--149, January 1991.


%\bibitem{KlugermanPlaxton}
%M.~Klugerman and C.G. Plaxton.
%\newblock Small-depth Counting Networks.
%\newblock 1992 ACM Symposium on the Theory of Computing.

%***ADD TO BIBLIOGRAPHY:

\bibitem{waitfree}
M.P. Herlihy.
\newblock Wait-Free Synchronization.
\newblock {\em ACM Transactions on Programming Languages and Systems},
  13(1):123--149, January 1991.

\bibitem{Simon}
S. Kahan -- TERA Computer Company.
\newblock Personal communication, May 1995.

\bibitem{kcs78}
V.F. Kolchin, B.A. Senast'yanov, and V.P. Chistyakov.
\newblock {\sl Random Allocation}.
\newblock V.H. Winston \& Sons, Washington D.C. 1978.


\bibitem{Ku1}
T.G. Kurtz.
{\sl Approximation of Population Processes.}
CBMS-NSF Reginal Conf. Series in Applied Math. SIAM, 1981.

%\bibitem{rmw}
%C.P. Kruskal, L.~Rudolph, and M.~Snir.
%\newblock Efficient synchronization on multiprocessors with shared memory.
%\newblock In {\em Fifth ACM SIGACT-SIGOPS Symposium on Principles of
%  Distributed Computing}, August 1986.


\bibitem{Mellor-Crummey}
J.M. Mellor-Crummey and M.L. Scott.
\newblock Algorithms for Scalable Synchronization on Shared-Memory
  Multiprocessors.
\newblock Technical Report 342, University of Rochester, Rochester, NY 14627,
  April 1990.

\bibitem{randgen}
S.K. Park and K.W. Miller.
\newblock Random number generators: Good ones are hard to find.
\newblock {\em CACM}, 31(10),October 1988.


\bibitem{TnTnS}
L. Rudolph,
\newblock Decentralized cache scheme for an MIMD parallel processor.
\newblock In {\em 11th Annual Computing Architecture Conference,}
 1983, pp.~340-347.

\bibitem{SZ}
N. Shavit and A. Zemach.
\newblock Diffracting Trees.
\newblock In {\em Proceedings of the 6th ACM Annual Symposium on Parallel 
Algorithms and Architectures (SPAA)}, pp. 167--174, June 1994.

\bibitem{SZ-journal}
N. Shavit and A. Zemach.
\newblock Diffracting Trees.
\newblock In ACM Transactions on Computer Systems, Nov. 1996.

\bibitem{ST}
N. Shavit, and D. Touitou.
\newblock Elimination Trees and the Construction of Pools and Stacks
\newblock In {\em Proceedings of the 7th Annual Symposium on Parallel 
Algorithms and Architectures (SPAA)}, pages 54-63, July 1995.

%\bibitem{Lynch-Tuttle}
%N.A. Lynch and M.R. Tuttle.
%\newblock Hierarchical Correctness Proofs for Distributed Algorithms.
%\newblock In {\em Sixth ACM SIGACT-SIGOPS Symposium on Principles of
%  Distributed Computing}, August 1987, pp. 137--151.
%\newblock Full version available as MIT Technical Report MIT/LCS/TR--387.
        

%\bibitem{mips}
%MIPS Computer Company.
%\newblock The MIPS RISC Architecture.

%\bibitem{softpc}
%J.M. Mellor-Crummey and T.J. LeBlanc.
%\newblock A software instruction counter.
%\newblock In {\it Proceedings of the 3rd ACM International Conference
%On Architectural Support for Programming Languages and Operating
%Systems}, pages 78--86, April 1989.

%\bibitem{RP3}
%G.H.~Pfister et~al.
%\newblock The IBM research parallel processor prototype (RP3): introduction and
%  architecture.
%\newblock In {\em International Conference on Parallel Processing}, 1985.

%\bibitem{HotSpot}
%G.H. Pfister and A.~Norton.
%\newblock `Hot Spot' contention and combining in multistage interconnection
%  networks.
%\newblock {\em IEEE Transactions on Computers}, C-34(11):933--938, November
%  1985.

%\bibitem{RudolphSlivkinUpfal}
%L.~Rudolph, M.~Slivkin, and E.~Upfal.
%\newblock A Simple Load Balancing Scheme for Task Allocation in Parallel
%  Machines.
%\newblock In {\em Proceedings of the 3rd ACM Symposium on Parallel Algorithms
%  and Architectures}, pages 237--245, July 1991.

%\bibitem{Stone}
%H.S. Stone.
%\newblock Database applications of the fetch-and-add instruction.
%\newblock {\em IEEE Transactions on Computers}, C-33(7):604--612, July 1984.

\bibitem{talk dan}
D. Touitou -- Tel-Aviv University.
\newblock Personal communication, October 1994.

%\bibitem{Yew}
%P.C Yew, N.F. Tzeng, and D.H. Lawrie.
%\newblock Distributing Hot-Spot Addressing in Large-Scale Multiprocessors.
%\newblock {\em IEEE Transactions on Computers}, pages 388--395, April 1987.

