We study the problem of priority inversion in distributed real-time and embedded systems and propose a solution based on a distributed version of the priority inheritance protocol (PIP). Previous approaches to priority inversions in distributed systems use variations of the priority ceiling protocol (PCP), originally designed for centralized systems as a modification of PIP that also prevents d...

A priority queue transforms an input sequence ~r into an output sequence r which is a re-ordering of the sequence ~r. The set R of all such related pairs is studied in the case that tr is a binary sequence. It is proved that R is a partial order and that IRI = c,~+1, the (n + 1)th Catalan number, An efficient (O(n2)) algorithm is given for computing the number of outputs achievable from a given...

A priority queue transforms an input permutation cr of some set of size n into an output permutation z. It is shown that the number of such pairs (a, z) is (n + 1)"1 Some related enumerative and algorithmic questions are also considered.

ù ù ù Ê ù Ê Ê ù ù ë ù Ê Ñ ë Ê ù ñ Ê Ñ ò ÿ , è õ õ ë ë ý • ø õ À • ´ ð ´ ´ , ´ ñ è é y è ù ù ú ù Ê î ù ñ Ê ù ù Ñ Ê ù Ê Ê ù Ê ù Ê Ê ù ù ë , ø õ • ë • ² õ • ´ ë ñ è • ´ ü þ î ì # î Ê ù î ù õ ù Ê Ê â ñ Ê Ê ñ ö ì • • ý ï • y ù õ ë õ è ù • • À ² î Ê ù î ù î Ö ø â ² ì é õ ø y ù õ Ê Ê î ù ñ ù Ê ñ õ î î â è ø ÿ þ À õ ´ õ À ñ • ´ • y ù õ õ • é H # ñ î ñ ù ù î ù Ê Ê î õ ñ ù ù ñ î ù î õ ù Ê î ù ù ñ î î Ê î...