When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Non-blocking algorithm - Wikipedia

    en.wikipedia.org/wiki/Non-blocking_algorithm

    In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; [1] for some operations, these algorithms provide a useful alternative to traditional blocking implementations. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress ...

  3. Berkeley sockets - Wikipedia

    en.wikipedia.org/wiki/Berkeley_sockets

    A non-blocking socket returns whatever is in the receive buffer and immediately continues. If not written correctly, programs using non-blocking sockets are particularly susceptible to race conditions due to variances in network link speed. [citation needed] A socket is typically set to blocking or non-blocking mode using the functions fcntl ...

  4. Head-of-line blocking - Wikipedia

    en.wikipedia.org/wiki/Head-of-line_blocking

    Head-of-line blocking (HOL blocking) in computer networking is a performance-limiting phenomenon that occurs when a queue of packets is held up by the first packet in the queue. This occurs, for example, in input-buffered network switches , out-of-order delivery and multiple requests in HTTP pipelining .

  5. Nagle's algorithm - Wikipedia

    en.wikipedia.org/wiki/Nagle's_algorithm

    The user-level solution is to avoid write–write–read sequences on sockets. Write–read–write–read is fine. Write–write–write is fine. But write–write–read is a killer. So, if you can, buffer up your little writes to TCP and send them all at once. Using the standard UNIX I/O package and flushing write before each read usually works.