The Fishspear priority queue algorithm is presented and analyzed. Fishspear makes fewer than 80% as many comparisons as heaps in the worst case, and its relative performance is even better in many common situations. The code itself embodies an unusual recursive structure which permits highly dynamic and datadependent execution. Fishspear also differs from heaps in that it can be implemented eff...

Quality of service is a key problem in wireless environments where bandwidth is scarce and channel conditions are time varying and sometimes implies highly packet losses. IEEE 802.11b/g/a wireless LAN are the most widely used WLAN standards today, and the IEEE 802.11e quality of service enhancement standard exists and introduces quality of service support for multimedia applications. This paper...

In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L (<?) and the time a customer spends in the system (queue), S (W) under the first-in-first-out (FIFO) discipline lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional laws for both L and Q {overtake free systems). Moreo...

The binary heap of Williams (1964) is a simple priority queue characterized by only storing an array containing the elements and the number of elements n – here denoted a strictly implicit priority queue. We introduce two new strictly implicit priority queues. The first structure supports amortized O(1) time Insert and O(logn) time ExtractMin operations, where both operations require amortized ...

A new priority queue is introduced, for which the cost to insert a new item is constant and the cost to delete the item x with the minimum value is O(log kx), where kx is the number of items that are inserted after x and are still in the heap when x is deleted. We achieve the above bounds in both the amortized case and the worst case.

The well known problem of priority inversions that occurs in classical real-time systems also manifests in decentralized cyber-physical systems. Using a specific example of composable conveyor systems, we show how priority inversions hinder the transport of entities through the conveyor systems. We present a novel adaptation of the classical priority inheritance protocol for resolving these cyb...

Fixed-priority scheduling has become a very important approach for implementing real-time systems. Two key aspects of the method are its support for resource management using priority inheritance protocols and its ability to model modes of operation. In this paper, we discuss the impact of mode changes on the immediate inheritance priority ceiling protocol. We show that the approach adopted in ...

We present a dynamic multipath routing protocol in which packets from different applications dynamically choose their paths by taking into account the price to be paid for taking each path and their ability to pay. We propose a mechanism in which the prices reflect congestion on routers and thus the waiting time for passing the router by a packet and ability to pay is defined by the application...

The Controller Area Network (CAN) is a widely used in-vehicle network and its schedulability is particularly important. In a CAN system, implementing the priority queues is better than FIFO queues with respect to the schedulability, which is widely recognized by users. In this paper, we investigate whether and how much implementing the priority queues is better than FIFO queues when the offset ...

A top down development is presented of a distributed priority queue. The crucial characteristic that enables this development is the compositionality of the formalism used. Actually we argue that a stronger requirement is needed which combines compositionality with the ability to adapt given specifications, called modularity.