SIGN IN
SIGN UP
Convergence rate and termination of asynchronous iterative algorithms
Full Text:
Pdf
Buy this Article
Authors:
Dimitri P. Bertsekas
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA
John N. Tsitsiklis
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA
Published in:
· Proceeding
ICS '89 Proceedings of the 3rd international conference on Supercomputing
Pages 461 - 470
ACM
New York, NY
, USA
©1989
table of contents
ISBN:0-89791-309-4
doi>
10.1145/318789.318894
1989 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 22
· Downloads (cumulative): 385
· Citation Count: 8
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ICS'13
Share:
|
Tags:
algorithms
asynchronous algorithms
asynchronous/synchronous operation
convergence and stability
design
distributed algorithms
experimentation
iterative methods
measurement
parallel algorithms
parallel algorithms
parallelism and concurrency
performance
specifying and verifying and reasoning about programs
termination detection
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder