CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
Reseach Article

Article:An Approach for Orphan Detection

by Shamsudeen. E, Dr. V. Sundaram
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Number 5
Year of Publication: 2010
Authors: Shamsudeen. E, Dr. V. Sundaram
10.5120/1477-1994

Shamsudeen. E, Dr. V. Sundaram . Article:An Approach for Orphan Detection. International Journal of Computer Applications. 10, 5 ( November 2010), 28-30. DOI=10.5120/1477-1994

@article{ 10.5120/1477-1994,
author = { Shamsudeen. E, Dr. V. Sundaram },
title = { Article:An Approach for Orphan Detection },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 10 },
number = { 5 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 28-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume10/number5/1477-1994/ },
doi = { 10.5120/1477-1994 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:58:57.724300+05:30
%A Shamsudeen. E
%A Dr. V. Sundaram
%T Article:An Approach for Orphan Detection
%J International Journal of Computer Applications
%@ 0975-8887
%V 10
%N 5
%P 28-30
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In distributed systems, node crashes [1] and abort processes may result orphan computations: computations are still active and its results are no longer needed [5]. Orphans are undesirable because they waste system resources [3] and may make inconsistent data [4]. In this paper we present a new approach called global log and monitor approach to cope up with orphan in a more effective way. By this method orphans can be killed immediately after the node crash or abort process happens. No need to wait until the nodes get rebooted as the other methods does. This approach deals with the problem of grand orphans [2] as well. The grand orphans are by orphans who make further RPCs. i.e., the grand orphans are the result of nested transactions.

References
  1. M. Jahanshahi, K. Mostafavi, M.S. Kordafshari, M. Ghlipour, A.T. Haghighat, “ Two new Approaches for Orphan Detection”, Proc. IEEE 19th International Conference on Advanced Information Networking and Applications (ANAI’05), 2005
  2. Andrew S. Tenenbaum, “Distributed Systems”, Prentice-Hall, 2003
  3. Joachim Baumann, Kurt Rothermel, “The Shadow Approach: An Orphan Detection Protocol for Mobile Agents”, Institute for Parallel and Distributed High-Performance Systems, Stuttgart, Germany.
  4. Maurice P. Herlihy, Martin S. Mckendry, “ Timestamp-Based Orphan Elimination”, IEEE transaction on Software Engineering, Vol. 15, No.7, 1990
  5. Fabio Panzieri, Santosh K. Shrivastava, “A Remote Procedure Call Mechanism Supporting Orphan Detection and Killing” Proc. IEEE Transaction on Software Engineering, Vol. 14, No. 1, 1988.
  6. Pradeep K. Sinha, “Distributed Operating Systems-Concepts and Design”, Prentice Hall, 2008.
Index Terms

Computer Science
Information Sciences

Keywords

RPC (Remote procedure call) distributed systems orphan Global log