PCI express and advanced switching: evolutionary path to building next generation interconnects

@article{Mayhew2003PCIEA,
  title={PCI express and advanced switching: evolutionary path to building next generation interconnects},
  author={David Mayhew and Venkata Krishnan},
  journal={11th Symposium on High Performance Interconnects, 2003. Proceedings.},
  year={2003},
  pages={21-29}
}
  • D. MayhewV. Krishnan
  • Published 15 September 2003
  • Computer Science
  • 11th Symposium on High Performance Interconnects, 2003. Proceedings.
With processor and memory technologies pushing the performance limit, the bottleneck is clearly shifting towards the system interconnect. Any solution that addresses the PCI bus-based interconnect, which has serious scalability problems, must also protect the huge legacy infrastructure. PCI Express provides such an evolutionary approach and allows a smooth migration towards building a highly scalable next generation interconnect. Advanced switching further boosts the capabilities of PCI Express… 
View on IEEE
hoti.org
78 Citations
Highly Influential Citations
7
Background Citations
32
Methods Citations
12

Figures from this paper

78 Citations

Seamless Fail-over for PCIe Switched Networks

The design, implementation and preliminary evaluation of a fault-tolerant PCIe-based rack area network architecture called Ladon, which incorporates a fail-over mechanism that takes effective advantage of PCIe architectural features to significantly reduce the service disruption time due to a control plane failure of a PCIe switch.

A proposal for managing ASI fabrics

Implementing the Advanced Switching Minimum Bandwidth Egress Link Scheduler

This paper proposes several implementations of the Min BW scheduler and compares their performance by simulation, finding several that fulfill all the properties that an AS MinBW scheduler must have, including the interaction with the AS link layer flow control.

A high throughput 3D-bus interconnect for network processors

A Framework to Provide Quality of Service over Advanced Switching

A framework to provide QoS based on bandwidth, latency, and jitter over AS employing the mechanisms provided by AS is proposed and several implementations for the output scheduling mechanism are presented.

Prototyping Efficient Interprocessor Communication Mechanisms

An efficient FPGA-based platform that is developed and used for research and experimentation on high speed interprocessor communication, network interfaces and interconnects, and shows how software can take advantage of the provided features, but also expose the weaknesses of the system.

Latest generation interconnect technologies in APEnet+ networking infrastructure

The 3rd generation design of the APEnet board (V5) built upon the 28nm Altera Stratix V FPGA is presented; it features a PCIe Gen3 x8 interface and enhanced embedded transceivers with a maximum capability of 12.5Gbps each.

Compatibility enhancement and performance measurement for socket interface with PCIe interconnections

This paper implements the PCIe based interconnection network system with low latency, low power, RDMA, and other characteristics using Socket API which is mainly used in the user-level application program rather than the existing MPI and PGAS model interfaces.

High performance architectures for Chip-to-Chip Communications on Network Line Cards

Performance results show that both 3D-interconnects achieve high throughput, low latency results surpassing other common interconnects currently deployed, and were able to sustain high traffic load while keeping low failure rates and high bandwidth utilization levels.

Studying Several Proposals for the Adaptation of the DTable Scheduler to Advanced Switching

This paper proposes several possible modifications to the original AS table scheduler in order to implement the Deficit Table (DTable) scheduler, which works properly with variable packet sizes and allows to partially decouple the bandwidth and latency assignments.
...

References

SHOWING 1-10 OF 34 REFERENCES

Layered shortest path (LASH) routing in irregular system area networks

This paper proposes a method that guarantees shortest path routing and in-order delivery, and that uses virtual channels for deadlock avoidance, and presents a theoretical upper bound on the number of virtual channels needed, and demonstrates that the actual number ofvirtual channels is very low even for large networks.

Routing lookups in hardware at memory access speeds

  • Pankaj GuptaSteven LinN. McKeown
  • Computer Science
    Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
This work presents a route lookup mechanism that when implemented in a pipelined fashion in hardware, can achieve one route lookup every memory access; much faster than current commercially available routing lookup schemes.

Myrinet: A Gigabit-per-Second Local Area Network

The Myrinet local area network employs the same technology used for packet communication and switching within massively parallel processors, but with the highest performance per unit cost of any current LAN.

The Quadrics Network: High-Performance Clustering Technology

The Quadrics network extends the native operating system in processing nodes with a network operating system and specialized hardware support in the network interface and provides network fault tolerance.

Congestion control

Congestion is an inherent problem for networks with multiple user access when the load exceeds what can be handled even with optimal routing, so window flow control and rate flow control schemes are discussed.

End-to-end congestion control for infiniband

  • J. R. SantosY. TurnerG. Janakiraman
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
This paper proposes an end-to-end congestion control scheme that avoids congestion spreading, delivers high throughput, and prevents flow starvation, and couples a simple switch-based ECN packet marking mechanism appropriate for typical SAN switches with small input buffers with source response mechanism that uses rate control combined with a window limit.

Congestion Control in IP/TCP Internetworks

Congestion control is a recognized problem in complex networks. We have discovered that the Department of Defense's Internet Protocol (IP), a pure datagram protocol, and Transmission Control Protocol…

A DC-Balanced, Partitioned-Block, 8B/10B Transmission Code

The proposed transmission code translates each source byte into a constrained 10-bit binary sequence which has excellent performance parameters near the theoretical limits for 8B/10B codes.

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels, which is used to develop deadlocked routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.

Credit-based flow control for ATM networks

The credit-based mechanism proposed by the authors provides flow control tailored to ATM networks that uses links efficiently, minimizes delay, and guarantees no cell loss due to congestion.