Title | ||
---|---|---|
Multi-granularity Locking in Hierarchies with Synergistic Hierarchical and Fine-Grained Locks. |
Abstract | ||
---|---|---|
We propose a new locking mechanism for hierarchies wherein the locking requests can be a combination of coarse and fine. Existing protocols such as multiple-granularity locking (MGL) are efficient when all the requests are of the same granularity. MGL is either too coarse or too fine-grained when multiple threads request for various parts of the hierarchy with differing granularity requirements. Simultaneous handling of hierarchical and fine-grained requests poses new challenges in checking for racy requests. We propose a novel indexing technique for hierarchies which uniquely identifies every node as an interval value and effectively captures hierarchical dependencies between nodes even when the hierarchy is a tree, DAG or a cycle. Our experiments with real-world XML hierarchies and synthetic benchmarks show that the proposed locking technique provides a higher degree of concurrency with minimal locking cost resulting in overall performance improvement. |
Year | Venue | Field |
---|---|---|
2018 | Euro-Par | XML,Concurrency,Computer science,Parallel computing,Search engine indexing,Thread (computing),Granularity,Hierarchy,Performance improvement,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
K. Ganesh | 1 | 0 | 0.34 |
Saurabh Kalikar | 2 | 5 | 1.47 |
Rupesh Nasre | 3 | 341 | 21.02 |