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 16 of 16 for “"Priority queues"”.
-
MergeArray and scalable, relaxed, concurrent, mergeable priority queues
The priority queue is a well-studied data structure which has prospered in the ever-growing field of distributed computing. However, in the asynchronous shared-memory model, one operation was left behind: merge. I present the MergeArray, a framework for implementing scalable, relaxed, concurrent, …
-
Queueing System Analysis in Oil and Gas Abandonment Operations
… to explore the impact of prioritization and priority queues on the defined system performance metrics. Due to the complexity of the system, and instances when the server capacity required exceeds the capacity available, traditional queueing equations are inadequate, necessitating the use of …
-
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 …
-
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 …
-
Congestion Control in Machine Learning Clusters
… unfair congestion control scheme, (ii) priority queues on switches, and (iii) precise flow scheduling.
-
Fast Parallel Algorithms for Basic Problems
… 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 …
-
The SprayList : a scalable relaxed priority queue
High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in …
-
Congestion Control for DNN training clusters
… jobs in a distributed manner without requiring priority queues, centralized information, or switch hardware support. Prior work on MLTCP proposed updates to existing congestion control algorithms to make them capable of minimizing network congestion when DNN jobs compete for the network. In this …
-
A non-exponential communication network statistical study
… is analysed, as well as those encountered in priority queues with and without preemption, and at a node in a K-connected data communication network. The originality of this work is the assumptions that (1) messages are allowed to enter the network in groups of geometrically distributed sizes, …
-
Relaxed concurrent ordering structures
… ordering structures, including stacks, queues, and priority queues, have long been elusive due to an inherent bottleneck on the 'head' element. We argue that classical semantics which are easy to support in sequential settings are stronger than necessary for concurrent applications, and …
-
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.
-
Performance Evaluation of Competing Data Structures in Pathfinding
… of the algorithm. It is well known that using a priority queue will increase the performance of this algorithm. A number of priority queues have been used to implement A* and improve the performance of this algorithm. We propose to use a Lazy binary heap and evaluate its performance compared to …
-
Performance modeling of congestion control and resource allocation under heterogeneous network traffic. Modeling and analysis of active queue management mechanism in the presence of poisson and bursty traffic arrival processes.
… system with single-queue and multiple-queues, respectively, for AQM scheme in the presence of multiple priority traffic classes scheduled by the Priority Resume (PR) policy. ¿ Carry out the performance comparison of AQM with PR and First-In First-Out (FIFO) scheme and compare the …
-
Modelling the performance of web services in cloud e-marketplaces based on consumer waiting time and provider cost
… and consumer waiting time in the context of non-priority and non-pre-emptive priority policy is imperative, the study accomplished the following: i. It extensively reviewed the existing body of knowledge on the performance of E-Marketplaces. ii. It identified the need to re-engineer the existing …
-
Towards GPU-accelerated discrete optimization
… due to the difficulty of implementing concurrent priority queues on massively parallel architectures. We overcome this challenge by developing a master-worker-based concurrent priority queue, dynamic memory management strategies for subproblem storage, and a message-passing mechanism that enables …
-
Δενδρικές δομές διαχείρισης πληροφορίας και βιομηχανικές εφαρμογές
H διατριβή διερευνά προβλήματα αποδοτικής οργάνωσης χωροταξικών δεδομένων, προτείνει συγκεκριμένες δενδρικές δομές για τη διαχείρισή τους και, τέλος, δίνει παραδείγματα χρήσης τους σε ειδικές περιοχές εφαρμογών. Το πρώτο κεφάλαιο ασχολείται με το γεωμετρικό πρόβλημα της εύρεσης των …