Java Packed Object synchronization
| dc.contributor.advisor | Kent, Kenneth | |
| dc.contributor.advisor | Aubanel, Eric | |
| dc.contributor.author | Yang, Bing | |
| dc.date.accessioned | 2023-03-01T16:18:38Z | |
| dc.date.available | 2023-03-01T16:18:38Z | |
| dc.date.issued | 2017 | |
| dc.date.updated | 2017-11-02T00:00:00Z | |
| dc.description.abstract | Concurrency and synchronization are fundamental issues critical for the design of applications that allow multiple threads to access the shared resources concurrently. The study of synchronization has grown in urgency with the proliferation of multi-core processors in recent years. In this thesis, we proposed thread-safe and efficient approaches to synchronization based on the packed object data model, which were introduced in IBM's J9 Virtual Machine as an experimental enhancement in order to help users gain greater control over the object layout. This object data model organizes data in a multi-tier manner (like the nested C structs), in which the object's data is nested in its enclosing PackedObject instead of being pointed to by an object reference as in the traditional Java object data model. The data overlapping between different tiers of PackedObject poses new challenges for synchronization, which is out of the scope of the traditional Java synchronization mechanisms. In order to address the new synchronization issues and situations raised by the packed object data model, we proposed a few different approaches to synchronization of multi-tier PackedObjects in multi-granularity locking. PackedSync is the first proposed approach for PackedObject synchronization that is based on a monitor without relying on the lock-word field. This approach gains better performance than the Java built-in synchronization approach in the coarse-grained locking. However it works only with two-tier PackedObjects and supports only the single-granularity locking. In order to address the multi-granularity locking on multi-tier PackedObjects, we proposed MultitierPackedSync based on an optimized concurrent linked-list that postpones the physical deletion of a node so as to reduce the overhead of unnecessary repetition of deletion and insertion operations. This approach improves the overall performance considerably comparing with PackedSync, the Java built-in synchronization and the Lazy MultitierPackedSync that is based on the lazy-list algorithm without our optimization. In order to further improve the performance of multi-tier data synchronization, we implemented a concurrent multiway tree in the left-child right-sibling tree representation that allows multiple threads to in parallel manipulate the tree structure. We then proposed a multi-granularity locking scheme (Tree-based MultitierSync) based on the concurrent multiway tree, which represents the containing and ordering relationship among the data in different tiers of PackedObjects. Comparing to the List-based MultitierSync (MultitierPackedSync), the Tree-based MultitierSync significantly improves the overall performance in different workloads, and the higher work load, the better performance gains can be achieved according to our benchmarks. | |
| dc.description.copyright | © Bing Yang, 2017 | |
| dc.format | text/xml | |
| dc.format.extent | xv, 181 pages | |
| dc.format.medium | electronic | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/13442 | |
| dc.language.iso | en_CA | |
| dc.publisher | University of New Brunswick | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Java Packed Object synchronization | |
| dc.type | doctoral thesis | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.fullname | Doctor of Philosophy | |
| thesis.degree.grantor | University of New Brunswick | |
| thesis.degree.level | doctoral | |
| thesis.degree.name | Ph.D. |
Files
Original bundle
1 - 1 of 1