Abstract
For a class of distributed recursive algorithms, it is shown that a stochastic approximation-like tapering stepsize routine suppresses the effects of interprocessor delays.
Similar content being viewed by others
References
Benveniste A, Metivier M, Priouret P 1990Adaptive algorithms and stochastic approximations (Berlin-Heidelberg: Springer-Verlag)
Bertsekas D P, Tsitsiklis J N 1989Parallel and distributed computation (Englewood Cliffs, NJ: Prentice Hall)
Borkar V S, Soumyanath K 1994 A new analog parallel scheme for fixed point computation, part I: theory. Preprint
Chazan D, Miranker W 1969Chaotic oscillations, linear algebra and its applications. 2: 199–222
Cohen M A 1992 The construction of arbitrary stable dynamics in neural networks.Neural Networks 5: 83–103
Gelfand S B, Mitter S K 1992 Recursive stochastic algorithms for global optimization inR d.SIAM J. Contr. Optim. 29: 999–1018
Gharavi R, Anantharam V 1992 A structure theorem for partially asynchronous relaxations with random delays. Preprint
Hirsch M W 1987 Convergent activation dynamics in continuous time networks.Neural Networks 2: 331–349
Neveu J 1975Discrete parameter martingales (Amsterdam: North-Holland)
Ogata K 1970Modern control engineering (Englewood Cliffs, NJ: Prentice Hall)
Schurmann B 1989 Stability and adaptation in artificial neural systems.Phys. Rev. A40: 2681–2688
Vidyasagar M 1978Nonlinear systems analysis (Englewood Cliffs, NJ: Prentice Hall)
Author information
Authors and Affiliations
Additional information
The research of the first author was supported by the grant ISTC/EE/VS/049 from the ISRO-HSc Space Technology Cell. The research of the second author was supported by U.S. Office of Naval Research Grant No.00014-92-J-1324 under an Indo-U.S. project.
Rights and permissions
About this article
Cite this article
Borkar, V.S., Phansalkar, V.V. Managing interprocessor delays in distributed recursive algorithms. Sadhana 19, 995–1003 (1994). https://doi.org/10.1007/BF02743940
Issue Date:
DOI: https://doi.org/10.1007/BF02743940