In communication and computer systems, autonomous sources may assign priorities to their messages or jobs locally and independently. When a remote service (e.g., message transmission or RPC) is requested at a shared server, the server cannot use priority scheduling schemes eeectively unless it can make a comparison between priorities deened by individual sources. In this paper, we investigate t...

This paper considers the problem of fixed priority scheduling of periodic tasks where each task’s execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theore...

In most real world systems, objects vastly outnumbers threads. This paper shows how this characteristic can be used to implement efficient JavaTMmonitors in a way that reduces the number of needed monitors to be equal to the number of threads, while fulfilling the JavaTMsynchronized semantics. Some additional benefits related to priority inheritance and hierarchical resource locking will also b...

This theory implements priority queues via Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees.

In this paper we identify a class of Quasi-Birth-and-Death (QBD) processes where the transitions to higher (resp. lower) levels are restricted to occur only from (resp. to) a subset of the phase space. These restrictions induce a specific structure in the R or G matrix of the QBD, which can be exploited to reduce the time required to compute these matrices. We show how this reduction can be ach...