Browsing by Author "Umesh, P.B."
Now showing 1 - 4 of 4
- Results Per Page
- Sort Options
Item An improved algorithm for distributed mutual exclusion by restricted message exchange in voting districts(2008) Bharath Kumar, A.R.; Umesh, P.B.This paper presents an improvement to the Maekawa's distributed mutual exclusion algorithm. The number of messages required by the improvised algorithm is in the range 3M to 5Mper critical section invocation where M is the number of Intersection nodes in the system. This improvement does not introduce any additional overheads over the existing Maekawa's algorithm which requires 3K to 5K number of messages per critical section invocation, where K is the number of nodes in the voting district (M ≤ K). This reduction in number of messages is achieved by restricting the communication of any node which wants to execute Critical Section with the Intersection nodes of the voting district, without causing any modification of the basic structure of the algorithm. This improvisation preserves all the advantages of the original Maekawa's algorithm. © 2008 IEEE.Item An improved algorithm for distributed mutual exclusion by restricted message exchange in voting districts(2008) Bharath, Kumar, A.R.; Umesh, P.B.This paper presents an improvement to the Maekawa's distributed mutual exclusion algorithm. The number of messages required by the improvised algorithm is in the range 3M to 5Mper critical section invocation where M is the number of Intersection nodes in the system. This improvement does not introduce any additional overheads over the existing Maekawa's algorithm which requires 3K to 5K number of messages per critical section invocation, where K is the number of nodes in the voting district (M ? K). This reduction in number of messages is achieved by restricting the communication of any node which wants to execute Critical Section with the Intersection nodes of the voting district, without causing any modification of the basic structure of the algorithm. This improvisation preserves all the advantages of the original Maekawa's algorithm. � 2008 IEEE.Item Tree-based dynamic primary copy algorithms for replicated databases(2009) Umesh, P.B.; Bharath, Kumar, A.R.; Ananthanarayana, V.S.With increasing demand for performance, availability and fault tolerance in databases, data replication is gaining more and more importance. Resolving or serializing conflicting update requests is the main challenge in large scale deployment of replicated databases. In this paper, we propose the first token based dynamic primary copy algorithms for resolving conflicting requests among different sites of replicated databases. The contribution being reduction in the number of messages required per update request. � 2009 Springer.Item Tree-based dynamic primary copy algorithms for replicated databases(2009) Umesh, P.B.; Bharath Kumar, A.R.; Ananthanarayana, V.S.With increasing demand for performance, availability and fault tolerance in databases, data replication is gaining more and more importance. Resolving or serializing conflicting update requests is the main challenge in large scale deployment of replicated databases. In this paper, we propose the first token based dynamic primary copy algorithms for resolving conflicting requests among different sites of replicated databases. The contribution being reduction in the number of messages required per update request. © 2009 Springer.