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

340 BIBLIOGRAPHY[McK06] Paul E. McKenney. SleepableRCU. Available: http://lwn.net/Articles/202847/ Revised:http://www.rdrop.com/users/paulmck/RCU/srcu.2007.01.14a.pdf[Viewed August 21, 2006], October2006.[McK07a] Paul E. McKenney. The design of preemptibleread-copy-update. Available:http://lwn.net/Articles/253651/[Viewed October 25, 2007], October2007.[McK07b] Paul E. McKenney. [PATCH] QRCUwithlocklessfastpath. Available: http://lkml.org/lkml/2007/2/25/18[Viewed March 27, 2008], February2007.[McK07c] Paul E. McKenney. [patch rfc 0/9]RCU: Preemptible RCU. Available:http://lkml.org/lkml/2007/9/10/213 [Viewed October 25, 2007],September 2007.[McK07d] Paul E. McKenney. PriorityboostingRCU read-side criticalsections. Available: http://lwn.net/Articles/220677/ Revised:http://www.rdrop.com/users/paulmck/RCU/RCUbooststate.2007.04.16a.pdf [Viewed September 7,2007], February 2007.[McK07e] Paul E. McKenney. RCU andunloadable modules. Available:http://lwn.net/Articles/217484/[Viewed November 22, 2007], January2007.[McK07f] Paul E. McKenney. Using Promelaand Spin to verify parallel algorithms.Available: http://lwn.net/Articles/243851/ [Viewed September8, 2007], August 2007.[McK07g] Paul E. McKenney. What is RCU?Available: http://www.rdrop.com/users/paulmck/RCU/whatisRCU.html[Viewed July 6, 2007], 07 2007.[McK08a] Paul E. McKenney. HierarchicalRCU. Available: http://lwn.net/Articles/305782/ [Viewed November6, 2008], November 2008.[McK08b] Paul E. McKenney. RCU part 3: theRCU API. Available: http://lwn.net/Articles/264090/ [Viewed January10, 2008], January 2008.[McK08c] Paul E. McKenney. What is RCU? part2: Usage. Available: http://lwn.net/Articles/263130/ [Viewed January 4,2008], January 2008.[McK09a] Paul E. McKenney. Re: [patch fyi]rcu: the bloatwatch edition. Available:http://lkml.org/lkml/2009/1/14/449 [Viewed January 15, 2009],January 2009.[McK09b] Paul E. McKenney. Transactionalmemory everywhere?http://paulmck.livejournal.com/tag/transactional%20memory%20everywhere, September 2009.[MD92]Paul E. McKenney and Ken F. Dove.Efficientdemultiplexingofincomingtcppackets. In SIGCOMM ’92, Proceedingsof the Conference on CommunicationsArchitecture & Protocols, pages269–279, Baltimore, MD, August 1992.Association for Computing Machinery.[Mel06] Melbourne School of Engineering.CSIRAC. Available:http://www.csse.unimelb.edu.au/dept/about/csirac/ [Viewed:December 7, 2008], 2006.[Met99][MG92]Panagiotis Takis Metaxas. Fast ditheringon a data-parallel computer. InProceedings of the IASTED InternationalConference on Parallel and DistributedComputing and Systems, pages570–576, Cambridge, MA, USA, 1999.IASTED.Paul E. McKenney and Gary Graunke.Efficient buffer allocation on sharedmemorymultiprocessors. In IEEEWorkshop on the Architecture andImplementation of High PerformanceCommunication Subsystems, pages194–199, Tucson, AZ, February 1992.The Institute of Electrical and ElectronicsEngineers, Inc.[MGM + 09] Paul E. McKenney, Manish Gupta,Maged M. Michael, Phil Howard,JoshuaTriplett, and Jonathan Walpole.