Skip to search formSkip to main contentSkip to account menu

Non-blocking algorithm

Known as: Wait-free algorithms, Lock free, Lock free algorithms 
In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper describes a programming model that integrates intra-node asynchronous task parallelism with inter-node MPI… 
2006
2006
It is desirable to facilitate data communications among concurrent computation threads without incurring non-essential… 
2006
2006
We propose new non-blocking interfaces for the collective group communication functions defined in MPI-1 and MPI-2. This document… 
2005
2005
This paper specifies an advance reservation and co-allocation protocol for grid computing, and a simple framework for supporting… 
1999
1999
In this paper a high-performance copy network named PPCN is proposed for large scale ATM switching systems. The proposed copy… 
1997
1997
In this paper, we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuit-switching… 
1995
1995
In a multithreaded execution, each thread can be thought of as running on its own virtual processor, with several virtual… 
1993
1993
  • H. K. Dai
  • 1993
  • Corpus ID: 41578753
The optimal bound of (n-m+c)c+(m-c) and an Omega (k(n-m+c)c/sup 1/k/) lower bound on the size of synchronous strictly non… 
1990
1990
With the advance of the information-oriented society, research has been carried out on Broadband ISDN (B-ISDN) to enable flexible…