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 24 for “"DeadLock Avoidance"”.

  1. Deadlock Avoidance In Mixed Capacity Flexible Manufacturing Systems

    … and implementation of a polynomial-complexity deadlock avoidance controller for a flexible manufacturing cell modeled using Colored Petri Nets. The cell model is robust to changes in the part types to be manufactured in the system and is automatically generated using the interaction of the …

    usf Repository record for Deadlock Avoidance In Mixed Capacity Flexible Manufacturing Systems (opens in a new tab)

  2. On chip implement of deadlock avoidance in wormhole networks

    … Integrated Circuit (ASIC) design to avoid deadlocks in Wormhole Networks. Deadlock avoidance is the most critical issue while considering wormhole networks and should be avoided by any routing protocol and algorithm. A novel architecture for the Turn Prohibition Based Routing (TPBR) …

    njit Repository record for On chip implement of deadlock avoidance in wormhole networks (opens in a new tab)

  3. Hardware/Software Deadlock Avoidance for Multiprocessor Multiresource System-on-a-Chip

    This thesis describes fast and deterministic deadlock avoidance methods that are easily applicable to real-time MultiProcessor System-on-a-Chip (MPSoC) design. This thesis first describes the proofs of the correctness of Parallel Deadlock Detection Algorithm (PDDA) and the run-time complexity of …

    gatech Repository record for Hardware/Software Deadlock Avoidance for Multiprocessor Multiresource System-on-a-Chip (opens in a new tab)

  4. Designing parsimonious representations of the maximally permissive deadlock avoidance policy for complex resource allocation systems through classification theory

    Most of the past research on the problem of deadlock avoidance for complex resource allocation systems (RAS) has acknowledged the fact that the computation of the maximally permissive (optimal) deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and …

    gatech Repository record for Designing parsimonious representations of the maximally permissive deadlock avoidance policy for complex resource allocation systems through classification theory (opens in a new tab)

  5. Parallel acceleration of deadlock detection and avoidance algorithms on GPUs

    … contention comes the risk of encountering a deadlock status in the system. Various software and hardware approaches exist that implement deadlock detection/avoidance techniques; however, they lack either the speed or problem size capability needed for real-time systems. The research conducted …

    iupui Repository record for Parallel acceleration of deadlock detection and avoidance algorithms on GPUs (opens in a new tab)

  6. Scheduling techniques for complex resource allocation systems

    … allocation systems (RAS) with blocking and deadlocking effects in their dynamics. This framework addresses both control objectives of logical correctness and performance optimization for the considered RAS. A more detailed account of the thesis contributions is as follows: For the …

    gatech Repository record for Scheduling techniques for complex resource allocation systems (opens in a new tab)

  7. Analysis of wormhole routings in cayley graphs of permutation groups.

    … In the design of a wormhole routing algorithm, deadlock avoidance scheme is the main concern. Recently, new classes of networks called Cayley graphs of permutation groups are considered very promising alternatives. Although proposed Cayley networks have superior topological properties over the …

    oklahoma-thes Repository record for Analysis of wormhole routings in cayley graphs of permutation groups. (opens in a new tab)

  8. Scalable agent-based HPC simulation of cell physics and signalling with real-time user interactions

    … verification, real-time user interactions, and deadlock avoidance. We use two commodity HPC systems, ARCHER and ARCHER2 where we simulate up to 256 million agents (one million cells) and record a good response time overhead of ≃350ms from the issued user events. The approach is viable and can be …

    abertay Repository record for Scalable agent-based HPC simulation of cell physics and signalling with real-time user interactions (opens in a new tab) Download PDF for Scalable agent-based HPC simulation of cell physics and signalling with real-time user interactions (opens in a new tab)

  9. Strategic Reactor Allocation for Deadlock-Free Execution

    … in the sequential approach. One such problem is deadlock. Deadlock is defined as the state in which program execution stalls because the system has run out of resources to manage and execute the program properly, or there exists some circular dependency in the data between parallel or distributed …

    wustl Repository record for Strategic Reactor Allocation for Deadlock-Free Execution (opens in a new tab)

  10. B-RPM: An Efficient One-to-Many Communication Framework for On-Chip Networks

    … respect to current node. B-RPM employs a new deadlock avoidance technique Dynamically Sized Virtual Networks (DSVN). Built upon the traditional virtual networks, DSVN dynamically allocates the network resources to different VNs according to the run-time traffic status, which delivers better …

    tamu Repository record for B-RPM: An Efficient One-to-Many Communication Framework for On-Chip Networks (opens in a new tab)

  11. Specification of transaction systems protocols

    … mutual exclusion, synchronization, and deadlock avoidance. To write a specification that exhibits these characteristics requires a formalism that has both expressive power and the functionality for specifying and reasoning about the structure and behaviour of transaction models. To …

    manitoba Repository record for Specification of transaction systems protocols (opens in a new tab)

  12. Microprocessor based modular support for an operating system

    … The first is a support module for Habermann's deadlock avoidance algorithm. Without the support module, the algorithm would have an execution time O(m('2)), where m is the number of processes in the system. The design and operation of a support module that employs m + 1 microprocessors and is …

    iastate Repository record for Microprocessor based modular support for an operating system (opens in a new tab)

  13. Ανάπτυξη μεθοδολογίας ψευδοσυμπιεστότητας για την πρόλεξη μη μόνιμων τρισδιάστατων αεροδυναμικών ροών

    … for data exchange, good scalability and deadlock avoidance. The solver is tested using known flow problems from literature and comparisons are made with corresponding numerical and experimental results. Τhe solver’s observed spatial and temporal order of accuracy is determined and mesh …

    greece Repository record for Ανάπτυξη μεθοδολογίας ψευδοσυμπιεστότητας για την πρόλεξη μη μόνιμων τρισδιάστατων αεροδυναμικών ροών (opens in a new tab)

  14. Aniruddh Ramrakhyani Thesis

    … more importantly without running into routing deadlocks. Another trend in the semi-conductor industry that has contibuted to the significance of this problem is the increasing use of heterogenous System-on-Chip (SoC). SoCs in most instances are tailored to the application needs. To maximise …

    gatech Repository record for Aniruddh Ramrakhyani Thesis (opens in a new tab)

  15. The Synchronized Filtering Dataflow

    … data streams are synchronized, applications can deadlock due to empty and full channel buffers.To avoid deadlocks and ensure bounded-memory execution, we turn to model-based approaches. In this dissertation, we propose the synchronized filtering dataflow (SFDF) to model synchronization and …

    wustl Repository record for The Synchronized Filtering Dataflow (opens in a new tab)

  16. A Petri net-occam based methodology for the development of dependable distributed control software.

    … or tolerate them, and although less flexible, avoidance is often simpler to implement. There is a need for a tool which overcomes many of these complexities, and this thesis discusses and defines such a tool in the form of a methodology. The novelty of the work is in the combination of the core …

    sheffield-hallam Download PDF for A Petri net-occam based methodology for the development of dependable distributed control software. (opens in a new tab)

  17. Communication and Computation Optimizations in Modular Systems-On-Chip

    … inherent integration complexity, like network deadlock involving multiple modules, in spite of each individual module being deadlock-free. Based on our first observation, the deadlock in modular SoC is formed by forming circular channel dependency involving two or more modules in the SoC. …

    tamu Repository record for Communication and Computation Optimizations in Modular Systems-On-Chip (opens in a new tab)

  18. Routing on the Channel Dependency Graph:

    … the number of virtual channels needed to resolve deadlocks in the routing tables. Using the fail-in-place strategy, a well-established method for storage systems to repair only critical component failures, is a feasible solution for current and future HPC interconnects as well as other large-scale …

    qucosa-diss

Page 1 of 2