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 20 of 166 for “"Deadlocks"”.

  1. Addressing Logical Deadlocks through Task-Parallel Language Design

    … and also sufficient protection against logical deadlocks. Lack of flexibility leads to code that does not take full advantage of the available parallelism in the computation. Lack of deadlock protection leads to error-prone code in which a single bug can involve arbitrarily many tasks, making it …

    gatech Repository record for Addressing Logical Deadlocks through Task-Parallel Language Design (opens in a new tab)

  2. Guided Search for Deadlocks in Actor-Based Models

    The success of model checking is based on its ability to uncover errors in designs of software and protocols. Even a small reactive concurrent system can exhibit complex behavior. Such systems may have state-spaces larger than explicit state model checkers can verify. In practice, finding an error …

    reykjavik Repository record for Guided Search for Deadlocks in Actor-Based Models (opens in a new tab)

  3. Detecting potential synchronization constraint deadlocks from formal system specifications.

    This thesis describes a conceptual design for a software tool for automatic detection of synchronization constraint deadlock from the formal specification of a distributed system. The formal specification language Spec is used to define the distributed system. The basic algorithm used is introduced …

    nps Repository record for Detecting potential synchronization constraint deadlocks from formal system specifications. (opens in a new tab)

  4. Subactive techniques for guaranteeing routing and protocol deadlock freedom in interconnection networks

    … in an interconnection network is that of deadlocks. Deadlocks can be of two types: routing level deadlocks and protocol level deadlocks. Routing level deadlocks occur because of cyclic dependency between packets trying to acquire buffers, whereas protocol level deadlock occurs because the …

    gatech Repository record for Subactive techniques for guaranteeing routing and protocol deadlock freedom in interconnection networks (opens in a new tab)

  5. Model-based deadlock prevention for traffic planning of autonomous vehicles

    … The methods developed successfully prevent deadlocks at several pilot and test sites. However, results indicate that time for computing implicit deadlocks grows exponentially in the size of the site and the number of vehicles in the fleet. A neural network model was also trained using data …

    chalmers Repository record for Model-based deadlock prevention for traffic planning of autonomous vehicles (opens in a new tab)

  6. UPC-CHECK: A scalable tool for detecting run-time errors in Unified Parallel C

    … detect argument errors in UPC functions and deadlocks in UPC programs at run-time and issue high quality error messages to help programmers quickly x those errors. The tool is easy to use and involves merely replacing the compiler command with upc-check. The tool uses a novel distributed …

    iastate Repository record for UPC-CHECK: A scalable tool for detecting run-time errors in Unified Parallel C (opens in a new tab)

  7. Reducing Reliance on Buffering and Virtual Channels in Networks-on-Chip

    … or power efficiency to proactively avoid deadlocks or impose high hardware complexity to reactively resolve deadlocks as they occur. As an example, modern network-on-chip designs typically use multiple virtual networks to maintain protocol-level deadlock freedom, at the expense of high …

    toronto-retro Repository record for Reducing Reliance on Buffering and Virtual Channels in Networks-on-Chip (opens in a new tab)

  8. Towards Network-aware Sharing for Performance Interference Mitigation in Data Center Networks

    … resources. Network blocking, often caused by deadlocks, can severely degrade performance. Lossless Ethernet deployments, which aim to eliminate packet loss by using flow control protocols to pause data transmission and preserve buffer space, are particularly prone to deadlocks. To address the …

    rice Repository record for Towards Network-aware Sharing for Performance Interference Mitigation in Data Center Networks (opens in a new tab) Embargoed until 2026-12-01

  9. Implementation of a protocol validation and synthesis system

    … kinds of potential design errors, such as state deadlocks, non-executable interactions, unspecified receptions and state ambiguities. The technique employed is a stepwise application of a set of production rules which guarantee complete reception capability. These rules are implemented in a …

    ubc Repository record for Implementation of a protocol validation and synthesis system (opens in a new tab) Download PDF for Implementation of a protocol validation and synthesis system (opens in a new tab)

  10. Deadlock detection in MPI programs

    … 1.0 does not detect situations where possible deadlocks may occur. This thesis presents the methods used in MPI-CHECK 2.0 to detect many situations where actual and potential deadlocks may occur when using blocking and non-blocking point-to-point routines as well when using collective …

    iastate Repository record for Deadlock detection in MPI programs (opens in a new tab)

  11. Decision diagrams: Extensions and applications to reachability analysis

    … reachability analysis can be used to detect deadlocks in Petri Nets. We also present a symbolic approach that can detect deadlocks in unbounded Petri Nets.</p> <p>Finally, we introduce a new type of decision diagram, ESRBDD, that combines multiple reduction rules, is canonical, and produces a …

    iastate Repository record for Decision diagrams: Extensions and applications to reachability analysis (opens in a new tab)

  12. Analysis of high performance interconnect in SoC with distributed switches and multiple issue bus protocols

    … the other major domain, which is a concern, is deadlocks. Deadlocks are situations where the network resources are suspended waiting for each other. In this report various kinds of deadlocks are classified and their respective mitigations in such networks are provided. These analyses are …

    texas Repository record for Analysis of high performance interconnect in SoC with distributed switches and multiple issue bus protocols (opens in a new tab)

  13. CORE: a framework for the automatic repair of concurrency bugs

    … bugs not found in single-threaded code such as deadlocks and data races. In this thesis we develop the CORE (COncurrent REpair) framework. It automatically fixes deadlocks and data races in parallel Java programs. It uses a search-based software engineering approach to mutate and evolve the …

    uoit Repository record for CORE: a framework for the automatic repair of concurrency bugs (opens in a new tab)

  14. Deadlock resolutions in flexible manufacturing systems with an automated guided vehicle system

    … in the restricted resource category. In general, deadlocks are difficult to predict. The earlier a deadlock or its possibility in the system is detected, the easier it can be resolved or prevented, and consequently, the smaller is the lost production. Whether the deadlock problems can be …

    nebraska Repository record for Deadlock resolutions in flexible manufacturing systems with an automated guided vehicle system (opens in a new tab)

  15. HyFlow: A High Performance Distributed Software Transactional Memory Framework

    … control suffers from drawbacks including deadlocks, livelocks, and scalability and composability challenges. These problems are exacerbated in distributed systems due to their distributed versions which are more complex to cope with (e.g., distributed deadlocks). STM and D-STM are …

    vt Repository record for HyFlow: A High Performance Distributed Software Transactional Memory Framework (opens in a new tab)

  16. Safe and Efficient Navigation for Single- and Multi-Robot Autonomy in Complex Environments

    … maintaining safety guarantees while resolving deadlocks and reducing congestion. In addition, we present learning-based approaches that jointly learn navigation policies and selective inter-agent communication strategies to improve trajectory computations. In the single-robot domain, we present …

    maryland Repository record for Safe and Efficient Navigation for Single- and Multi-Robot Autonomy in Complex Environments (opens in a new tab)

  17. Self-stabilizing deadlock algorithms in distributed systems

    … and deadlock is detected. In order to prevent deadlocks, algorithms usually rank nodes in order to determine if an added edge will create a deadlock in the system. In a self-stabilizing system, perturbances are automatically dealt with. For the deadlock model, the perturbances in the system are …

    unlv Repository record for Self-stabilizing deadlock algorithms in distributed systems (opens in a new tab) Download PDF for Self-stabilizing deadlock algorithms in distributed systems (opens in a new tab)

  18. Efficient Heuristics for Virtual Machine Migration in Data Centers

    … order dependency constraints and possible deadlocks caused by lack of enough free resources in servers during the process. In the literature, exact mathematical models are not scalable and heuristics are not optimal and they don't consider the quality of service and energy efficiency of …

    concordia Download PDF for Efficient Heuristics for Virtual Machine Migration in Data Centers (opens in a new tab)

  19. Fast lock-free linked lists in distributed shared memory systems

    … in a serial manner. It might also result in deadlocks when the process currently accessing the shared data structure is pre-empted or terminated. An alternate approach to avoid mutual exclusion by locking is by implementing lock-free data structures. This is possible by using basic …

    manitoba Repository record for Fast lock-free linked lists in distributed shared memory systems (opens in a new tab)

Page 1 of 9