Benchmark Suite Results

test results view

The MLPerf Storage benchmark suite measures how fast storage systems can supply training data when a model is being trained. Below is a short summary of the workloads and metrics from the latest round of benchmark results submissions. 


Results

MLCommons results are shown in an interactive table to enable you to explore the results. Choose a workload below to see its results. Every submission is shown in full: use the filters in the table to narrow by organization, division or availability, and select Show all metric columns to see every measured value rather than the summary set. Results can be downloaded from the toolbar at the bottom of the table.

Workload

Workloads

Each workload supported by MLPerf Storage is defined by a corresponding MLPerf Training benchmark. The following table summarizes the workloads in this version of the benchmark (the rules remain the official source of truth): 

AreaTaskModelNominal Dataset Latest Version Available
VisionMedical image segmentation3D U-NetKITS 2019 (602x512x512)v2.0
VisionImage classificationResNet50ImageNetv2.0
ScientificCosmology parameter predictionCosmoFlowCosmoFlow N-body simulationv2.0
LanguageLanguage processingBERT-largeWikipedia (2.5KB/sample)v0.5
CheckpointingPreserve forward progress in the face of infrastructure failures during TrainingLlama-3From 105GB at an 8B scale to 18TB at a 1T scale.v2.0

The dataset is referred to as a “nominal dataset” above because the MLPerf Storage benchmark simulates the above named real datasets using synthetically generated populations of files where the distribution of the size of the files matches the distribution in the real dataset. The size of the dataset used in each benchmark submission is automatically scaled to a size that prevents significant caching of the dataset in the systems actually running the benchmark code. 

Divisions

MLPerf aims to encourage innovation in software as well as hardware by allowing submitters to reimplement the reference implementations. There are two Divisions that allow different levels of flexibility during reimplementation:

  • The Closed division is intended to allow comparisons between storage systems in an “apples-to-apples” fashion and requires using a fixed set of benchmark tunables and options when running the benchmark. 
  • The Open division is intended to foster innovation, to show how performance could be increased if some changes were made. As a result, it allows using different data storage formats, access methods, tunables, and options. 
  • See the rules for specifics on what can be changed in each Division. 

Availability

MLPerf divides benchmark results into categories based on the availability of the storage solution: 

  • Available systems contain only components that are available for purchase or for rent in the cloud.
  • Preview systems must be submittable as Available in the next submission round. Ie: the code or h/w you used is on a path to being Available and will likely be Available within the next 6 to 9 months, it just hasn't quite gotten there yet.
  • Research, Development, or Internal (RDI) contain experimental, in development, or internal-use hardware or software. These may never be Available, either because they're a proof-of-concept, or you believe you'll need to change them before being released because you learned things, etc.

Submission Information

Not all of the below columns are part of every submission round.

