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 39 for “"Priority queues"”.

  1. Priority queues with limited capacity

    ghent Repository record for Priority queues with limited capacity (opens in a new tab)

  2. 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)

  3. A P4 practical deployment of priority queues with stratum and ONOS

    … of the Stratum switch operating system enabled priority queues in BMv2, with low queue rates that simulate harsh battlefield conditions. The ONOS CLI has been enhanced with simple and intuitive prioritization commands, vital for dynamic and responsive network management. The experiments …

    brazil-ufrgs Repository record for A P4 practical deployment of priority queues with stratum and ONOS (opens in a new tab)

  4. 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)

  5. A Generalization of M/G/1 Priority Models via Accumulating Priority

    Priority queueing systems are oftentimes set up so that arriving customers are placed into one of $N$ distinct priority classes. Moreover, to determine the order of service, each customer (upon arriving to the system) is assigned a priority level that is unique to the class to which it belongs. In …

    waterloo Repository record for A Generalization of M/G/1 Priority Models via Accumulating Priority (opens in a new tab)

  6. 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)

  7. 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)

  8. Selectable Heaps and Their Application to Lazy Search Trees

    … n) time extract minimum function of efficient priority queues can be generalized to the extraction of the k smallest elements in O(k log(n/k)) time. We first show the heap-ordered tree selection of Kaplan et al. can be applied on the heap-ordered trees of the classic Fibonacci heap to support …

    waterloo Repository record for Selectable Heaps and Their Application to Lazy Search Trees (opens in a new tab)

  9. 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)

  10. Discrete-time queueing models with priorities

    … analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the …

    ghent Repository record for Discrete-time queueing models with priorities (opens in a new tab)

  11. A Comparison of Concurrent Correctness Criteria for Shared Memory Based Data Structure

    … be presented using data structures like FIFO Queues, Stacks, and Priority Queues, and with a case study for performance of these implementations using different correctness criteria.

    ucf Repository record for A Comparison of Concurrent Correctness Criteria for Shared Memory Based Data Structure (opens in a new tab)

  12. Fast Parallel Algorithms for Basic Problems

    … In this thesis, we study the following problems: priority queues, multiple search and multiple selection, and reconstruction of a binary tree from its traversals. The research on priority queue was motivated by its various applications. The purpose of studying multiple search and multiple …

    odu Repository record for Fast Parallel Algorithms for Basic Problems (opens in a new tab)

  13. 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)

  14. SDN-BASED MECHANISMS FOR PROVISIONING QUALITY OF SERVICE TO SELECTED NETWORK FLOWS

    … signals. The new mechanism pre-allocates higher priority queues in routers/switches and reserves these queues for control/sensor traffic. Third, we explore how to make the applications take advantage of the opportunity provided by SDN. In particular, we study new transmission mechanisms for big …

    uky-thes Repository record for SDN-BASED MECHANISMS FOR PROVISIONING QUALITY OF SERVICE TO SELECTED NETWORK FLOWS (opens in a new tab)

  15. Waiting-line problems with priority assignment, and its application on hospital emergency department wait-time

    … discussing such waiting line problems with priority assignment on each customer. This type of queueing processes are called priority queueing models. Patients requiring ER service are triaged and the order of providing service to patients more than often reflects early symptoms and …

    manitoba Repository record for Waiting-line problems with priority assignment, and its application on hospital emergency department wait-time (opens in a new tab)

  16. Leveraging Help Requests In Pomdp Intelligent Tutors

    … This dissertation introduces two improvements, priority queues and observation chains, to make POMDPs scale well and encompass the large problem sizes that real-world ITSs must confront. A new ITS was created to support trainees practicing a military task in a virtual environment. The …

    ucf Repository record for Leveraging Help Requests In Pomdp Intelligent Tutors (opens in a new tab)

  17. Architectural support for work-efficient relaxed priority queueing

    Limited Restriction set for Item 102680 on 2019-04-29T15:20:14Z with date 2020-08-10 by fschaef2@illinois.edu.

    uiuc Repository record for Architectural support for work-efficient relaxed priority queueing (opens in a new tab)

Page 1 of 2