Sciweavers

PAAPP
2006
71views more  PAAPP 2006»
13 years 11 months ago
An efficient parallel termination detection algorithm
Abstract: In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We ...
Allison H. Baker, Silvia A. Crivelli, Elizabeth R....
DC
2007
13 years 11 months ago
A family of optimal termination detection algorithms
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
JPDC
2008
103views more  JPDC 2008»
13 years 11 months ago
On termination detection in crash-prone distributed systems with failure detectors
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
Neeraj Mittal, Felix C. Freiling, Subbarayan Venka...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 11 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
PARLE
1991
14 years 2 months ago
The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes
It is shown that the terminationdetection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the te...
Gerard Tel, Friedemann Mattern
ICPADS
2002
IEEE
14 years 3 months ago
Communication Pattern Based Methodology for Performance Analysis of Termination Detection Schemes
Efficient determination of processing termination at barrier synchronization points can occupy an important role in the overall throughput of parallel and distributed computing sy...
Yili Tseng, Ronald F. DeMara
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
14 years 4 months ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
IWOMP
2009
Springer
14 years 5 months ago
Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Stephen Olivier, Jan Prins