This paper deals with the performance analysis of two prioritized handoff schemes for mobile cellular networks in which handoff attempts finding all channels busy are queued for a maximum time. Fixed channel assignment is assumed. In the first prioritized handoff scheme considered, handoff attempts are queued according to the first-in–first-out (FIFO) policy. Conversely, the second scheme resor...

We consider a two-class M " A2 IMI'11 preemptive priority queue in which there are two essential on-line decisions that have to be taken. The first is the decision to either accept or reject new type-lor type-2 jobs. The second is the decision to abort jobs, i.e., to remove any type-lor type-2 jobs from the system. We show that there exist optimal threshold policies for these two types of decis...

This paper proposes and evaluates prioritized direct shared-memory multiprocessor networks. We use three components to implement prioritized networks, namely, priority-based link arbitration, priority inheritance , and dynamic virtual channels. The two major results from our study are: (i) adding priorities to direct shared-memory multiprocessor networks can lead to reduced average transaction ...

In this paper we propose an event-triggered communication protocol with dynamic priority setting for high-integrity systems. The dynamic priority scheduling involves two components: a component based on node transmission history, and a static node identifier. In order to investigate the characteristics of the proposed protocol, the worst-case performance is analysed and simulation experiments a...

This paper proposes a new data structure called a variable-priority queue. The queue supports, in addition to the ordinary queue operations, an operation MIN to find an item of minimum key and three operations to change keys of items. Any sequence of these m operations can be processed in O(m) time. Furthermore, as its application, this paper presents two efficient algorithms for network proble...

We propose the post-order heap, a new data structure for implementing priority queues. Our structure is a simple variant of the binary heap that requires only Θ(1) amortized time for Insert operations and O(log n) time in the worst case for Delete-Min operations. Like the binary heap, the post-order heap is an implicit data structure, meaning that a structure containing n elements can be stored...

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O(log n) amortized time. Our structure is simple and promises a more efficient practical behavior compared to any other known Fibonacci-like heap.

We consider the classical problem of representing a collection of priority queues under the operations find-min, insert , decrease, meld , delete, and delete-min. In the comparison-based model, if the first four operations are to be supported in constant time, the last two operations must take at least logarithmic time. Brodal showed that his worst-case efficient priority queues achieve these w...

Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra’s single source shortest path algorithm, resort to cumbersome and inefficient workarounds. We report on a heap-based concurrent priority queue which allows to change the priority of an element after its insertion. We sh...