Skip to content

Conversation

lingfanyu
Copy link
Contributor

@lingfanyu lingfanyu commented Feb 14, 2025

When performing attention computation on RaggedTensor (i.e. a batch of variable-length sequences), we view the batch as one flattened sequence in which original sequences are concatenated along sequence dimension. When performing attention on this flattened sequence, attention that belongs to original sequences happens along the block-diagonal.

Therefore, we have developed a BlockSparse version of flash paged attention to minimize wasted computation. This PR contains two parts:

  • An execution planner that takes prompt and context lengths of each request to analyze sparsity and produces an execution plan
  • A NKI kernel that accepts the blocksparse plan and performs execution

This PR depends on PR #13245 and #13455 .

@liangfu

Copy link

👋 Hi! Thank you for contributing to the vLLM project.

💬 Join our developer Slack at https://slack.vllm.ai to discuss your PR in #pr-reviews, coordinate on features in #feat- channels, or join special interest groups in #sig- channels.

Just a reminder: PRs would not trigger full CI run by default. Instead, it would only run fastcheck CI which starts running only a small and essential subset of CI tests to quickly catch errors. You can run other CI tests on top of those by going to your fastcheck build on Buildkite UI (linked in the PR checks section) and unblock them. If you do not have permission to unblock, ping simon-mo or khluu to add you in our Buildkite org.

Once the PR is approved and ready to go, your PR reviewer(s) can run CI to test the changes comprehensively before merging.

To run CI, PR reviewers can either: Add ready label to the PR or enable auto-merge.

🚀

@lingfanyu lingfanyu changed the title [Neuron][Kernel] NKI Flash PagedAttention with a BlockSparse Execution Plan [Neuron][Kernel] NKI Flash PagedAttention with BlockSparse Execution Plan Feb 14, 2025
Copy link

mergify bot commented Mar 21, 2025

This pull request has merge conflicts that must be resolved before it can be
merged. Please rebase the PR, @lingfanyu.

https://docs.github.com/en/pull-requests/collaborating-with-pull-requests/working-with-forks/syncing-a-fork

@mergify mergify bot added the needs-rebase label Mar 21, 2025
self.tile_size_kv = tile_size_kv
self.block_size = block_size

def plan(self):
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Questions:

  1. I suppose this is meant to be amortized for entire forward pass?
  2. The logic is quite involved, so I wonder what is the range of wallclock time for this function call for reasonable batch size (e.g. 128) - is it in us range?

def get_active_block_tables(block_tables, query_lens, seq_lens, block_size,
num_blocks):
context_lens = seq_lens - query_lens
blocks_per_seq = (context_lens + block_size - 1) // block_size
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
blocks_per_seq = (context_lens + block_size - 1) // block_size
blocks_per_seq = (context_lens + (block_size - 1)) // block_size

Reduce vectorized (e.g. torch) op dispatch

@lingfanyu lingfanyu closed this Jun 9, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants