A Method for Handling Complex Markov Models of Distributed Algorithms.

Simple item page
dc.contributor.authorPlateau, B.D.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:35:24Z
dc.date.available2007-05-23T09:35:24Z
dc.date.issued1986en_US
dc.description.abstractThis paper is motivated by the study of the performance of distributed algorithms. The method presented here uses a representation of the algorithm as a network of state-transition graphs. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The state space explosion is handled by a decomposition technique. The generator of the chain is derived using tensor algebra operators.en_US
dc.format.extent1436036 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4464
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1986-39en_US
dc.titleA Method for Handling Complex Markov Models of Distributed Algorithms.en_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_86-39.pdf
Size:
1.37 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports