To compare and evaluate the effectiveness of 2.0 mm locking miniplates versus 2.0 mm standard miniplates in treatment of mandible fractures. Sixty randomly selected patients who sustained mandibular fractures were selected for this study. The fractured fragments were stabilized using 2.0 mm locking miniplates in 30 cases and in the remaining 30 cases the fractured fragments were fixed with conventional 2.0 mm miniplates. Post-operative stability was assessed with radiographs at 7th day, 1st, and 3rd months. The stability of the reduced fracture was assessed clinically and both the types of plates were assessed with an OPG or conventional radiographs. This study shows favorable results on use of locking miniplates in mandibular fractures. The results show that there were no significant differences in the post-operative complications between the conventional and the locking plate/screw mandibular systems. The locking plate/screw system was more rigid than conventional plate/screw system, thereby reducing the need and duration of intermaxillary fixation (IMF).

In this paper, we propose an efficient concurrent wait-free algorithm to construct an unbounded directed graph for shared memory architecture. To the best of our knowledge that this is the first wait-free algorithm for an unbounded directed graph where insertion and deletion of vertices and/or edges can happen concurrently. To achieve wait-freedom in a dynamic setting, threads help each other to perform the desired tasks using operator descriptors by other threads. To enhance performance, we also developed an optimized wait-free graph based on the principle of fast-path-slow-path. We also prove that all graph operations are wait-free and linearizable. We implemented our algorithms in C++ and tested its performance through several micro-benchmarks. Our experimental results show an average of 9x improvement over the global lock-based implementation.keywords: concurrent data structure lazy-list directed graph locks lock-free wait-free fastpath-slow-path 1. We describe an Abstract Data Type (ADT) that maintains a wait-free directed graph G = (V, E). It comprises of the following methods on the sets V and E: (1) Add Vertex: WFAddV (2) Remove Vertex: WFRemV, (3) Contains Vertex: WFConV (4) Add Edge: WFAddE (5) Remove Edge: WFRemE and (6) Contains Edge: WFConE. The wait-free graph is represented as an adjacency list similar in [1] (Section 3).2. We implemented the directed graph in a dynamic setting with threads helping each other using operator descriptors to achieve wait-freedom (Section 4).3. We also extended the wait-free graph to enhance the performance and achieve a fast wait-free graph based on the principle of fast-path-slow-path proposed by Kogan et al.[11] (Section 5).4. Formally, we prove for the correctness by showing the operations of the concurrent graph datastructure are linearizable [8]. We also prove the wait-free progress guarantee of the operations WFAddV, WFRemV, WFConV, WFAddE, WFRemE, and WFConE (Section 6). 5.We evaluated the wait-free algorithms in C++ implementation and tested through several micro-benchmarks. Our experimental results show on an average of 9x improvement over the sequential and global lock implementation (Section 7).