Paper Info
Title
Testing for termination of asynchronous parallel computations
Abstract
This paper presents a reasonable solution for ssynchronous parallel computation termination detection. It is similar to the general parallel termin* tion problem which has been thoroughly studied in the literature. In fact, the context and environment may mislead some readers to categorize our solution as yet another parallel termination algorithm. However, the problem discus& iu this paper has a different nature than those previously discussed. One major dit&rence here is that in most cases, the possible communication between processo ra would result in an unpredictable forest pattern. Yet another dif&rence is the assumption that all processors in the system operate in an cooperative environment to 6nish one large task. In this sense, no processor (meaning a respective process or a thread running in it) is allowed to abandon the operation and start on another one. This problem was encountered during the design stage of a parallel database rule pro cessing system. Hence, the motivation behind the solution proposed in this paper originated from a practicai necessity. The paper is logically organized to introduce the problem and its environment, propose the solution, prove it correct, suggest possible implementation, and iinally exhibits supportive experimental results followed by the conchrsion.
Year
DOI
Venue
1998
10.1145/275295.275359
ACM Southeast Regional Conference 2005
Keywords
Field
DocType
shared-nothing multiprocessors,asynchronous parallel computation,parallel processing,parallel computer
Asynchronous communication,Massively parallel,Computer science,Parallel computing,Embarrassingly parallel,Parallel processing,Theoretical computer science,Asynchronous parallel computation,Bulk synchronous parallel,Computation
Conference
ISBN
Citations 
PageRank 
1-58113-030-9
1
0.35
References 
Authors
5
2
Name
Order
Citations
PageRank
Nabeel I. Al-Fayoumi110.35
Eric N. Hanson2917376.11