Each row in the results table is a set of results produced by a single submitter using the same software stack and hardware platform. Each Closed division row contains the following information:

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M14 14.252V16.3414C13.3744 16.1203 12.7013 16 12 16C8.68629 16 6 18.6863 6 22H4C4 17.5817 7.58172 14 12 14C12.6906 14 13.3608 14.0875 14 14.252ZM12 13C8.685 13 6 10.315 6 7C6 3.685 8.685 1 12 1C15.315 1 18 3.685 18 7C18 10.315 15.315 13 12 13ZM12 11C14.21 11 16 9.21 16 7C16 4.79 14.21 3 12 3C9.79 3 8 4.79 8 7C8 9.21 9.79 11 12 11ZM18.5858 17L16.7574 15.1716L18.1716 13.7574L22.4142 18L18.1716 22.2426L16.7574 20.8284L18.5858 19H15V17H18.5858Zu0022u003eu003c/pathu003eu003c/svgu003e
    Submitter

    The organization that submitted the results.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M3 7H21V17H19V15H17V17H15V15H13V17H11V15H9V17H7V15H5V17H3V7ZM2 5C1.44772 5 1 5.44772 1 6V18C1 18.5523 1.44772 19 2 19H22C22.5523 19 23 18.5523 23 18V6C23 5.44772 22.5523 5 22 5H2ZM11 9H5V12H11V9ZM13 9H19V12H13V9Zu0022u003eu003c/pathu003eu003c/svgu003e
    Storage Protocol u0026 Software

    The technique the compute node(s) used to access the storage system (eg: which standard protocol or proprietary software) and the name and version of the software running the storage system.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M5 11H19V5H5V11ZM21 4V20C21 20.5523 20.5523 21 20 21H4C3.44772 21 3 20.5523 3 20V4C3 3.44772 3.44772 3 4 3H20C20.5523 3 21 3.44772 21 4ZM19 13H5V19H19V13ZM7 15H10V17H7V15ZM7 7H10V9H7V7Zu0022u003eu003c/pathu003eu003c/svgu003e
    System Name

    A general description or name of the system under test.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M4.50772 2.87597C4.57028 2.37554 4.99568 2 5.5 2H18.5C19.0043 2 19.4297 2.37554 19.4923 2.87597L20.9923 14.876C20.9974 14.9171 21 14.9585 21 15V21C21 21.5523 20.5523 22 20 22H4C3.44772 22 3 21.5523 3 21V15C3 14.9585 3.00258 14.9171 3.00772 14.876L4.50772 2.87597ZM6.38278 4L5.13278 14H18.8672L17.6172 4H6.38278ZM19 16H5V20H19V16ZM15 17H17V19H15V17ZM13 17H11V19H13V17Zu0022u003eu003c/pathu003eu003c/svgu003e
    Hardware

    A rough overview of the hardware used by the storage solution – at a minimum, the number of “storage controllers” and the type or technology of storage drives used by the solution.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M5 11H19V5H5V11ZM21 4V20C21 20.5523 20.5523 21 20 21H4C3.44772 21 3 20.5523 3 20V4C3 3.44772 3.44772 3 4 3H20C20.5523 3 21 3.44772 21 4ZM19 13H5V19H19V13ZM7 15H10V17H7V15ZM7 7H10V9H7V7Zu0022u003eu003c/pathu003eu003c/svgu003e
    System Type

    One of several categories that characterize the architecture, eg: local storage, parallel filesystem, software defined storage, etc.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M17.0001 12C17.5524 12 18.0001 12.4477 18.0001 13V22H16.0001V14H8.00015V22H6.00015V13C6.00015 12.4477 6.44786 12 7.00015 12H17.0001ZM12.0001 16V18H10.0001V16H12.0001ZM12.0001 6C14.3491 6 16.3827 7.34978 17.3678 9.31602L15.5787 10.2108C14.922 8.89991 13.5662 8 12.0001 8C10.4341 8 9.07833 8.89991 8.42163 10.2108L6.63247 9.31602C7.61755 7.34978 9.65122 6 12.0001 6ZM12.0001 2C15.9153 2 19.3049 4.24991 20.9466 7.5273L19.1576 8.42242C17.8443 5.80019 15.1325 4 12.0001 4C8.86783 4 6.15596 5.80019 4.84271 8.42242L3.05371 7.5273C4.69541 4.24991 8.08503 2 12.0001 2Zu0022u003eu003c/pathu003eu003c/svgu003e
    Networking

    A rough overview of the networking used by the storage solution to connect the compute node(s) to the storage system – at a minimum, the type and speed of the links.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M4 2H20C20.5523 2 21 2.44772 21 3V21C21 21.5523 20.5523 22 20 22H4C3.44772 22 3 21.5523 3 21V3C3 2.44772 3.44772 2 4 2ZM5 4V20H19V4H5ZM7 6H17V10H7V6ZM7 12H9V14H7V12ZM7 16H9V18H7V16ZM11 12H13V14H11V12ZM11 16H13V18H11V16ZM15 12H17V18H15V12Zu0022u003eu003c/pathu003eu003c/svgu003e
    Total Usable Capacity

    The amount of user data the solution can store.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M23 12L15.9289 19.0711L14.5147 17.6569L20.1716 12L14.5147 6.34317L15.9289 4.92896L23 12ZM3.82843 12L9.48528 17.6569L8.07107 19.0711L1 12L8.07107 4.92896L9.48528 6.34317L3.82843 12Zu0022u003eu003c/pathu003eu003c/svgu003e
    Number of Compute Nodes

    The number of compute nodes that ran the benchmark and accessed the storage.

  • u003csvg xmlns=u0022http://www.w3.org/2000/svgu0022 viewBox=u00220 0 24 24u0022 fill=u0022currentColoru0022u003eu003cpath d=u0022M20 13C20 15.2091 19.1046 17.2091 17.6569 18.6569L19.0711 20.0711C20.8807 18.2614 22 15.7614 22 13 22 7.47715 17.5228 3 12 3 6.47715 3 2 7.47715 2 13 2 15.7614 3.11929 18.2614 4.92893 20.0711L6.34315 18.6569C4.89543 17.2091 4 15.2091 4 13 4 8.58172 7.58172 5 12 5 16.4183 5 20 8.58172 20 13ZM15.293 8.29297 10.793 12.793 12.2072 14.2072 16.7072 9.70718 15.293 8.29297Zu0022u003eu003c/pathu003eu003c/svgu003e
    Simulated Accelerator Type

    The vendor and model number of accelerator that the benchmark was simulating during this test.

Each row in the results table contains the following information for each workload submitted: 

Throughput

This is the maximum performance the storage system was able to deliver while maintaining all the accelerator(s) at 90% utilization or above (ie: no more than 10% of the time were the accelerator(s) idle and waiting for the storage system to deliver data). It is reported as both “samples/second”, a metric that should be intuitively valuable to AI/ML practitioners, and as “MB/s”, a metric that should be intuitively valuable to storage practitioners.

Number of Simulated Accelerators

The number of simulated accelerators active during this test; ie: how many accelerators of the given type can this storage system keep busy.

Dataset Size

Since the dataset used in this test was synthesized and must be of a size to prevent significant caching of data in the compute node(s) running the benchmark, the size of the dataset used in this test is reported here.

Privacy Overview

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.