Title
Tiered Algorithm For Distributed Process Quiescence And Termination Detection
Keywords
Distributed architectures; Distributed programming; Multitasking; Parallel processing; Synchronization
Abstract
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. © 2007 IEEE.
Publication Date
11-1-2007
Publication Title
IEEE Transactions on Parallel and Distributed Systems
Volume
18
Issue
11
Number of Pages
1529-1538
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/TPDS.2007.1066
Copyright Status
Unknown
Socpus ID
35348836036 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/35348836036
STARS Citation
DeMara, Ronald F.; Tseng, Yili; and Ejnioui, Abdel, "Tiered Algorithm For Distributed Process Quiescence And Termination Detection" (2007). Scopus Export 2000s. 6303.
https://stars.library.ucf.edu/scopus2000/6303