—In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. We show that switch scheduling algorithms tha...
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
Anand Srinivasan, Philip Holman, James H. Anderson
When executing soft real-time tasks in a shared processor, it is important to properly allocate the computational resources such that the quality of service requirements of each t...
Luca Abeni, Luigi Palopoli, Giuseppe Lipari, Jonat...
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...