TRUCKS KEEP RIGHT: Maximizing Efficiency with Fibre Channel Virtual Lanes
Abstract
In today's data-driven world, the demand for high-speed and reliable storage networks is constantly increasing. Fibre Channel (FC) has long been a preferred choice for storage area networks (SANs) due to its performance, scalability, and robustness. To meet the evolving needs of modern virtualized data centers, Fibre Channel introduced a groundbreaking feature known as Virtual Lanes (VLs), which allows for efficient resource utilization and enhanced Quality of Service (QoS).
This technical talk explores the architecture, functionality, and benefits of FC Virtual Lanes and calls on storage developers, architects, and designers to explore how the ability to divide a single physical Fibre Channel link into multiple virtual lanes can facilitate bandwidth allocation and allow for QoS enforcement for their workloads. The exploratory and technical talk will commence by explaining the fundamental concept of Virtual Lanes, illustrating how they enable the logical separation of traffic flows over a physical FC link and shed light on some of the early use cases that have emerged to enable prioritization and isolation of different traffic classes in a Storage Area Network. Furthermore, it will discuss the advantages offered by Virtual Lanes, including traffic segregation, enhanced throughput, reduced latency, and improved congestion control while avoiding head of line blocking. Throughout the talk, we will highlight real-world deployment scenarios and share best practices for configuring and managing Virtual Lanes - including the concepts of ER_RDY and VC_RDY as defined by FC switches. Come join the conversation to get insights into the power of Fibre Channel Virtual Lanes and the role they play in optimizing data transfer efficiency within SANs.
Related Sessions
Computational Storage
Closing the NVMe-CPCS Stack Gap: An End-to-End Implementation and Per-Workload Break-Even Characterization
The growth of AI and large-scale analytics workloads has made data movement a primary bottleneck of modern storage systems.Near-Data Processing (NDP) addresses this by executing portions of the workload close to where the data resides.
The protocol-level fragmentation that historically blocked NDP adoption has now closed.The SNIA Computational Storage Architecture and Programming Model, the SNIA Computational Storage API, and the NVMe Computational Programs (CP) and Subsystem Local Memory (SLM) command sets — all three now ratified — together define the architecture model, host-side programming interface, and wire protocol for compute offload to storage targets.
The remaining barrier is stack fragmentation.They define the interface but do not deliver an integrated implementation: no documented end-to-end open implementation has combined a SNIA CS API host library, a CP/SLM transport layer, and an NVMe-oF target for the CP/SLM command sets.Without it, break-even goes unmeasured, deployments unvalidated, and future CSD silicon has no conformant reference.
We close this gap with a two-layer reference stack.The host layer exposes the SNIA CS API to applications; the target layer handles CP/SLM commands as an NVMe-oF Computational Storage target.NVMe wire protocol connects them; either layer is replaceable at the protocol boundary without changing the other.
The host layer, libcs, implements the SNIA CS API.Compute requests dispatch via xNVMe (extended with CP/SLM support) over NVMe-oF TCP; transport and target details stay behind a pluggable backend.
The target layer, SPDK CPCS, runs on a JBOF CPU over NVMe-oF TCP; no specialized CSD silicon required.A virtual dispatch layer routes execution to built-in, eBPF, or passthrough runtimes under a single NVMe wire protocol.
We characterize per-workload break-even across aggregation, filtering, vector similarity, and compression by sweeping buffer size, selectivity, dimensionality, and input entropy, identifying per-workload thresholds at which target-side offload outperforms host-side execution end-to-end.
Our contribution is the first publicly described end-to-end NVMe-CPCS stack: libcs and SPDK CPCS connected via xNVMe, integrated on commodity hardware. The per-workload break-even methodology is reusable by any conforming NVMe-CPCS target, including future CSD silicon, without modifying the application layer above libcs.
Computational Storage
Leveraging CMB to Offload Memory Bandwidth for RDMA Direct Applications
High-performance SSDs use onboard DRAM for FTL tables and internal management with DRAM capacities increasing as SSD densities grow. As SSDs adopt newer DRAM technologies like DDR5, a large portion, often 40%-50%, of DRAM bandwidth remains underutilized by internal SSD operations. NVMe Controller Memory Buffer (CMB) and System Local Memory (SLM) features allow this unused DRAM bandwidth to be exposed to host applications. Leveraging CMB and SLM can unlock significant aggregate memory bandwidth across millions of SSDs in data centers, supporting high-performance workloads and new use cases. We'll discuss the architectural considerations and performance benefits of tapping into SSD DRAM bandwidth for enhanced resource efficiency in modern storage systems.
Computational Storage
Computation Offload Specification for AI Frameworks to Emit Partitioning Functions Alongside Large Data-centric Tasks
After surveying large-scale AI and HPC workloads, we have identified a set of principles and best practices widely used in partitioning large sparse tensors and graphs for parallel execution. We present these in the context of a roadmap for standardization of both Data and Compute offload from costly and power-hungry memory and compute tiers to NDP (near data processing) devices. Our work on standardizing partitioning operators will improve the portability and performance of the programming interface and protocol between AI framework backends that emit large tensor operations and the most power-efficient computational memory and storage devices that implement processing elements as low as subarray level and can only handle smaller chunks of data.
