Definitions from Wikipedia (Non-blocking algorithm)

▸ noun:  In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; for some operations, these algorithms provide a useful alternative to traditional blocking implementations.


▸ Words similar to non-blocking algorithm
▸ Usage examples for non-blocking algorithm

▸ Idioms related to non-blocking algorithm
▸ Wikipedia articles (New!)
▸ Words that often appear near non-blocking algorithm
▸ Rhymes of non-blocking algorithm

▸ Invented words related to non-blocking algorithm