R. J. Black. Explicit Network Scheduling. PhD thesis, University of Cambridge Computer Laboratory, Apr. 1995. Available as Technical Report no. 361. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Self-Paging in the Nemesis Operating System - Hand (1999) (29 citations) (Correct)
....pending requests and, if there is work to be done for multiple clients, chooses the one with the earliest deadline and performs a single transaction. Clients communicate with the USD via a FIFO buffering scheme called IO channels; these are similar in operation to the rbufs scheme described in [35]. The actual scheduling is performed by a modified earliest deadline first (EDF) algorithm: each client is periodically allocated s ms of time and a deadline of now p ms, and placed on a runnable queue. A thread in the USD domain is awoken whenever there are pending requests and, if there is ....
R. J. Black. Explicit Network Scheduling. PhD thesis, University of Cambridge Computer Laboratory, April 1995. Available as Technical Report no. 361.
A case for Virtual Channel Processors - McAuley, Neugebauer (2003) (2 citations) (Correct)
No context found.
R. J. Black. Explicit Network Scheduling. PhD thesis, University of Cambridge Computer Laboratory, Apr. 1995. Available as Technical Report no. 361.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC