Name
Abstract | ||
|---|---|---|
The scheduling algorithm is useful in providing quality of service (QoS). In this paper, a scheduling algorithm, jumping virtual clock (JVC), is developed to has O(I) complexity of calculating virtual time. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/AINA.2005.42 | AINA |
Keywords | Field | DocType |
wfq,fair queueing,diffserv networks,jumping virtual clock,scheduling,virtual time,scheduling algorithm,quality of service,virtual clock,queueing theory,computational complexity,qos,complexity,new scheduling algorithm,virtual time calculation,jumping virtual clock (jvc),testing,tv | Fair-share scheduling,Computer science,Scheduling (computing),Quality of service,Computer network,Two-level scheduling,Real-time computing,Weighted fair queueing,Dynamic priority scheduling,Computational complexity theory,Distributed computing,Fair queuing | Conference |
Volume | ISSN | ISBN |
2 | 1550-445X | 0-7695-2249-1 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lain-chyr Hwang | 1 | 16 | 6.10 |
| San-Yuan Wang | 2 | 100 | 7.99 |
| Steen J. Hsu | 3 | 32 | 8.38 |
| Yong-Hua Huang | 4 | 2 | 0.74 |