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 19 of 19 for “"priority queue"”.
-
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 …
-
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, …
-
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 …
-
Novel Approaches to Automatic Hardware Acceleration of High-Level Software
… A case study explored the use of a hardware priority queue in graph algorithms. This implementation attained much better performance characteristics compared to software-only counterparts. Seamless communication between accelerator and the host CPU has been achieved by developing an …
-
Priority-Based Resource Allocation Model for Vehicular Fog Computing
… vehicle resources, and just a few have looked at priority techniques. We concentrate on hierarchically allocating resources based on priorities. Priority is given to resource requests based on some attributes of the vehicle, such as deadlines, distances, and mobility considerations. Dynamic …
-
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 …
-
General queueing networks with priorities. Maximum entropy analysis of general queueing network models with priority preemptive resume or head-of-line and non-priority based service disciplines.
Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models …
-
Nonlinear dynamics in complex networks and modeling human dynamics
… Mit Hilfe von einem Interaktion priority-Queue Model kann das neue Modell erklärt werden. Mit Hilfe des Models können viele praktische Interaktions-Systeme erklärt werden, z.B. E-Mail und Briefe (oder Post). Mit Hilfe meiner Untersuchung kann man menschliches Verhalten auf der …
-
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 …
-
Call control signalling for personal communications over interconnected metropolitan area networks
… of isochronous traffic in IEEE 802.6 MANs, high priority, queue-arbitrated (QA) slots accessed by means of the distributed queue dual bus(DQDB) protocol are appropriate for the transport of signalling messages between the major network elements. The use of bandwidth balancing and erasure nodes to …
-
Designing fast and programmable routers
… can be programmed using one simple idea: a priority queue of packets in hardware coupled with a software program to assign each packet's priority in this queue. Third, we develop a system for programmable and scalable measurement of network statistics. Our goal is to allow programmers to …
-
Data Bandwidth Reduction Techniques For Distributed Embedded Simulatio
… showed that the models rely heavily on the priority data structure of the discrete event simulation and that performance of the overall simulation can be enhanced by an additional 6% by improving the queue management. A low run-time overhead, self-adapting storage policy called the Smart …
-
Geometric Algorithms and Data Structures for Simulating Diffusion Limited Reactions
… the kinetic data structure using both a standard priority queue and a treap data structure in order to investigate the algorithms scalability. The treap provides a way for each thread of execution to do more work in a particular region of space. A comparison with a spatial discretization variant …
-
Segmentation And Spatial Depth Ridge Detection Of Unorganized Point Cloud Data
… progresses and uses those labels with a simple priority queue. We found that our approach works especially well for approximating surfaces under the condition where a local surface is poorly sampled (i.e a significant hole is present in the point cloud). We then turn to study the medial axis of …
-
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.
… to varying application scenarios. Active Queue Management (AQM) is a promising scheme to support end-to-end Transmission Control Protocol (TCP) congestion control because it enables the sender to react appropriately to the real network situation. Analytical performance models are powerful …
-
Simple, Fast, Scalable, and Reliable Multiprocessor Algorithms
… through reductions, show that any linearizable queue, stack, priority queue, counter, or union-find object's work complexity must increase with process count; these lower bounds are robust to both randomization and amortization. This thesis includes the original results in Telugu with Sanskrit …
-
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 …
-
Energy-efficient strategies with base station power management for green wireless networks
… station, i.e., HeNB, is modeled as an MAP/PH/1/k queueing system. Such queueing analysis particularly focuses on the HeNB vacation process with user priorities. The HeNB's power on/off scheme is modeled as alternative service and vacation periods. The hybrid access is regarded as high and low …
-
Designing, Modeling, and Optimizing Transactional Data Structures
… of two list-based data structures (i.e., set and priority queue). Then, we present TxCF-Tree, a balanced tree whose design is optimized to support transactional accesses. The core optimizations of TxCF-Tree's operations are: providing a traversal phase that does not use any lock and/or speculation …