sonumb

출처: http://15418.courses.cs.cmu.edu/spring2013/article/46 Implementing Lock-free Stacks and Linked ListsBy kverrier, acappiello, malsup, and bourneBlocking vs. Non-blockingThe primary difference between blocking and non-blocking algorithms is which threads are able to make progress in the code execution. In a blocking model, a single thread is allowed to prevent all other threads from making any..

1. The records in the sorted input file are arranged into buckets (leaf nodes) which are 70% full. 2. Create the first node of the parent-of-leaf level in memory. Read in the first sorted leaf. Put the address of this leaf in the parent in memory. 3. Read in another sorted leaf. Put its lowest key value in the node at the lowest level which is not yet 70% full. If all nodes in the index are 70% ..