Effects of asynchronism on the convergence rate of iterative algorithms

Journal of Parallel and Distributed Computing

Volumn 34, Issue 1, 1996, Pages 66-81

  Üresin, Aydin ^a   Dubois, Michel ^b  

^a Platinum Software Corporation   (United States)

^b Univ of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (28)

1. 1. Axelrod, T. S. Effects of synchronization barriers on multiprocessor performance. Parallel Comput. 3 (1986), 129-140.
2. 2. Baudet, G. M. Asynchronous iterative methods for multiprocessors. J. Assoc. Comput. Mach. 25(2) (Apr. 1978), 226-244.
3. 3. Brochard, L., Prost, J.-P., and Fauire, F. Synchronization and load unbalance effects of parallel iterative algorithms. Proc. Int. Conf. on Parallel Processing (ICPP). 1989, pp. 153-160.
4. 4. Bertsekas, D. P. Distributed dynamic programming. IEEE Trans. Automatic Control AC-27, (1982), 610-616.
5. 5. Bertsekas, D. P. Distributed asynchronous computation of fixed points. Math. Programming 27 (1983), 107-120.
6. 6. Bertsekas, D. P., and Tsitsiklis, J. N. Convergence rate and termination of asynchronous iterative algorithms. Proc. Int. Conf. on Supercomputing. 1989, pp. 461-470.
7. 7. Bertsekas, D. P., and Tsitsiklis, J. N. Parallel and Distributed Computation. Prentice-Hall, New York, 1989.
8. 8. Bull, J. M., and Freeman, T. L. Numerical performance of an asynchronous Jacobi iteration. Second Joint International Conference on Vector and Parallel Processing, CONPAR92-VAPP-V. Springer-Verlag, 1992, pp. 361-366.
9. 9. Chazan, D., and Miranker, W. Chaotic relaxation. Linear Algebra Appl. 2 (1969), 199-222.
10. 10. David, H. A. Order Statistics. Wiley, New York, 1970.
11. 11. Dubois, M., and Briggs, F. A. Performance of synchronized iterative processes in multiprocessor systems. IEEE Trans. Software Engrg. 8(4) (July 1982), 419-431.
12. 12. Dubois, M., and Briggs, F. A. The runtime efficiency of parallel asynchronous algorithms. IEEE Trans. Comput. 40(11) (Nov. 1991), 1260-1266.
13. 13. El Baz, D. M-functions and parallel asynchronous algorithms. SIAM J. Numer. Anal. 27, 136-140.
14. 14. El Tarazi, M. N. Some convergence results for asynchronous algorithms. Numer. Math. 39 (1982), 325-340.
15. 15. Frommer, A. On asynchronous iterations in partially ordered spaces. Numer. Funct. Anal. Optimization 12(3 & 4) (1991), 315-325.
16. 16. Greenbaum, A. Synchronization costs on multiprocessors. Parallel Comput. 10, (1989), 3-14.
17. 17. Haralick, R. M., and Shapiro, L. G. The consistent labeling problem, I. IEEE Trans. Pattern Anal. Mach. Intelligence 1(2) (Apr. 1979), 173-184.
18. 18. Kung, H. T. Synchronized and asynchronous algorithms for multiprocessors. In Traub, J. F. (Ed.), Algorithms and Complexity: New Directions and Recent Results. Academic Press, New York, 1976.
19. 19. Kruskal, C. P., and Weiss, A. Allocating independent subtasks on parallel processors. Proc. Int. Conf. on Parallel Processing (ICPP). (1984), pp. 236-240.
20. 20. Miellou, J. C. Algorithmes de relaxation chaotiques a retards. R.A.I.R.O. 1 (1975), 55-82.
21. 21. Miellou, J. C. Iterations chaotiques a retards, etude de la convergence dans le cas d'espaces partiellement ordonnes. C.R. Acad. Sci. Paris 280 (1975), 233-236.
22. 22. Miellou, J. C. Asynchronous iterations and order intervals. In Cosnard, M. (Ed.), Parallel Algorithms and Architectures. North-Holland, Amsterdam, 1986, pp. 85-96.
23. 23. Miellou, J. C., and Spiteri, P. Un critere de convergence pour des methodes generales de point fixe. R.A.I.R.O. Modél. Math. Anal. Numér. 19 (1985), 645-669.
24. 24. Robinson, J. T. Some analysis techniques for asynchronous multiprocessor algorithms. IEEE Trans. Software Engrg. 5(1) (Jan. 1979), 24-31.
25. 25. Tsitsiklis, N. T., and Stamoulis, G. D. On the average communication complexity of asynchronous distributed algorithms. Technical Report LIDS-P-1986, Laboratory for Information and Decision Systems, 1990.
26. 26. Üresin, A., and Dubois, M. Sufficient conditions for the convergence of asynchronous iterations. Parallel Comput. 10 (1989), 83-92.
27. 27. Üresin, A., and Dubois, M. Parallel asynchronous algorithms for discrete data. Assoc. Comput. Mach. 37(3) (1990), 588-606.
28. 28. Üresin, A., and Dubois, M. Effects of asynchronism on the convergence rate of a class of iterations. Technical Report CENG 95-05, U.S.C., 1995.