Distributed algorithms with random processor failures

Papavassilopoulos, G

dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T01:42:20Z
dc.date.available	2014-03-01T01:42:20Z
dc.date.issued	1994	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23784
dc.subject	Communication Delay	en
dc.subject	Distributed Algorithm	en
dc.subject	Linear Equations	en
dc.subject	Random Times	en
dc.title	Distributed algorithms with random processor failures	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/9.284888	en
heal.identifier.secondary	http://dx.doi.org/10.1109/9.284888	en
heal.publicationDate	1994	en
heal.abstract	Examines a distributed algorithm where the processors may fail in a random fashion. This results in a model with random communication delays. Convergence conditions are derived. Extensions of the analysis and results to cases where the random processor failures are perceived and corrected within random time intervals are possible. For the sake of simplicity, the analysis is presented for a	en
heal.journalName	IEEE Transactions on Automatic Control	en
dc.identifier.doi	10.1109/9.284888	en