2002
DOI: 10.1145/513918.514052
|View full text |Cite
|
Sign up to set email alerts
|

Memory optimization in single chip network switch fabrics

Abstract: Moving high bandwidth (10Gb/s+) network switches from the large scale, rack mount design space to the single chip design space requires a re-evaluation of the overall design requirements. In this paper, we explore the design space for these single chip devices by evaluating the ITRS. We find that unlike ten years ago when interconnect was scarce, the limiting factor in today's designs is on-chip memory. We then discuss an architectural technique for maximizing the effectiveness of queue memory in a single chip… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2002
2002
2005
2005

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…In this section we show a subset of the experiments, pertaining to a 2-D torus, developed to show the implications and trade-offs of coarse grain design decisions. Other results can be found in [8]. The model used there was derived from the one described here.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…In this section we show a subset of the experiments, pertaining to a 2-D torus, developed to show the implications and trade-offs of coarse grain design decisions. Other results can be found in [8]. The model used there was derived from the one described here.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Pinto et al [18] presents a heuristic for the constraint-driven communication synthesis of on-chip communication networks, while [20] describes a design methodology for finding minimal topologies that support low contention or contention-free communication for known communication patterns. In [19], memory optimization in single chip network fabrics is explored.…”
Section: Previous Workmentioning
confidence: 99%
“…Throughput Loss We considered aggregate accesses from 2 write and 2 read ports 3 . By serializing the accesses from the 4 ports in a round-robin manner we measured the throughput loss presented in Table 1.…”
Section: No Optimization Optimization Throughput Lossmentioning
confidence: 99%
“…Write access delay = 40 ns, Read access delay = 60 ns. When write accesses occur after read accesses, the write access must be delayed 1 access cycle 3. A write and a read port from/to the network, a write and a read port from/to an internal processing unit.Proceedings of the Design, Automation and Test in Europe Conference and Exhibition (DATE'05) 1530-1591/05 $ 20.00 IEEE…”
mentioning
confidence: 99%