Skip to content

Paper 087 / Stanford University

FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning

FlashAttention-2 reorganizes exact attention computation to improve accelerator occupancy, reduce non-matrix work, and parallelize more effectively across sequence length.

UPDATED 16 Jul 2026SOURCE-LED REVIEWRESEARCH REVIEW
01

Paper, researchers, and primary source

Inference, evaluation & serving / inference_kernels

FlashAttention-2 reorganizes exact attention computation to improve accelerator occupancy, reduce non-matrix work, and parallelize more effectively across sequence length.

CONTRIBUTION / 01

Contribution 1

Reduced synchronization and non-matrix floating-point operations in exact attention.

CONTRIBUTION / 02

Contribution 2

Improved sequence-dimension parallelism for small batch or head counts.

CONTRIBUTION / 03

Contribution 3

Changed thread-block work partitioning to raise GPU utilization.

02

Research context

inference_kernels / 2023

FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning places flashattention 2 inside the broader inference kernels discussion at Stanford University, with attention kernel supplying a second analytical lens. Read together, the source records three advances: Reduced synchronization and non-matrix floating-point operations in exact attention; Improved sequence-dimension parallelism for small batch or head counts; and Changed thread-block work partitioning to raise GPU utilization. Keeping those moves together prevents gpu from being detached from its evidence. For an implementation review, the relevant consequence is that kernel speedups vary by GPU generation, head dimension, sequence length, precision, and surrounding framework overhead.

03

Methods and evidence reading

1 cataloged method notes

METHOD / 01

Method 1

The experimental design in FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning tests reduced synchronization and non-matrix floating-point operations in exact attention and improved sequence-dimension parallelism for small batch or head counts against the paper's documented baselines, datasets, model variants, or systems workloads.

How to read the evidence

The evidentiary value of FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning comes from the relationship among its reported moves. Two entries define the method-level claim: Reduced synchronization and non-matrix floating-point operations in exact attention; and Improved sequence-dimension parallelism for small batch or head counts. The cataloged result is: Changed thread-block work partitioning to raise GPU utilization. On that basis, kernel speedups vary by GPU generation, head dimension, sequence length, precision, and surrounding framework overhead. The catalog nevertheless records that the empirical reach of FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning stops at accelerator hardware, comparison baselines, numerical precision, software revisions, request shapes, service-level objectives, and reported models; broader attention kernel use therefore requires fresh measurements. Reproduction work should separate genuine flashattention 2 transfer from behavior caused by a changed attention kernel setup. A new evaluation of FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning should disclose its flashattention 2 comparator, isolate attention kernel changes, and retain observations that qualify Improved sequence-dimension parallelism for small batch or head counts before deployment review.

04

Findings in the source record

1 paper-specific findings

  1. The reported evidence in FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning supports changed thread-block work partitioning to raise gpu utilization.
05

Practical implication for AI builders

Stanford University / 2023

06

Proposed BrokenGPT application

Research blueprint / proposed status

INTEGRATION POINT / 01

Proposed route placement / flashattention 2

For a proposed BrokenGPT experiment based on FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning, A/B the kernel with identical model outputs and request traces, measuring numerical error, time to first token, decode latency, memory, and unsupported shapes. Keep the flashattention 2 path isolated, versioned, and attributable to this research record.

VALIDATION METRIC / 02

Proposed acceptance test / attention kernel

Validate the proposed flashattention 2 route against the paper's reported outcome: Changed thread-block work partitioning to raise GPU utilization. Assess the proposed FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning route through memory traffic, numerical error, kernel latency, and shape coverage, and treat attention kernel failures as their own flashattention 2 decision input.

TRADEOFF / 03

Proposed decision boundary / gpu

Balance speed, portability, and implementation risk before promoting the proposed gpu design. Because A controlled transfer study must record tokenization, authentication, networking overhead, workload drift, failure recovery, and safety checks before the FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning finding can support an operational choice, adoption remains conditional on replay under BrokenGPT's selected model, runtime, and policy configuration.

07

Limitations, verification, and source

Boundaries recorded with the paper

Limitations

  • The empirical reach of FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning stops at accelerator hardware, comparison baselines, numerical precision, software revisions, request shapes, service-level objectives, and reported models; broader attention kernel use therefore requires fresh measurements.
  • A controlled transfer study must record tokenization, authentication, networking overhead, workload drift, failure recovery, and safety checks before the FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning finding can support an operational choice.

PRIMARY SOURCES

  1. 01
    FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning

    Stanford University — Primary primary arXiv paper / 17 July 2023 / Tri Dao

Related research reviews

View all 100 credited research papers

STRAIGHT ANSWERS

Frequently asked questions

01What does FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning study?

FlashAttention-2 reorganizes exact attention computation to improve accelerator occupancy, reduce non-matrix work, and parallelize more effectively across sequence length.

02Which methods does FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning use?

The experimental design in FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning tests reduced synchronization and non-matrix floating-point operations in exact attention and improved sequence-dimension parallelism for small batch or head counts against the paper's documented baselines, datasets, model variants, or systems workloads.

03What does FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning report?

The reported evidence in FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning supports changed thread-block work partitioning to raise gpu utilization.

04What is the proposed BrokenGPT application for FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning?

Proposed: A/B the kernel with identical model outputs and request traces, measuring numerical error, time to first token, decode latency, memory, and unsupported shapes.

INFERENCE, EVALUATION & SERVING / PAPER 087

Continue after FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning

After FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning, browse the full index for adjacent inference_kernels research and work from Stanford University.

Open the paper index