737 search results - page 1 / 148 » Group Priority Scheduling |
INFOCOM
1996
IEEE
13 years 9 months ago
1996
IEEE
We present an end-to-end delay guarantee theorem for a class of guaranteed-deadline (GD) servers. The theorem can be instantiated to obtain end-to-end delay bounds for a variety of...
COMCOM
2002
13 years 5 months ago
2002
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is ...
RTS
2006
13 years 5 months ago
2006
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...
ICDE
2000
IEEE
14 years 6 months ago
2000
IEEE
In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priori...
AINA
2005
IEEE
13 years 11 months ago
2005
IEEE
The rapid development of Internet makes network management on large-scale network a critical issue. But with the management task of large-scale network becoming more complicated, ...