title: Better explanations of TAS Vs. TTAS in the context of "The Art Of Multiprocessor Programming" Herlihy & Shavits
body: <p>So for some reason I am having trouble grasping the complete concept on why the Test and Test and Set function would work faster then the Test and set function from the book named in the title. Let me elaborate.......</p>
  
  <p>In the above referenced book in the appendix it goes into the computer architecture a very little bit. I have a fairly good grasp of this already. It goes on to summarize that the TTAS is faster than the TAS function because of caching. I don't see how or why this is. Won't the TTAS function cache similarly to the TAS function. What part of the TAS function is causing it to work longer or what causes the TTAS function to work shorter.</p>