Abstract
The traditional models of distributed computing systems employ the mathematical formalisms of discrete event dynamical systems along with Petri Nets. However, such models are complex to analyze and computationally expensive. Interestingly, the evolving distributed computing systems closely resemble the discrete dynamical systems. This paper constructs and analyzes the model of distributed computing systems by applying mathematical formalisms of the discrete dynamical systems. The proposed model embeds the partial ordering of states under happened-before relation in the set of globally observable states. The stability of the proposed model is analyzed using the first order linear approximation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.