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 11 of 11 for “"Nonblocking"”.

  1. Nonblocking Memory Refresh

    … static/background refresh in SRAM. Our proposed Nonblocking Refresh works by refreshing a portion of the data in a memory block at a time and uses redundant data, such as Reed-Solomon codes, in the block to compute the block's refreshing/unreadable data to satisfy read requests. For proof of …

    vt Repository record for Nonblocking Memory Refresh (opens in a new tab)

  2. Nonblocking packet switching with shift-register rings

    This research investigates packet switching with gigabit-per-second ports for integrated broadband services. The Pulsar switch design is based on a fast word-parallel shift-register ring, and it is a platform for studying the fundamentals of packet switching.

    uiuc Repository record for Nonblocking packet switching with shift-register rings (opens in a new tab)

  3. Design and Implementation of a Nonblocking Randomized Work Stealing Scheduler

    … presents FLCN (Free of Locks, Cilk is Now), a nonblocking work-stealing runtime scheduler that supports Cilk multithreaded programming. The existing OpenCilk runtime system uses lock-based synchronization and thus suffers from lock contention, does not provide progress guarantees, and can …

    mit Repository record for Design and Implementation of a Nonblocking Randomized Work Stealing Scheduler (opens in a new tab)

  4. Performance of a ATM Lan switching fabric

    … is proposed. This is an architecture for nonblocking performance, no congestion and high reliability. Its principle for performance is a method of sequentially scheduling the inputs and the transferring of bits in parallel. To study the performance of the switching fabric architecture one …

    cape-town Repository record for Performance of a ATM Lan switching fabric (opens in a new tab)

  5. Architectural study of high-speed networks with optical bypassing

    … of routes and wavelengths. Adopting a nonblocking formulation, we assume that the basic traffic unit is a wavelength, and the traffic matrix changes from time to time but always belongs to a given traffic set.

    mit Repository record for Architectural study of high-speed networks with optical bypassing (opens in a new tab)

  6. Safety verification and control for collision avoidance at road intersections

    … and prove that it ensures safety and is nonblocking, another major challenge of verification-based algorithms. We validate the supervisor using computer simulations and experiments.

    mit Repository record for Safety verification and control for collision avoidance at road intersections (opens in a new tab)

  7. Fault tolerance in parallel data processing systems

    … of the approach reduces restarts and works in a nonblocking manner. The introduced ephemeral materialization points hold intermediate data in memory while monitoring the running job. This monitoring enables the system to choose the sweet spots for materialization. At the same time, the …

    tu-berlin Repository record for Fault tolerance in parallel data processing systems (opens in a new tab)

  8. Development of a Supervisory Control System as a Transition Technology Towards Autonomous Reactor Plant Operations

    … discrete event systems (DES). Properties such as nonblocking and controllability can be formally demonstrated and verified by leveraging the extensive set of mathematical proofs within the scope of regular languages. Furthermore, a DES can be directly linked to reactor plant systems and …

    mit Repository record for Development of a Supervisory Control System as a Transition Technology Towards Autonomous Reactor Plant Operations (opens in a new tab)

  9. Symmetric rearrangeable networks and algorithms

    A class of symmetric rearrangeable nonblocking networks has been considered in this thesis. A particular focus of this thesis is on Benes networks built with 2 x 2 switching elements. Symmetric rearrangeable networks built with larger switching elements have also being considered. New applications …

    dcu Repository record for Symmetric rearrangeable networks and algorithms (opens in a new tab)

  10. On Conflicts in Concurrent Systems

    This dissertation studies conflicts. A conflict is a bug in concurrent systems where one or more components of the system may potentially be blocked from completing their task. This dissertation investigates how nonconflicting completions may be used to characterise the situations in which …

    waikato-masters Repository record for On Conflicts in Concurrent Systems (opens in a new tab)

  11. Cache design exploration in a general purpose massively parallel architecture

    Memory model design is a major part of any modern processor architecture. There are many design choices and tradeoffs to be considered, and these often need to be tightly coupled to the processing unit's arcitecure. The increased popularity of massively parallel architectures has motivated …

    uiuc Repository record for Cache design exploration in a general purpose massively parallel architecture (opens in a new tab)