Abstract
The stability of computer systems(single computers or computer networks) to processes is studied in this paper. Unlike the notion of self-stabilization, which requires the involved computer systems are stable for all the processes possibly running on them, we believe that a computer system can only be stable for some of the processes. So what we need for a stable computer system is that it has a capability to determine which processes it is stable to and which it is not. With this viewpoint, the notion of stability of computer systems to processes is proposed and all the related items are precisely defined and discussed in details. As an application of this notion, an effective algorithm based on the knowledge of the involved computer system is proposed to determine its stability to a particular process. It is represented in a comprehensive way to make it clear that it can be implemented on computers by means of logic programming. A simple example illustrating the whole workings of the algorithm is given last.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dijkstra, E.W.: Self-stabilization systems in spite of distributed control, pp. 41–46. Springer, Heidelberg (1973)
Arora, A., Gouda, M.G.: Closure and Convergence: A Foundation for Fault-Tolerant Computing. IEEE Trans. Software Eng. 19(3), 1015–1027 (1993)
Schneider, M.: Self-stabilization. ACM Computing Surveys 25(1), 45–67 (1993)
Arora, A.: Stabilization, http://www.cse.ohio-state.edu/siefast/group/publications/stb.ps
Dolev, S.: Self-stabilization. The MIT Press, Cambridge (2000)
Kruijer, H.S.M.: Self-stabilization (in spite of distributed control) in tree-structured systems. Inf. Process. Lett. 8(2), 91–95 (1979)
Antonoiu, G., Srimani, P.K.: A Self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph. Computers and Mathematics with Applications 30, 1–7 (1995)
Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems. In: Proc. of the MCC Workshop on Self-Stabilizing Systems, MCC Technical Report No.STP-379-89 (1995)
Arora, A., Gouda, M.G.: Distributed reset. IEEE Trans. Computers. 43, 1026–1038 (1994)
Gouda, M.G., Li, Y.: The Truth System: Can a System of Lying Processes Stabilize? In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 311–324. Springer, Heidelberg (2007)
Herman, T.: Adaptivity through Distributed Convergence. Ph.D thesis. Univ. of Texas at Austin (1991)
Prasetya, I.S.W.b., Swierstra, S.D.: Formal Design of Self-stabilizing Programs. Journal of Highspeed Network, special issue on self-stabilizing systems 14(1), 59–83 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Q., Yu, F., Wang, B. (2009). An Algorithm Evaluating System Stability to Process. In: Hua, A., Chang, SL. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2009. Lecture Notes in Computer Science, vol 5574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03095-6_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-03095-6_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03094-9
Online ISBN: 978-3-642-03095-6
eBook Packages: Computer ScienceComputer Science (R0)