Priority queues are fundamental in the design of modern multiprocessor algorithms. Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. This paper proposes an alternative approach: to base the design of concurrent priority queues on the Modified Skip List data structure. To this...

This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It motivates the need for fast switching and process coordination modules to be incorporated in DCA algorithm for multi-radio systems. The design strategy is based on a reinterpretation of an adaptive priority mechanism as an ite...

Virtual reality systems are primarily concerned with the presentation of realistic 3D graphics to the user. In light of the fact that the human visual system can only perceive a finite amount of detail, it is therefore possible to reach a balance in the tradeoff between human perception of detail and computational load required for rendering. Priority rendering is a technique designed to reduce...

This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It motivates the need for fast switching and process coordination modules to be incorporated in DCA algorithm for multi-radio systems. The design strategy is based on a reinterpretation of an adaptive priority mechanism as an ite...

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...

In this work, we present a Colored Petri Net (CPN) model used for prototyping and modeling a complex switching scheme for ATM switches based on the combined I/O buffering technique. The new scheme is evaluated here within an overall setting that includes the traffic regulations enforced by the leaky bucket algorithm. It is based on splitting the traffic coming into input lines into two priority...

The priority setting within the context of scarce resources in the Federation of Bosnia and Herzegovina (BH) can be divided into priorities within the health care services provision and priorities within the reconstruction process. Facing the resource scarcity, the Federation of BH has chosen to increase health insurance contribution rate to establish cost-sharing arrangements (co-payments) and...

In this paper, we propose a new client buffer management scheme to adaptively regulate and optimize the decoded video quality for video streaming applications. Our scheme packetizes and prioritizes the video bitstream of MPEG-4 Fine Granularity Scalability. We assign individual packet a priority factor according to its rate-distortion performance and the buffer is managed based on the received ...

In this paper we show that the widely used normalization constraint ∑ n i=1 wi = 1 does not apply to the priority vectors associated with reciprocal relations, whenever additive transitivity is involved. We show that misleading applications of this type of normalization may lead to unsatisfactory results and we give some examples from the literature. Then, we propose an alternative normalizatio...

In this paper we show how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N) time per operation and O(n) space. Here n denotes the number of elements stored in the dictionary and N denotes the size of the universe. Previously, this time bound required O(N) space E77].