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

This paper presents the A ected Set Priority Ceiling Protocols (ASPCP) for concurrency control in real-time object-oriented systems. These protocols are based on a combination of semantic locking and priority ceiling techniques. This paper shows that the ASPCP protocols provide higher potential concurrency for object-oriented systems than existing Priority Ceiling protocols, while still boundin...

Infrastructure resilience is a priority for homeland security in many nations around the globe. This paper describes a new approach for quantitatively assessing the resilience of critical infrastructure systems. The mathematics of optimal control design provides the theoretical foundation for this methodology. This foundation enables the inclusion of recovery costs within the resilience assessm...

Preschool children are an important nutritionally vulnerable segment of the population; they are the future citizens of the country. Therefore, prevention, early detection, prompt and effective treatment of undernutrition in preschool children had received priority attention. Height and weight have been widely used as anthropometric indices for assessment of nutritional status of preschool chil...

In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions for the probability generating function of the system contents and the packet delay. Some perfor...