Real-Time Mach provides real-time thread and real-time synchronization facilities. A real-time thread can be created for a periodic or aperiodic activity with a timing constraint. Threads can be synchronized among them using a real-time version of the monitor based synchronization mechanism with a suitable locking protocol. In Real-Time Mach, we have implemented several locking policies, such a...

In recent years, real-time operating systems began to support the resource reservation paradigm. This technique has proved to be very effective in providing QoS to both, real-time and legacy applications, ensuring that the temporal misbehavior of an application does not affect any other (temporal isolation). However, resource sharing in a reservation system is still not well understood, and can...

A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...

We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies th...

OBJECTIVES The aim of this study was to examine priority setting for coronary artery bypass surgery, and to provide an overview of decisions and rationales used in clinical practice. METHOD Questionnaires were sent to all permanently employed cardiologists, cardiothoracic surgeons, and anaesthesiologists at nine Swedish hospitals performing adult cardiothoracic surgery. RESULTS A total of 2...

In this work, we present an efficient error resilient system against ATM cell loss using a hybrid error concealment and error propagation prevention (ECP) technique with dual-priority transmission scheme (DPTS). DPTS performs traffic policing to form dual-priority cells in ATM connections and manages to make most cell losses occur in a low priority layer. However, cell loss may still occur in t...

As high technology product market becomes more dynamic and competitive, chip manufacturers need to bring products to customers in short periods of time. As a result, semiconductor fabrication plants regularly contain lots with priority status. These lots have several unique characteristics compared to other production lots, both in terms of lot transport and scheduling on tools. These lots cons...

In this paper, we present an analytical and simulated study on the performance of adaptive vehicular ad hoc networks (VANET) priority based on Transmission Distance Reliability Range (TDRR) and data type. VANET topology changes rapidly due to its inherent nature of high mobility nodes and unpredictable environments. Therefore, nodes in VANET must be able to adapt to the ever changing environmen...

The priority inversion problem has been detected two decades ago. The decisive ideas to cope with this problem have been published one decade ago. In the meantime the vendors of operating systems and run–time systems have occupied this topic in providing certain protocols in order to avoid priority inversion. However, at a closer look there are considerable differences in the usage and the resu...

The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm. It also has very good practical performance and is robust over a wide range of graph types. The heart of Dijkstra's algorithm is a monotone priority queue, that is, a priority queue where no element on the queue ever becomes smaller than the most recently extracted ele...