File servers for network-based distributed systems
ACM Computing Surveys (CSUR)
Distributed Computing
A fully distributed (minimal) spanning tree algorithm
Information Processing Letters
Termination detection for dynamically distributed systems with non-first-in-first-out communication
Journal of Parallel and Distributed Computing
Global quiescence detection based on credit distribution and recovery
Information Processing Letters
Timestamp-Based Orphan Elimination
IEEE Transactions on Software Engineering
A message-optimal algorithm for distributed termination detection
Journal of Parallel and Distributed Computing
The derivation of distributed termination detection algorithms from garbage collection schemes
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Distributed termination detection with roughly synchronized clocks
Information Processing Letters
Distributed Hardwired Barrier Synchronization for Scalable Multiprocessor Clusters
IEEE Transactions on Parallel and Distributed Systems
Efficient Termination Detection for Loosely Synchronous Applications in Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Distributed termination detection for dynamic systems
Parallel Computing
Distributed termination detection in a mobile wireless network
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
A taxonomy of distributed termination detection algorithms
Journal of Systems and Software
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Optical Bus-Based Distributed Dynamic Barrier Mechanism
IEEE Transactions on Computers
Four-Ary Tree-Based Barrier Synchronization for 2D Meshes without Nonmember Involvement
IEEE Transactions on Computers - Special issue on the parallel architecture and compilation techniques conference
Parallel Polygon Rendering for Message-Passing Architectures
IEEE Parallel & Distributed Technology: Systems & Technology
Development of a Class of Distributed Termination Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
A More Efficient Message-Optimal Algorithm for Distributed Termination Detection
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Barrier Synchronization Techniques for Distributed Process Creation
Proceedings of the 8th International Symposium on Parallel Processing
Refinement Based Validation of an Algorithm for Detecting Distributed Termination
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Comprehensive and Robust Garbage Collection in a Distributed System
IWMM '92 Proceedings of the International Workshop on Memory Management
Stateless Termination Detection
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Dynamic systems and their distributed termination
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Termination detection in data-driven parallel computations/applications
Journal of Parallel and Distributed Computing
Distributed-sum termination detection supporting multithreaded execution
Parallel Computing
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing
Theoretical Computer Science
| Hi-index | 0.00 |
The Tiered Algorithm is presented for time-efficient and message-efficient detection of process termination. It employs a global invariant of equality between process production and consumption at each level of process nesting to detect termination regardless of execution interleaving order and network transit time. Correctness is validated for arbitrary process launching hierarchies, including launch-in-transit hazards where processes are created dynamically based on run-time conditions for remote execution. The performance of the Tiered Algorithm is compared to three existing schemes with comparable capabilities, namely the CV, LTD, and Credit termination detection algorithms. For synchronization of T tasks terminating in E epochs of idle processing, the Tiered Algorithm is shown to incur O(E) message count complexity and O(T lg T) message bit complexity while incurring detection latency corresponding to only integer addition and comparison. The synchronization performance in terms of messaging overhead, detection operations, and storage requirements are evaluated and compared across numerous task creation and termination hierarchies.