Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 16 of 16 for “"Lock contention"”.

  1. Java lock contention antipatterns and their detection within Java code

    … to properly find and fix all problems results in contention problems and failures. Currently the approach used to find these problems is to run the code and, if problems are found, further investigate related areas. We have created a static analysis program that examines input Java code and checks …

    uoit Repository record for Java lock contention antipatterns and their detection within Java code (opens in a new tab)

  2. Clustering analysis of lock contention fault types using run-time performance metrics for java intrinsic locks

    Locks are essential in java-based multi-threaded applications as this mechanism provides a proper solution to synchronizing shared resources. However, improper management of locks and threads can lead to contention; as a result, it causes performance degradation and prevent java application from …

    uoit Repository record for Clustering analysis of lock contention fault types using run-time performance metrics for java intrinsic locks (opens in a new tab)

  3. Identification of Java lock contention anti-patterns based on run-time performance data using machine learning algorithms

    Locks are critical in concurrent Java applications, ensuring synchronized access to shared resources. Mismanagement of locks and threads can result in contention, affecting performance and scalability. Eight Java lock contention anti-patterns have been identified, representing various scenarios of …

    uoit Repository record for Identification of Java lock contention anti-patterns based on run-time performance data using machine learning algorithms (opens in a new tab)

  4. A retrieval augmented generation fine-tuned LLM model for refactored code recommendations to mitigate Java lock contention performance faults

    Lock contention performance faults can lead to degradation in the performance of software applications. Unlike software bugs, performance faults do not lead to failures and application crashes but surface as a degradation in the response and execution of an application and can surface fairly late …

    uoit Repository record for A retrieval augmented generation fine-tuned LLM model for refactored code recommendations to mitigate Java lock contention performance faults (opens in a new tab)

  5. Storage management for large scale systems

    … cache management algorithm is protected by a lock. Access to this lock can cause contention which can significantly reduce system throughput in multi-processor systems. Current solutions to eliminate lock contention decrease the hit ratio of the buffer cache, which causes poor performance when …

    sask Repository record for Storage management for large scale systems (opens in a new tab)

  6. Model, predict, and mitigate scalability bottlenecks for parallel application on many-core processors

    … all three commonly used synchronization (locks, barriers, and condition variables), and a novel overflow management unit (OMU) that dynamically manages its (very) limited hardware synchronization resources. The OMU allows safe and efficient dynamic transitions between using hardware (MSA) …

    gatech Repository record for Model, predict, and mitigate scalability bottlenecks for parallel application on many-core processors (opens in a new tab)

  7. Exploring alternatives to hardware support for fine-grain synchronization

    … units, improving load balancing and reducing lock contention. The different methods include hardware support for full/empty bits, compare-and-swap (CAS) emulation of full/empty bits, and dual CAS operations. Roger Golliver’s single CAS implementation is a novel method which chooses a bit …

    uiuc Repository record for Exploring alternatives to hardware support for fine-grain synchronization (opens in a new tab)

  8. Hardware acceleration for conservative parallel discrete event simulation on multi-core systems

    … simulation asynchronously and in just a few clock cycles, eliminating the need for global communication with message passing or lock contention for shared memory. This hardware, the Global Synchronization Unit, consists of 3 register files, each the size of the number of cores, and is accessed …

    gatech Repository record for Hardware acceleration for conservative parallel discrete event simulation on multi-core systems (opens in a new tab)

  9. Improving efficiency for GPUs with decoupled delegate

    … reduction on average for 29 benchmarks. For lock-based workloads, our solution avoids destructive lock contention in global memory and thus achieves an average speedup of 3.6x, implemented entirely in software. Finally, we introduce a new GPU single source shortest path (SSSP) algorithm with …

    texas Repository record for Improving efficiency for GPUs with decoupled delegate (opens in a new tab)

  10. Improving MPI Threading Support for Current Hardware Architectures

    … the synchronization object relieves the lock contention on the internal progress engine and able to achieve up to 7x the performance of the original implementation. Moving forward, we explore the possibility of harnessing the true thread concurrency. We proposed several strategies to …

    utk-theses Repository record for Improving MPI Threading Support for Current Hardware Architectures (opens in a new tab)

  11. Improving Communication in Chip Multiprocessors Using Emerging Technologies and Machine Learning

    … critical threads to the other threads using lock contention information. This dissertation demonstrates how opportunities at the physical and logical levels can be used to improve the communication framework.

    toronto-retro Repository record for Improving Communication in Chip Multiprocessors Using Emerging Technologies and Machine Learning (opens in a new tab)

  12. Performance analysis for parallel programs from multicore to petascale

    … such as parallel idleness, parallel overhead and lock contention in multithreaded executions. Third, we show how to diagnose scalability bottlenecks in petascale applications by scaling our our measurement, analysis and presentation tools to support large-scale executions. Finally, we provide a …

    rice Repository record for Performance analysis for parallel programs from multicore to petascale (opens in a new tab)

  13. Blockchain based remote voting system: a performance perspective

    … readable, tamper-proof, append-only log. As blockchain or distributed ledger technology (DLT) offers properties like irreversibil- ity, transparency and decentralization, it is suitable for realization of public bulletin board for the voting system. We see a gap in the research of blockchain …

    uvic Repository record for Blockchain based remote voting system: a performance perspective (opens in a new tab)

  14. Indexing for moving objects

    … number of concurrent operations increases due to lock contention. Thus, it cannot handle heavy update load and high degree concurrent update efficiently. We observe that due to the movement of objects and the need to support fast and frequent concurrent operations, MBR is a stumbling block to …

    nus Repository record for Indexing for moving objects (opens in a new tab) Download file for Indexing for moving objects (opens in a new tab)

  15. An Experimental Evaluation of the Scalability of Real-Time Scheduling Algorithms on Large-Scale Multicore Platforms

    … and priority inheritance for kernel locking primitives. ChronOS extends these capabilities with a flexible, scalable real-time scheduling framework. Our study shows that it is possible to implement global fixed and dynamic priority and simple global utility accrual real-time …

    vt Repository record for An Experimental Evaluation of the Scalability of Real-Time Scheduling Algorithms on Large-Scale Multicore Platforms (opens in a new tab)

  16. Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs

    … in “namespaces”. This allows for reduced lock contention, simpler process modeling, and the ability to migrate simulated processes between worker threads. Using simulated Tor networks ranging from hundreds to tens of thousands of hosts, we then demonstrate the performance improvements our …

    waterloo Repository record for Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs (opens in a new tab)