SMP Scalability Papers

  1. Validating Memory Barriers and Atomic Instructions, in Linux Weekly News, December 2011.
  2. Validating Core Parallel Software, at TU Dresden, Germany, October 2011.
  3. Validating Core Parallel Software, at the 2011 China Linux Kernel Developer Conference, Nanjing, China, October 2011. (Invited)
  4. Is Parallel Programming Hard, And If So, What Can You Do About It?, at the 2011 Android System Developer Forum, Taipei, Taiwan, April 2011. (Invited)
  5. Verifying Parallel Software: Can Theory Meet Practice?, at Verification of Concurrent Data Structures (Verico), Austin, TX, USA, January 2011. (Invited)
  6. Concurrent code and expensive instructions, Linux Weekly News, January 2011.
  7. Is Parallel Programming Hard, And, If So, Why?, linux.conf.au January 2011.
  8. Verifying Parallel software: Can Theory Meet Practice?, linux.conf.au January 2011.
  9. Multi-Core Memory Models and Concurrency Theory: A View from the Linux Community, Dagstuhl workshop January 2011.
  10. N1525: Memory-Order Rationale with Blaine Garst (revised). ISO SC22 WG14 (C Language), November 2010.
  11. Omnibus Memory Model and Atomics Paper, ISO SC22 WG21 (C++ Language), with Mark Batty, Clark Nelson, Hans Boehm, Anthony Williams, Scott Owens, Susmit Sarkar, Peter Sewell, Tjark Weber, Michael Wong, Lawrence Crowl, and Benjamin Kosnik. August 2010. Updated November 2010,
  12. Scalable concurrent hash tables via relativistic programming, August 2010, with Josh Triplett and Jonathan Walpole.
  13. Why the grass may not be greener on the other side: a comparison of locking vs. transactional memory, August 2010, with Maged M. Michael, Josh Triplett, and Jonathan Walpole.
  14. Synchronization and Scalability in the Macho Multicore Era , Scuola Superiore Sant'Anna, Pisa, Italy, July 2010.
  15. Additional Atomics Errata. ISO SC22 WG14 (C Language), May 2010.
  16. Additional Atomics Errata, complete with typo in title. ISO SC22 WG14 (C Language), May 2010.
  17. Rationale for C-Language Dependency Ordering. ISO SC22 WG14 (C Language), May 2010.
  18. Updates to C++ Memory Model Based on Formalization. ISO SC22 WG14 (C Language), April 2010. Updated May 2010.
  19. Explicit Initializers for Atomics. ISO SC22 WG14 (C Language), April 2010. Updated May 2010.
  20. Dependency Ordering for C Memory Model. ISO SC22 WG14 (C Language), April 2010.
  21. Explicit Initializers for Atomics. ISO SC22 WG21 (C++ Language) March 2010.
  22. Updates to C++ Memory Model Based on Formalization. ISO SC22 WG21 (C++ Language) February 2010. Updated March 2010.
  23. Dependency Ordering for C Memory Model. ISO SC22 WG14 (C Language) November 2009.
  24. Updates to C++ Memory Model Based on Formalization. ISO SC22 WG14 (C Language) October 2009.
  25. Performance, Scalability, and Real-Time Response From the Linux Kernel short course for ACACES 2009.
  26. Is Parallel Programming Hard, and If So, Why?, presented at January 2009 linux.conf.au, along with corresponding Portland State University technical report.
  27. Example POWER Implementation for C/C++ Memory Model, revision of ISO WG21 N2745. ISO SC22 WG21 (C++ Language) September 2008.
  28. Concurrency and Race Conditions at Linux Plumbers Conference Student Day, September 2008.
  29. After 25 Years, C/C++ Understands Concurrency at linux.conf.au 2008 Mel8ourne. February 2008.
  30. Comparison of locking and transactional memory and presentation at PLOS 2007 with Maged Michael and Jon Walpole. October 2007. (revised presentation.) ( Official version of paper.)
  31. C++0x memory model user FAQ with Hans Boehm, August 2007.
  32. C++ Data-Dependency Ordering: Atomics (Updated), C++ Data-Dependency Ordering: Memory Model (Updated), and C++ Data-Dependency Ordering: Function Annotation (Updated). August 2007. (Updated version of the May 2007 paper.)
  33. C++ Data-Dependency Ordering. May 2007.
  34. A simple and efficient memory model for weakly ordered architectures. Makes case for weakly ordered primitives in programming languages. Updated May 2007.
  35. Overview of Linux-Kernel Reference Counting. January 2007.
  36. Memory Ordering in Modern Microprocessors, appearing in two parts in the August and September 2005 Linux Journal (revised April 2009).
  37. Storage Improvements for 2.6 and 2.7 in August 2004 Linux Journal.
  38. Linux Kernel Scalability: Using the Right Tool for the Job. Presentation on scalability given at the 2004 Ottawa Linux Symposium and revised for the 2005 linux.conf.au.
  39. Issues with Selected Scalability Features of the 2.6 Kernel OLS paper describing scalability, DoS, and realtime limitations of the Linux kernel at that time. With Dipankar Sarma.
  40. Fairlocks--a High-Performance Fair Locking Scheme Bit-vector fair locking scheme for NUMA systems. Revision of paper that appeared in 2002 Parallel and Distributed Computing and Systems, with Swaninathan Sivasubramanian, Jack F. Vogel, and John Stultz. Of course, it is even better to design your software so that lock contention is low enough that fancy locking techniques don't help! We implemented a number of variations on this theme.
  41. Practical Performance Estimation On Shared-Memory Multiprocessors (bibtex). The silver lining of the memory-latency dark cloud--programs whose run time is dominated by memory latency are often amenable to simple performance-estimation methods. Some of these methods are applicable at design time. Revision of PDCS'99 paper.
  42. Differential Profiling (bibtex). Revised version of the MASCOTS'95 and the '99 SP&E papers.
  43. Experience With an Efficient Parallel Kernel Memory Allocator (bibtex). Revised version of the W'93 USENIX and 2001 SP&E papers.
  44. Selecting Locking Designs for Parallel Programs (bibtex). Revised version of the PLoPD-II paper.
  45. Selecting Locking Primitives for Parallel Programs (bibtex). Revised version of the October '96 CACM paper.
  46. Efficient Demultiplexing of Incoming TCP Packets (bibtex). Analytic comparison of a number of demultiplexing techniques. The winner is hashing.
  47. Stochastic Fairness Queueing (bibtex). High-speed approximate implementation of Fair Queueing.
  48. High-Speed Event-Counting and -Classification Using a Dictionary Hash Technique (bibtex). Revised version of the ICPP'89 paper.
  49. Bibtex for other papers.