Add to ORKGIt is well known that synchronization and communication delays are the major sources of performance degradation of synchronous parallel algorithms. It has been shown that asynchronous implementations have the potential to reduce the overhead to minimum. This paper surveys the existing asynchronous schemes and the sufficient conditions for the convergence of the surveyed schemes. Some comparisons among these schemes are also presented
A methodology is introduced for minimizing the total execution time for a class of large-scale paral...
The directed acyclic graph (DAG) associated with a parallel al-gorithm captures the order in which s...
Massively parallel supercomputers are susceptible to variable performance due to factors such as di...
In this thesis, we present a body of work on the performance and convergence properties of asynchron...
In this thesis, we present a body of work on the performance and convergence properties of asynchron...
High performance networks of workstation are becoming increasingly popular a parallel computing plat...
International audienceIterative asynchronous parallel methods are nowadays gaining renewed interest ...
Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle times. T...
Cover title.Includes bibliographical references (p. 29-33).Research supported by the NSF. ECS-851905...
A model is defined in which questions concerning delay bounded asynchronous parallel systems may be ...
AbstractAsynchronous iterations arise naturally on parallel computers if one wants to minimize idle ...
textabstractThe parallel execution of branch and bound algorithms can result in seemingly unreasonab...
This paper reports of part of a continuing investigation of parallel computation, in particular, eff...
International audienceAIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a pa...
AbstractWe consider the problem of asynchronous execution of parallel programs. We assume that the o...
A methodology is introduced for minimizing the total execution time for a class of large-scale paral...
The directed acyclic graph (DAG) associated with a parallel al-gorithm captures the order in which s...
Massively parallel supercomputers are susceptible to variable performance due to factors such as di...
In this thesis, we present a body of work on the performance and convergence properties of asynchron...
In this thesis, we present a body of work on the performance and convergence properties of asynchron...
High performance networks of workstation are becoming increasingly popular a parallel computing plat...
International audienceIterative asynchronous parallel methods are nowadays gaining renewed interest ...
Asynchronous iterations arise naturally on parallel computers if one wants to minimize idle times. T...
Cover title.Includes bibliographical references (p. 29-33).Research supported by the NSF. ECS-851905...
A model is defined in which questions concerning delay bounded asynchronous parallel systems may be ...
AbstractAsynchronous iterations arise naturally on parallel computers if one wants to minimize idle ...
textabstractThe parallel execution of branch and bound algorithms can result in seemingly unreasonab...
This paper reports of part of a continuing investigation of parallel computation, in particular, eff...
International audienceAIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a pa...
AbstractWe consider the problem of asynchronous execution of parallel programs. We assume that the o...
A methodology is introduced for minimizing the total execution time for a class of large-scale paral...
The directed acyclic graph (DAG) associated with a parallel al-gorithm captures the order in which s...
Massively parallel supercomputers are susceptible to variable performance due to factors such as di...