NVIDIA / NVIDIA/cudf

PDS-H Concurrency/Throughput Test

Open
#23,295 0 comments 0 reactions 0 assignees View on GitHub
cudf.polars feature request
Dominant language
C++
Stars
9.8k
Forks
1.1k
Avg merge
3d 6m
Merged PRs (30d)
278

Description

We've largely been running the power run for pdsh and pdsds: how fast can we execute the full suite QN->QM . TPC also has another testing scenario the `throughput` test.

The throughput test runs all 22 PDS-H queries concurrently across N independent streams, where each stream executes the full query set in a deterministic, spec-defined order (each stream gets a unique permutation of all queries) . Unlike the power test where queries run sequentially with full resource access, throughput streams share GPU resources and run simultaneously — measuring how many queries the engine can complete per hour under contention.

We should explore and build a test harness for running the throughput test

Contributor guide

Open the contributing guide

Research direction

Start by examining the existing power-run work for pdsh and pdsds, then review the TPC throughput-test requirements in this issue. Done means a harness runs all 22 PDS-H queries concurrently across N independent streams, gives each stream a deterministic unique query permutation, and measures queries completed per hour under contention.

Written by the indexing model from the issue text.

Assessment

Tech stack
cpp
Domain
performance, testing-qa
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Quiet
Clarity
Mostly clear
Newbie friendliness
45/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.