We develop an optimal cache-oblivious priority queue data structure, supporting insertion, deletion, and delete-min operations in O( 1 B logM/B N B ) amortized memory transfers, where M and B are the memory and block transfer sizes of any two consecutive levels of a multilevel memory hierarchy. In a cache-oblivious data structure, M and B are not used in the description of the structure. Our st...

In this paper a single server preemptive priority queuing system consisting of two types of customer units with Poisson arrival, exponential service time distribution and exponential vacation is analyzed. Two type of customer units of which higher priority units of unlimited Poisson input are served by bulk service rule and limited Poisson input of low priority units served singly. The bulk ser...

This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/G/1 queue. An explicit one-to-one non linear transformation is obtained between earliest due date and delay dependent priority policy. Mean waiting time equivalence between thes...

In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min O(lgn) worstcase time including at most lgn+O(1) element comparisons, where n is the number of elements stored. One priority queue is based on a weak heap (array-based) and the other on a weak queue (pointer-based). In both, the main idea is to temporarily store the inserted e...

In this paper, we model a call center as a preemptive-resume priority queue with time-varying arrival rates and two priority classes of customers. The low priority customers have a dynamic priority where they become high priority if their waiting-time in queue exceeds a given service-level time. The performance of the call center is measured by the mean number in system for the two customer cla...

Wireless and mobile networks have experienced a great success in the past few years. However, any single type of wireless and mobile network cannot meet all types of service requirements. For example, no single type of existing wireless and mobile network can provide both wide coverage and high bandwidth services. In order to provide more comprehensive services, an integrated heterogeneous wire...

We present simple randomized algorithms for parallel priority queues on distributed memory machines. Inserting O(n) elements or deleting the O(n) out of m smallest elements using n pocessors requires O (

In this note we present an implementation of the fast marching algorithm for solving Eikonal equations that reduces the original run-time from O(N logN) to linear. This lower run-time cost is obtained while keeping an error bound of the same order of magnitude as the original algorithm. This improvement is achieved introducing the straight forward untidy priority queue, obtained via a quantizat...

–In this paper we propose a novel media access control (MAC) architecture to support differentiated service in IEEE 802.11 WLAN. By employing the MAC-core as base and different adaptors as add-ons in this architecture, the resulting MAC can provide prioritized services with different delays and throughputs. Our simulation studies show that the resulting MAC protocols based on this architecture ...

A queueing system M1, M 2 / G 1, G 2 / 1 / N with different scheduling and push-out scheme is analyzed in this paper. This work is motivated by the study of the performance of an output link of ATM switches with traffic of two classes with different priorities. However, the queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priorit...