2006 International Conference on Parallel Processing (ICPP'06)
DOI: 10.1109/icpp.2006.33
|View full text |Cite
|
Sign up to set email alerts
|

Decoupling the Bandwidth and Latency Bounding for Table-based Schedulers

Abstract: The provision of Quality of Service (QoS)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(18 citation statements)
references
References 15 publications
0
18
0
Order By: Relevance
“…If the average packet size of the different flows is different, the bandwidth that the flows obtain may not be proportional to the number of table entries [8]. Figure 1 shows the performance of various table-based schedulers when there are four Virtual Channels (VCs) in the network.…”
Section: The Dtable Scheduling Mechanismmentioning
confidence: 99%
See 4 more Smart Citations
“…If the average packet size of the different flows is different, the bandwidth that the flows obtain may not be proportional to the number of table entries [8]. Figure 1 shows the performance of various table-based schedulers when there are four Virtual Channels (VCs) in the network.…”
Section: The Dtable Scheduling Mechanismmentioning
confidence: 99%
“…In [8] we proposed a new table-based scheduling algorithm that works properly with variable packet sizes (as can be seen in Figure 1(c)). In order to do so, the DTable scheduler defines an arbitration table in which each table entry has associated a flow identifier and an entry weight.…”
Section: The Dtable Scheduling Mechanismmentioning
confidence: 99%
See 3 more Smart Citations