Abstract
This paper presents a mechanism that organizes processes in the hierarchy and efficiently maintains it in the presence of addition/removal of nodes to the system, and in the presence of node failures. This mechanism can support total order of broadcasts and does not rely on any specific system features or special hardware. In addition, it can concurrently support multiple logical structures, such as a ring, a hypercube, a mesh, and a tree.
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.
References
E. N. Elnozahy, D. B. Johnson, Y. M. Wang. “A Survey of Rollback-Recovery Protocols in Message Passing Systems.”, T.R. CMU-CS-96-181, School of Computer Science, Carnegie Mellon University, Oct. 1996
J. Leon, A. L. Fisher, and P. Steenkiste. “Fail-Safe PVM: A portable package for distributed programming with transparent recovery.” Tech. Rep. CMU-CS-93-124, Carnegie Mellon Univ., February 1993
K. Guo. “Scalable Message Stability Detection Protocols.” PhD thesis, Department of Computer Science, Cornell University, 1998
M. Fukuda. “MESSENGERS: A Distributed Computing System Based on Autonomous Objects.” PhD thesis, Department of Information and Computer Science, University of California, Irvine, 1997
E. Gendelman, L. F. Bic, M. Dillencourt. “An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels.” 18 th Symposium on Reliable Distributed Systems, Lausanne, Switzerland 1999
E. Gendelman, L. F. Bic, M. Dillencourt. “An Application-Transparent, Platform Independent Approach to Rollback-Recovery for Mobile Agent Systems” 20 th IEEE International Conference on Distributed Computing Systems. Taipei, Taiwan 2000
Eugene Gendelman, Lubomir F Bic, Michael B. Dillencourt. “ Process Interconnection Structures in Dynamically Changing Topologies”, Univ. of California, Irvine. TR #00-27 http://www.ics.uci.edu/~egendelm/prof/processOrder.ps
E. L. Elnozahy, D. B. Johnson, and W. Zwaenepoel. The performance of consistent checkpointing. In Proc. of the 11 th Symposium on Reliable Distributed Systems, pages 39–47, October 1992
K. Kim, J. G. Shon, S. Y. Jung, C. S. Hwang. Causal Message Logging Protocol Considering In-Transit Messages. In Proc. of the ICDCS 2000 workshop on Distributed Real-Time Systems. Taipei, Taiwan 2000
R. Friedman, S. Manor, and K. Guo. “Scalable Stability Detection Using Logical Hypercube.” 18 th Symposium on Reliable Distributed Systems, Lausanne, Switzerland 1999
K. Solchenbach and U. Trottenberg. “SUPRENUM: System essentials and grid applications.” Parallel Computing 7 (1988) pp. 265–281
Corradi, L. Leonardi, F. Zambonelli. “Diffusive Load-Balancing Policies for Dynamic Applications”. Concurrency. January-March 1999.
L. Alvisi, B. Hoppe and K. Marzullo, “Nonblocking and Orphan-Free Message Logging Protocols,” Proceedings of the 23rd Fault-Tolerant Computing Symposium, pp.145–154, June 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gendelman, E., Bic, L.F., Dillencourt, M.B. (2000). Process Interconnection Structures in Dynamically Changing Topologies. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_37
Download citation
DOI: https://doi.org/10.1007/3-540-44467-X_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41429-2
Online ISBN: 978-3-540-44467-1
eBook Packages: Springer Book Archive