Sciweavers

493 search results - page 23 / 99
» Final exam scheduler - FES
Sort
View
CN
2011
94views more  CN 2011»
13 years 4 months ago
Modeling the interactions of congestion control and switch scheduling
—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...
Alexander Shpiner, Isaac Keslassy
RTAS
2011
IEEE
13 years 18 days ago
Maximizing Contention-Free Executions in Multiprocessor Scheduling
—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...
Jinkyu Lee, Arvind Easwaran, Insik Shin
ECRTS
2002
IEEE
14 years 2 months ago
Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors
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
RTSS
2002
IEEE
14 years 2 months ago
Analysis of a Reservation-Based Feedback Scheduler
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...
ESOP
2001
Springer
14 years 2 months ago
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
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 ...
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-G...