An efficient global convergence detection scheme for parallel algorithms on transputer network
Authors: Kumar, K. G., Basu, A., Srinivas, S., Paulraj, A.
The paper discusses a novel and efficient scheme for the detection of global convergence in parallel iterative algorithms. Convergence information is maintained as processes which execute concurrently with computations of the algorithm and exploit the asynchrony inherent in the progress of most executions of such algorithms towards global convergence. The scheme treats messages signalling convergence as having a lower priority as compared to those signalling non-convergence. It minimizes the waiting time at the end of iterations for convergence related communications. Analytical results indicate that the global convergence detection scheme proposed in this paper is faster than the methods proposed earlier . The scheme is particularly suited for implementation on Transputer based parallel machines. An OCCAM implementation of the scheme on a torus of Transputers is described together with a method for experimental verification of the analytical results.
OUG-12: Tools and Techniques for Transputer Applications, Stephen J. Turner, 1990, pp 68 - 79 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org