We analyze a priority queueing system with congestion control based on thresholds. A priority queue with a triple of thresholds consisting of an abatement threshold, an onset threshold and a discard threshold was investigated by San-qi Li. We extend Li's model to a priority queue with N triples of thresholds and obtain the stationary probabilities of queue length by using the Embedded Markov ch...

The replication of the non-structure data from one data center to another is an urgent task in HBase. The paper studies the priority growth probability of the priority replication queue and proposed a dynamic priority replication task queue algorithm based on the earliest deadline first algorithm (EDF). The experiment results show that the proposed algorithm can balance the replication overhead...

We consider eecient algorithms for priority queues on distributed memory multiprocessors, such as nCUBE, iPSc, MPP and loosely-coupled systems consisting of networked workstations. For a p-processor distributed memory multicomputer P and n data items in the priority queue, n > p, we investigate two priority queues; horizontally sliced and vertically sliced. Both of these achieve load balance, i...

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. We obtain the transforms of the queue length and sojourn time distributions under the assumption of Poisson arrivals, generally distributed service time...

Priority queues are fundamental to many multiprocessor applications. Several priority queue algorithms based on skiplists have been proposed, as skiplists allow concurrent accesses to different parts of the data structure in a simple way. However, for priority queues on multiprocessors, an inherent bottleneck is the operation that deletes the minimal element. We present a linearizable, lock-fre...

In high speed networks, the Strict Priority (SP) scheduling discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diverse performance requirements. With this discipline, however, packets at higher priority levels can starve packets at lower priority levels. To resolve this starvation problem, we propose to assign a parame...