Re: [RFC PATCH 1/1] SMPdesign: Fix a typo
"Paul E. McKenney" <[email protected]> Mon, 16 Mar 2026 14:03:26 -0700
| Newsgroups | org.kernel.vger.perfbook |
|---|---|
| Message-ID | <26c22162-3f2e-4bc7-851e-62ebd339ddc4@paulmck-laptop> |
On Sun, Mar 15, 2026 at 11:14:24PM -0300, Leonardo Bras wrote: > philophers -> philosophers > > Signed-off-by: Leonardo Bras <[email protected]> > --- > Re-reading, found a typo accidentally. :) ;-) ;-) ;-) Good eyes, applied, and thank you! Thanx, Paul > SMPdesign/SMPdesign.tex | 2 +- > 1 file changed, 1 insertion(+), 1 deletion(-) > > diff --git a/SMPdesign/SMPdesign.tex b/SMPdesign/SMPdesign.tex > index 246182c2..0d94ec3a 100644 > --- a/SMPdesign/SMPdesign.tex > +++ b/SMPdesign/SMPdesign.tex > @@ -19,21 +19,21 @@ The word ``design'' is very important: > You should partition first, batch second, weaken third, and code fourth. > Changing this order often leads to poor performance and scalability > along with great frustration.\footnote{ > That other great dodge around the Laws of Physics, read-only > replication, is covered in \cref{chp:Deferred Processing}.} > > This chapter will also look at some specific problems, including: > > \begin{enumerate} > \item Constraints on the classic Dining Philosophers problem requiring > - that all the philophers be able to dine concurrently. > + that all the philosophers be able to dine concurrently. > \label{sec:SMPdesign:Problems Dining Philosophers} > \item Lock-based double-ended queue implementations that provide > concurrency between operations on both ends of a given queue > when there are many elements in the queue, but still work > correctly when the queue contains only a few elements. > (Or, for that matter, no elements.) > \label{sec:SMPdesign:Problems Double-Ended Queue} > \item Summarizing the rough quality of a concurrent algorithm with only > a few numbers. > \label{sec:SMPdesign:Problems Quality Assessment} > -- > 2.53.0 >