Orphan Detection in the Argus System
Name
MIT-LCS-TR-326.pdf
Size
4.21 MB
Format
Adobe PDF
Checksum (MD5)
604c149ce10f3c89fd767b8037357813
Author(s)
Walker, Edward Franklin
Advisor(s)
Liskov, Barbara H.
Date Issued
May 1984
Series/Report no.
MIT-LCS-TR-326
Abstract
In a distributed system, an activity running at one node can request another node to perform some service. This request results in an activity being created at the latter node to perform the requested service. The former node may then crash, destroying the activity that requested the service, but leaving behind the activity performing the service. Such surviving are known as orphans [Nelson81]. Orphans are undesirable since they waste resources and can view inconsistent data.
Persistent DSpace Link
