Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
M.V. Sreenivas , Div. of Comput. Eng., Delhi Inst. of Technol., India
S. Bhalla , Div. of Comput. Eng., Delhi Inst. of Technol., India
Distributed systems use optimistic message logging for recovery from transient process failures. Such a recovery is facilitated by asynchronous message logging and check-pointing. It is also supported by garbage collection which requires identifying messages in stable storage that are no longer needed for the process of recovery. For this purpose, it is necessary to keep track of message dependencies between process states. A model to keep track of state dependencies using dependency graphs has been proposed.
message passing; system recovery; software fault tolerance; fault tolerant computing; reliability; storage management; garbage collection; message passing distributed systems; optimistic message logging; transient process failures; system recovery; asynchronous message logging; check-pointing; stable storage; message dependencies; process states; dependency graphs
M.V. Sreenivas, S. Bhalla, "Garbage collection in message passing distributed systems", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 213, 1995, doi:10.1109/AISPAS.1995.401335