Maurice P. Herlihy and Martin S. McKendry. Timestamp-Based Orphan Elimination. IEEE Transactions on Software Engineering, 15(7):825--831, July 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Adaptive Fault-Resistant Systems - Goldberg, Gong, Greenberg, Clark.. (1995) (1 citation) (Correct)
....and to prevent them from performing invalid or contradictory actions. Providing integrity for distributed threads is similar to providing integrity for other distributed computation abstractions. For example, orphan detection and elimination has been studied in the context of nested transactions [17, 18, 31], remote procedure calls [36, 39, 45] and message logging protocols [2] A specific TMAR protocol was developed for Alpha, based on assumptions about the expected operating environment [37] This included assumptions about the workload, the user and application requirements, the system fault ....
Maurice P. Herlihy and Martin S. McKendry. Timestamp-Based Orphan Elimination. IEEE Transactions on Software Engineering, 15(7):825--831, July 1989.
Atomic Transactions for Multiprocessor Programming: A Formal.. - Lynch (1994) (1 citation) (Correct)
....algorithms is to eliminate activity by orphans as soon as possible, and to prevent them from 12 NANCY LYNCH seeing inconsistent data states. In [15] several orphan management algorithms are modelled and discussed, including those developed by Liskov et al. 14] and by Herlihy and McKendry [10]. The first is based on a piggybacking strategy that attaches relevant information about aborts to messages, thereby allowing a transaction to detect the abort of any of its ancestors before it can perform any operation that depends on this abort. The second is based on a virtual clock protocol. ....
M. P. Herlihy and M. McKendry. Timestamp-based orphan elimination. IEEE Transactions on Software Engineering, 15(7):825--831, July 1989.
Transparent Remote Procedure Calls - Abram (1992) (Correct)
....handle this problem by switching to version numbers with allowances made for invalid entries in the database. 6.3.6 Orphan Detection One significant issue in distributed computing is the problem of orphan processes. An orphan is an activity or process executing on behalf of an aborted transaction [21]. Such processes waste system resources. Although this is unlikely to result in inaccurate results in the RPC paradigm, the problem of system resources can escalate intolerably for frequently accessed procedure calls. In our package, the largest problem will occur when clients stop running without ....
....servers that they have finished. At present, 62 our package only aborts handler processes if the client specifically tells the handler to terminate. This can cause unnecessary use of resources on the host. One way of approaching this problem would be to use the method proposed by Herlihy [21]. Herlihy proposes eliminating orphans by using a time stamp based algorithm. Transactions have a quiesce time and a release time. When the termination invariant, which is the stipulation that Last(Quiesce(A) F irst(Release(A) is violated, the orphan process is aborted. The problem with this ....
M. P. Herlihy and M. S. McKendry. Timestamp-based orphan elimination. IEEE Transactions on Software Engineering, 15(7):825--831, July 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC