UNITED STATES
An Efficient Detection and Resolution of Generalized Deadlocks in Distributed Systems
|
10.5120/412-610 |
Srinivasan Selvaraj and Rajaram Ramasamy. Article: An Efficient Detection and Resolution of Generalized Deadlocks in Distributed Systems. International Journal of Computer Applications 1(1):1–7, February 2010. Published By Foundation of Computer Science. BibTeX
@article{key:article,
author = {Srinivasan Selvaraj and Rajaram Ramasamy},
title = {Article: An Efficient Detection and Resolution of Generalized Deadlocks in Distributed Systems},
journal = {International Journal of Computer Applications},
year = {2010},
volume = {1},
number = {1},
pages = {1--7},
month = {February},
note = {Published By Foundation of Computer Science}
}
Abstract
In this paper, we propose a new algorithm to detect and resolve distributed deadlocks in the generalized model. The initiator of the proposed algorithm diffuses the probes along the outgoing edges of Wait-For Graph (WFG) and collects the replies that carry the dependency information between processes directly. However, the initiator simplifies the unblocking conditions of blocked nodes in response to a reply form an unblocked node and receives almost two replies from any node unlike the earlier algorithms. It finally declares all the nodes that have not been reduced as deadlocked. We also prove the correctness of the algorithm. It has a worst-case time complexity of d+1 and message complexity of less than e+2n where d is the diameter, e is the number of edges and n is the number of nodes in the WFG. Since the termination detection of the proposed algorithm is isolated from deadlock detection, it minimizes the message length into a constant without using any explicit technique. It is the significant improvement over the existing algorithms. It also minimizes additional rounds of messages to resolve deadlocks.
Reference
-
[1] Bhowmick,S.S. and Prakash,S. (2006), Every Click You Make, I Will Be Fetching It: Efficient XML Query Processing in RDMS Using GUI-driven Prefetching, Proceedings of the 22nd IEEE International Conference on Data Engineering
[2] Bosc, P. Pivert,O. (1995) ‘SQLf: A Relational Database Language for Fuzzy Querying’, IEEE Transactions on Fuzzy Systems,Vol 3, No. 1, February.
[3] Buche, P., Dibie-Barthèlemy, J., and Wattez, F. (2006). ‘Approximate querying of XML fuzzy data’. In springer (Ed.), Proceedings of the 7th international conference FQAS , (Vol. 4027/2006). Milan,Italy.
[4] Calms, M. D., Prade, H., & Sdes, F. (2007). ‘Flexible querying of semistructured data: A fuzzy-set based approach’. International Journal of Intelligent systems, Vol.22, pp. 723-737, July.
[5] Chamberlin,D. Robie,J. (2008) ‘XQuery 1.1: An XML Query Language’, W3C Working Draft, W3C, December.
[6] Don Chamberlin, Michael Carey, Daniela Florescu, Donald Kossmann and Jonathan Robie (2006) ‘XQueryP:Programming with XQuery’, 3rd ACM InternationalWorkshop on XQuery Implementation,Experience, and Perspectives, June,Chicago, Illinois.
[7] Gang Gou, Chirkova,R.(2007) ’Efficiently Querying Large XML Data Repositories: A Survey’, IEEE Transactions on Knowledge and Data Engineering, October.
[8] Marlene Goncalves and Leonid Tineo (2007), ‘A new step towards Flexible XQuery”, Journal of Revista Avances en Sistemas e Informática’,Vol.4 No.3, December.
[9] Shyi-Ming Chen and Yu-Chuan Chen (2003) ’New fuzzy query processing techniques for fuzzy database systems’, International Journal of Fuzzy systems, Vol.5, pp. 161- 170.
[10] Thomson Fredrick,E.J, G.Radhamani,G. (2009) “Fuzzy Logic based XQuery Operations for Native XML Database Systems”, International Journal of Database Theory and Application, Vol 2, No.3, pp. 13-20.
[11] Zadeh,L.A.(1965) ‘Fuzzy Sets’, Information and Control, Vol.8, pp. 338-353.
