Process Interconnection Structures in Dynamically Changing Topologies

Authors:
Eugene Gendelman;Lubomir Bic;Michael B. Dillencourt
Affiliations:
-;-;-
Venue:
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Year:
2000

Citing 7
Cited 1

Messengers: a distributed computing system based on autonomous objects

Messengers: a distributed computing system based on autonomous objects
Diffusive Load-Balancing Policies for Dynamic Applications

IEEE Concurrency
An Efficient Checkpointing Algorithm for Distributed Systems Implementing Reliable Communication Channels

SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Scalable Stability Detection Using Logical Hypercube

SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
An Application-Transparent, Platform-Independent Approach to Rollback-Recovery for Mobile Agent Systems

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Fail-Safe PVM: A Portable Package for Distributed Programming with Transparent Recovery

Fail-Safe PVM: A Portable Package for Distributed Programming with Transparent Recovery
Scalable message stability detection protocols

Scalable message stability detection protocols

Fast File Access for Fast Agents

MA '01 Proceedings of the 5th International Conference on Mobile Agents

Quantified Score

Hi-index	0.00

Visualization

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.