Is Parallel Programming Hard, And, If So, What Can You Do About It?

BIBLIOGRAPHY 339[Kni08][Knu73][Lea97][LLO09]Available: http://portal.acm.org/citation.cfm?id=320619&dl=GUIDE,[Viewed December 3, 2007].John U. Knickerbocker. 3D chip technology.IBM Journal of Research andDevelopment, 52(6), November 2008.Available: http://www.research.ibm.com/journal/rd52-6.html[Viewed: January 1, 2009].Donald Knuth. The Art of ComputerProgramming. Addison-Wesley, 1973.Doug Lea. Concurrent Programmingin Java: Design Principles and Patterns.Addison Wesley Longman, Reading,MA, USA, 1997.Yossi Lev, Victor Luchangco, andMarek Olszewski. Scalable readerwriterlocks. In SPAA ’09: Proceedingsof the twenty-first annual symposium onParallelism in algorithms and architectures,pages 101–110, New York, NY,USA, 2009. ACM.[Lom77] D. B. Lomet. Process structuring,synchronization, and recovery usingatomic actions. SIGSOFT Softw. Eng.Notes, 2(2):128–137, 1977. Available:http://portal.acm.org/citation.cfm?id=808319# [Viewed June 27,2008].[Lov05][LS86][LSH02][Mas92]Robert Love. Linux Kernel Development.Novell Press, second edition,2005.Vladimir Lanin and Dennis Shasha. Asymmetric concurrent b-tree algorithm.In ACM ’86: Proceedings of 1986 ACMFall joint computer conference, pages380–389, LosAlamitos, CA, USA,1986.IEEE Computer Society Press.Michael Lyons, Ed Silha, and BillHay. PowerPC storage model and AIXprogramming. Available: http://www-106.ibm.com/developerworks/eserver/articles/powerpc.html[Viewed: January 31, 2005], August2002.H. Massalin. Synthesis: An EfficientImplementation of Fundamental OperatingSystem Services. PhD thesis,Columbia University, New York, NY,1992.[McK96] Paul E. McKenney. Pattern Languagesof Program Design, volume 2,chapter 31: Selecting Locking Designsfor Parallel Programs, pages501–531. Addison-Wesley, June1996. Available: http://www.rdrop.com/users/paulmck/scalability/paper/mutexdesignpat.pdf [ViewedFebruary 17, 2005].[McK03][McK04]Paul E. McKenney. Using RCU inthe Linux 2.5 kernel. Linux Journal,1(114):18–26, October 2003. Available:http://www.linuxjournal.com/article/6993 [Viewed November14, 2007].Paul E. McKenney. Exploiting DeferredDestruction: An Analysis of Read-Copy-Update Techniques in OperatingSystem Kernels. PhD thesis, OGISchool of Science and Engineeringat Oregon Health and Sciences University,2004. Available: http://www.rdrop.com/users/paulmck/RCU/RCUdissertation.2004.07.14e1.pdf[Viewed October 15, 2004].[McK05a] Paul E. McKenney. Memory orderingin modern microprocessors, part I.Linux Journal, 1(136):52–57, August2005. Available: http://www.linuxjournal.com/article/8211http://www.rdrop.com/users/paulmck/scalability/paper/ordering.2007.09.19a.pdf [ViewedNovember 30, 2007].[McK05b] Paul E. McKenney. Memory orderingin modern microprocessors,part II. Linux Journal, 1(137):78–82, September 2005. Available:http://www.linuxjournal.com/article/8212 http://www.rdrop.com/users/paulmck/scalability/paper/ordering.2007.09.19a.pdf[Viewed November 30, 2007].[McK05c] Paul E. McKenney. Re: [fwd: Re:[patch]real-timepreemption, -rt-2.6.13-rc4-v0.7.52-01]. Available: http://lkml.org/lkml/2005/8/8/108[Viewed March 14, 2006], August 2005.