Timing models and local stopping criteria for asynchronous iterative algorithms

Journal of Parallel and Distributed Computing

Volumn 58, Issue 3, 1999, Pages 446-465

  Blathras, Kostas ^a   Szyld, Daniel B ^a   Shi, Yuan ^a  

^a TEMPLE UNIVERSITY   (United States)

Author keywords

Timing models; asynchronous algorithms; parallel iterative methods

Indexed keywords

EID: 0039877166     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1999.1549     Document Type: Article

References (25)

1. Ahuja S., Carriero N., Gelertner D. Linda and friends. IEEE Comp. August 1986;26-32.
2. Axelsson O., Vassilevski P. S. A black box generalized conjugate gradient solver with inner iterations and variable-step preconditioning. SIAM J. Matrix Anal. Appl. 12:1991;625-644.
3. Bailey D. RNR technical report. 1991.
4. Barrett R., Berry M., Chan T. F., Demmel J., Donato J., Dongarra J., Eijkhout V., Pozo R., Romine C., van der Vorst H. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. 1994;SIAM, Philadelphia.
5. Baz E. A method of terminating asynchronous iterative algorithms on message passing systems. Parallel Algorithms Appl. 9:1996;153-158.
6. Bertsekas D. P., Tsitsiklis J. N. Parallel and Distributed Computation. 1989;Prentice-Hall, Englewood Cliffs.
7. Beguelin A., Dongarra J., Geist A., Mancheck R., Sunderam V. PVM: Heterogeneous Network Computing. Sixth SIAM Conference on Parallel Processing. 1993;SIAM, Philadelphia.
8. Y. Shi, The Synergy System: Manual and Programming Guide, CIS Department, Temple University, 1992. [, www.cis.temple.edu/~shi/synergy.html , ].
9. Bru R., Migallon V., Penades J., Szyld D. B. Parallel, synchronous and asynchronous two-stage multisplitting methods. Electron. Trans. Numer. Anal. 3:1995;24-38.
10. Darby M. I. Calculation of the fields near permanent magnets. Physics Programs. 1980;Wiley, New York. p. 125-149.
11. J. Dougherty, Variable-size partitioning approaches for a distributed application, in, Joint Conference on Information Sciences, Pinehurst, NC, November 1994.
12. Dowd K. High Performance Computing. 1993;O'Reilly, Sebastopol.
13. Frommer A., Szyld D. B. H-splittings and two-stage iterative methods. Numer. Math. 63:1992;345-356.
14. Frommer A., Schwandt H., Szyld D. B. Asynchronous weighted additive Schwarz methods. Electron. Trans. Numer. Anal. 5:1997;48-61.
15. Frommer A., Szyld D. B. Asynchronous two-stage iterative methods. Numerische Mathematik. 69:1994;141-153.
16. Halsal F. Data Communications, Computer Networks and Open Systems. 1996;Addison-Wesley, New York.
17. D. P. Koester, S. Ranka, and, G. C. Fox, A parallel Gauss-Seidel algorithm for sparse power system matrices, in, Proceedings of Supercomputing '94, pp. 184-193, 1994.
18. Kortas S., Angot P. A practical and portable model for programming for iterative solvers on distributed memory machines. Parallel Computing. 22:1996;487-512.
19. Lanzkron P. J., Rose D. J., Szyld D. B. Numer. Math. 58:1991;685-702.
20. CIS technical report. 1994.
21. Miellou J. C., Baz D. E., Spiteri P. A new class of asynchronous iterative algorithms with order intervals. Math. Comp. 67:1998;237-255.
22. Reed D. A., Fujimoto R. M. Message Based Parallel Processing. 1988;MIT Press, Boston.
23. Savari S. A., Bertserkas D. P. Finite termination of asynchronous iterative algorithms. Parallel Computing. 22:1996;39-56.
24. Y. Shi, Program scalability analysis, in Proceedings of Ninth IASTED International Conference on Distributed and Parallel Processing, Georgetown University, Washington, DC, 1997, pp. 451-456.
25. Varga R. S. Matrix Iterative Analysis. 1962;Prentice-Hall, Englewood Cliffs.