Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an...

This thesis analyzes and compares four different mechanisms for providing QoS in IEEE 802.11 wireless LANs. We have evaluated the Point Coordinator Function (which is the IEEE 802.11 mode for service differentiation), Distributed Fair Scheduling, Blackburst, and a scheme proposed by Deng et al. using the ns-2 simulator. The evaluation covers medium utilization, access delay, and the ability to ...

We have developed an efficient single queue scheduling system that utilizes a greedy knapsack algorithm with dynamic job priorities. Our scheduler satisfies high level objectives while maintaining high utilization of the HPC system or collection of distributed resources such as a computational GRID. We provide simulation analysis of our approach in contrast with various scheduling strategies of...

The Worldwide Interoperability for Microwave Access (WiMAX) is the IEEE 802.16 standard. Scheduling in WiMAX become one of the most challenging issues, since it is responsible for distributing available resources among users to meet the Quality of Service(QOS) criteria such as delay, delay jitter, fairness and throughput requirements. However, no specific scheduling mechanism has been defined t...

The need for improved network traffic and bandwidth management becomes more and more urgent as real time applications begin to coexist within current shared infrastructure. Recent developments within the research community and within commercial products provide numerous technologies that may be applied as solutions. The most popular are Differentiated Services (DiffServ) with numerous different...

A priority based packet scheduling scheme is proposed which aims at scheduling different types of data packets, such as real time and non-real-time data packets at sensor nodes with resource constraints in Wireless Sensor Networks. Most of the existing packet-scheduling mechanisms of Wireless Sensor Networks use First Come First Served (FCFS), non-preemptive priority and preemptive priority sch...

In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) guarantees. Priority queues are used to implement highest-priority-first scheduling policies. Our hardware architecture is based on a new data structure called a Pipelined heap, or P-heap for short. This data structure en...

RTOS based embedded systems are designed with priority based multiple tasks. Inter task communication and data corruptions are major constraints in multi-tasking RTOS system. This study we describe about the solution for these issues with an example Real-time Liquid level control system. Message queue and Mail box are used to perform inter task communication to improve the task execution time a...

Meeting quality of service (QoS) requirements for various services in ATM networks has been very challenging to network designers. Various control techniques at either the call or cell level have been proposed. In this paper, we deal with cell transmission scheduling and discarding at the output buffers of an ATM switch. We propose a generalized priority queue manager (GPQM) that uses per-virtu...

We present a deterministic oblivious LIFO (Stack), FIFO, double-ended and double-ended priority queue as well as an oblivious mergesort and quicksort algorithm. Our techniques and ideas include concatenating queues end-to-end, size balancing of multiple arrays, several multi-level partitionings of an array. Our queues are the first to enable executions of pop and push operations without any cha...