1994
DOI: 10.1007/3-540-58429-3_32
|View full text |Cite
|
Sign up to set email alerts
|

Support for multiple classes of traffic in multicomputer routers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

1994
1994
2004
2004

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(12 citation statements)
references
References 22 publications
0
12
0
Order By: Relevance
“…For example, Fig. 2 specifies an 8-ary 2-cube (8 × 8 torus) network that carries a mixture of time-constrained and besteffort traffic, with different traffic patterns, performance metrics, and network policies [12], [34]. The input specification file includes "task" blocks to define the communication workload, routing-switching algorithm, and performance metric for each traffic class.…”
Section: Input Specificationmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, Fig. 2 specifies an 8-ary 2-cube (8 × 8 torus) network that carries a mixture of time-constrained and besteffort traffic, with different traffic patterns, performance metrics, and network policies [12], [34]. The input specification file includes "task" blocks to define the communication workload, routing-switching algorithm, and performance metric for each traffic class.…”
Section: Input Specificationmentioning
confidence: 99%
“…As a result, several studies have used pp-mess-sim to evaluate the PRC and the v-router models under various routingswitching schemes, network topologies, and application workloads [3], [4], [12], [31], [34], [42], [43], [44]. This section presents the results of sample pp-mess-sim experiments that consider the interaction of routing-switching algorithms and communication patterns.…”
Section: Simulation Experimentsmentioning
confidence: 99%
“…Fundamentally, sharing resources and giving guarantees are conflicting, and effi ciently combining guaranteed throughput (GT) traffi c with best-effort (BE) traffi c is hard [10]. By using dedicated techniques for both types of traffi c we try to reduce the total area and power consumption.…”
Section: Network-on-chip Architecturementioning
confidence: 99%
“…Several researchers compared the performance of virtual cut-through and wormhole switching, assuming the simplest configuration for each router: deterministic routing and no virtual channels [1,17]. Assuming that clock frequency is the same for both routers, the results show that both switching techniques achieve the same latency for low loads.…”
Section: Introductionmentioning
confidence: 99%
“…However, wormhole switching quickly saturates as load increases due to blocked packets remaining in the network and keeping the resources previously reserved. Virtual cut-through achieves a much higher throughput at the cost of increased buffer capacity [17].…”
Section: Introductionmentioning
confidence: 99%