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 78 for “"priority queue"”.

  1. Relaxed Priority Queue & Evaluation of Locks

    We present a new, lock-free and concurrent priority queue, utilizing some ideas from [1] by Rukundo et al., that relaxes the traditional sequential semantics of the delete_min operation to achieve better scalability and performance. This relaxation is such that delete_min operations can be …

    chalmers Repository record for Relaxed Priority Queue & Evaluation of Locks (opens in a new tab)

  2. FlexQueue: Simple and Efficient Priority Queue for System Software

    Existing studies of priority queue implementations often focus on improving canonical operations such as insert and deleteMin, while sacrificing design simplicity and pre- dictable worst-case latency. Design simplicity is sacrificed as the algorithm becomes more and more optimized, taking into …

    waterloo Repository record for FlexQueue: Simple and Efficient Priority Queue for System Software (opens in a new tab)

  3. Non-blocking Priority Queue based on Skiplists with Relaxed Semantics

    Priority queues are data structures that store information in an orderly fashion. They are of tremendous importance because they are an integral part of many applications, like Dijkstra’s shortest path algorithm, MST algorithms, priority schedulers, and so on. Since priority queues by nature have …

    unlv Repository record for Non-blocking Priority Queue based on Skiplists with Relaxed Semantics (opens in a new tab) Download PDF for Non-blocking Priority Queue based on Skiplists with Relaxed Semantics (opens in a new tab)

  4. High performance sequential and lock-free parallel access priority queue structures

    … sequential and lock-free parallel access priority queues. The choice of a high speed priority queue structure plays an integral role in numerous applications, particularly for sizeable scenarios such as large-scale discrete event simulations. The conventional priority queues fall into two …

    nus Repository record for High performance sequential and lock-free parallel access priority queue structures (opens in a new tab) Download file for High performance sequential and lock-free parallel access priority queue structures (opens in a new tab)

  5. A System-Level Implementation of a Verified Fibonacci Heap as Priority Queue - A System-Level Verification of a Forest of Trees

    This thesis presents the functional correctness of the insert, meld, and extract minimum operation of the Fibonacci heap in the system-level programming language Pancake. The verification is carried out with the interactive theorem prover hol4 and Pancake’s associated separation logic framework. …

    chalmers Repository record for A System-Level Implementation of a Verified Fibonacci Heap as Priority Queue - A System-Level Verification of a Forest of Trees (opens in a new tab)

  6. Performance analysis of a multiplexer with priority queues and correlated arrivals

    … data, voice and video in a single network. The priority mechanism allows differentiating among services such that they can meet their QoS requirements. Since a switch output port may be considered as a statistical multiplexer, and the packets coming from an application are correlated, it is very …

    concordia Download PDF for Performance analysis of a multiplexer with priority queues and correlated arrivals (opens in a new tab)

  7. Analysis of a feed-forward priority queueing system

    … deals with the problem of analyzing feed-forward priority queueing systems. In this type of system incoming units enter one of n priority queues if the service facility is busy. Units in the highest priority queue are served on a first-come-first-served basis while units in the lower priority …

    vt Repository record for Analysis of a feed-forward priority queueing system (opens in a new tab)

  8. Cache Oblivious Data Structures

    … this layout is a heap-like implementation of the priority queue. This structure allows Inserts, Heapifies and ExtractMaxes in O(log n) time and O(log nlog L) cache misses. A priority queue using this layout can be builtfrom an unsorted array in linear time. Besides the n spaces required to hold …

    waterloo Repository record for Cache Oblivious Data Structures (opens in a new tab)

  9. Comparison and analysis of some algorithms for implementing priority queues

    A priority queue is a data structure for maintaining a collection of items, each having an associated key, such that the item with the largest key is easily accessible. Priority queues are implemented by using heap, k-ary tree, single linked-list, leftist tree, linked tree, AVL-tree, 2-3 tree, and …

    nps Repository record for Comparison and analysis of some algorithms for implementing priority queues (opens in a new tab)

  10. VLSI support for scheduling and buffer management in high speed packet-switched networks

    … The thesis addresses the design of two specific queue architectures: balanced parallel multi-input multi-output (MIMO) buffers, and systolic parallel priority queues (PPQ). A methodology for the systematic design of order-preserving parallel MIMO buffers is presented. The MIMO buffer employs an …

    ubc Repository record for VLSI support for scheduling and buffer management in high speed packet-switched networks (opens in a new tab) Download PDF for VLSI support for scheduling and buffer management in high speed packet-switched networks (opens in a new tab)

  11. Decomposing non-product form queuing lattices through simulated annealing

    … is the key to save computational effort. Some Queueing models like Erlang Queue, ISDN Protocol, Priority Queue will be discussed in the document. The decomposition result tends to a global optimum if the Energy Function of a problem is carefully defined.</p>

    njit Repository record for Decomposing non-product form queuing lattices through simulated annealing (opens in a new tab)

  12. Efficient Ray Tracing on FPGAs

    … to their scalability the implementation of the priority queue contained within them. A novel hybrid hardware combination of a single-cycle queue and a heap is presented that combines the speed of a single-cycle queue with the scalability of a heap. An innovative method to simulate different …

    auckland-ms Repository record for Efficient Ray Tracing on FPGAs (opens in a new tab)

  13. Development and implementation of air module algorithms for the Future Theater Level Model

    … unit. Model II uses Dynamic Programming and priority queue techniques to select ingress (and separate) egress routes from flight group air rendezvous points to a designated air grid which may be a target, reconnaissance area, or orbit location. Model III simultaneously selects a target from …

    nps Repository record for Development and implementation of air module algorithms for the Future Theater Level Model (opens in a new tab)

Page 1 of 4