Skip to main content
Challenge

Build a Continuous Batching Prompt Interruption and Rescheduling Replayer

Simulate client request preemption in open-weight continuous batching runtimes like vLLM. Hosted Claude analyzes prompt arrival bursts and calculates optimal rescheduling queues.

EngineeringHosted by Vera
Challenge brief

What you are building

The core problem, expected build, and operating context for this challenge.

Simulate client request preemption in open-weight continuous batching runtimes like vLLM. Hosted Claude analyzes prompt arrival bursts and calculates optimal rescheduling queues.

AI Serving Systems Engineer

Simulate bursty incoming prompt arrival streams and sudden inference worker preemption signals.

Evaluate interrupted continuous batching states to measure evicted prompt prefixes and chunked prefills.

Send normalized batch execution metrics to hosted Claude to optimize queue re-insertion priorities.

Render a simulated scheduling queue highlighting predicted completion latency and service-level violations.

Terminal dashboard showing active continuous batch slots, queue re-prioritizations, and latency gauges.

Generate synthetic JSON request logs containing arrival timestamps, prompt token counts, and simulated preemption events. Starter examples below are synthetic. They are not downloaded records.

vLLM open-model serving Adopts continuous batching, chunked prefill, and prefix caching principles from vLLM runtime documentation.

dspy, anthropic, pydantic, pandas. DSPy compiles robust prompt optimization pipelines for structured continuous batch queue scheduling decisions. Hosted Claude API for prompt scheduling optimization and reasoning over request priorities.

Submit runnable source, pinned dependencies, setup commands, a working interface, example outputs, and a recorded end-to-end demo. Include tests and an action log.

Computes prefix caching token reuse for re-queued prompts without loss.

Generates rescheduling order that prioritizes near-completion batches within simulated SLA boundaries.

Detects request starvation for low-priority long-context jobs after three consecutive preemption cycles.

```json [ { "input": { "batch_capacity": 4, "interrupted_requests": [ { "req_id": "req-101", "tokens_processed": 512, "tokens_remaining": 16, "sla_budget_ms": 150 }, { "req_id": "req-102", "tokens_processed": 64, "tokens_remaining": 400, "sla_budget_ms": 1200 } ] }, "expected_output": { "rescheduled_queue": [ "req-101", "req-102" ], "prefix_cache_savings_tokens": 576, "sla_violation_projected": false } }, { "input": { "batch_capacity": 1, "interrupted_requests": [ { "req_id": "req-201", "tokens_processed": 4096, "tokens_remaining": 2048, "sla_budget_ms": 100 } ] }, "expected_output": { "rescheduled_queue": [ "req-201" ], "prefix_cache_savings_tokens": 4096, "sla_violation_projected": true } } ] ```

Simulation harness only. Operates purely on synthetic workload records without modifying production serving instances. Use mock external writes. Require human review before any real deployment.

Rules

Participation guide

Simulation harness only. Operates purely on synthetic workload records without modifying production serving instances. Use mock external writes and human review.

Delivery guide

How work is evaluated

Evaluation

Computes prefix caching token reuse for re-queued prompts without loss. Generates rescheduling order that prioritizes near-completion batches within simulated SLA boundaries. Detects request starvation for low-priority long-context jobs after three consecutive preemption cycles.

Submission format

Runnable source, pinned dependencies, setup commands, working interface, example outputs, recorded demo, tests, and action logs.

Datasets

Challenge datasets

Public datasets, plus the private datasets you have access to.

Evaluation rubric

How submissions are scored

These dimensions define what the evaluator checks and which criteria separate a passable run from a strong one.

Dimensions
4 scoring checks
Binary
1 pass or fail dimensions
Ordinal
3 scaled dimensions
Dimension 1

Complete workflow

Simulate bursty incoming prompt arrival streams and sudden inference worker preemption signals. Evaluate interrupted continuous batching states to measure evicted prompt prefixes and chunked prefills. Send normalized batch execution metrics to hosted Claude to optimize queue re-insertion priorities. Render a simulated scheduling queue highlighting predicted completion latency and service-level violations.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 2

Correctness and evidence

Computes prefix caching token reuse for re-queued prompts without loss. Generates rescheduling order that prioritizes near-completion batches within simulated SLA boundaries. Detects request starvation for low-priority long-context jobs after three consecutive preemption cycles.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 3

Review interface

Terminal dashboard showing active continuous batch slots, queue re-prioritizations, and latency gauges.

Score scale
012
Score 0

Missing or incorrect.

Score 1

Partly complete, with documented gaps.

Score 2

Complete, with reproducible evidence.

Dimension 4

Safe execution

Simulation harness only. Operates purely on synthetic workload records without modifying production serving instances.

Binary check

This dimension contributes its full weight only when the submission satisfies the requirement. Partial credit is not awarded.

Learning goals

What you should walk away with

  • Simulate bursty incoming prompt arrival streams and sudden inference worker preemption signals.

  • Evaluate interrupted continuous batching states to measure evicted prompt prefixes and chunked prefills.

  • Send normalized batch execution metrics to hosted Claude to optimize queue re-insertion priorities.

  • Render a simulated scheduling queue highlighting predicted completion latency and service-level violations.

Resources and assets

Reference links and supporting material

Dataset notes

Generate synthetic JSON request logs containing arrival timestamps, prompt token counts, and simulated preemption events. Supplied starter examples are synthetic, not source extracts.

Challenge setup

Configuration summary for this challenge.

Challenge input

Input details are not configured.

DSPy

Prompt and LM program optimization framework.

Evaluated output

No output checks are configured.

Evaluation checks
  • Simulate bursty incoming prompt arrival streams and sudden inference worker preemption signals. Evaluate in...
  • Computes prefix caching token reuse for re-queued prompts without loss. Generates rescheduling order that p...
  • Terminal dashboard showing active continuous batch slots, queue re-prioritizations, and latency gauges.
Configured evaluation evidence
  • 2 public reference cases
Configured runtime
  • 3 configured tools

Summary shows the first task, up to three tools, and up to three evidence items. Open the technical recipe to view all configured items.

View technical recipe

Configured tools

Action Space
  • DSPy · Optional
Training Infra
  • DSPy · Optional
Orchestration
  • DSPy · Optional

Evaluation contract

  • Complete workflow · Weight 40
  • Correctness and evidence · Weight 30
  • Review interface · Weight 20
  • Safe execution · Weight 10

Reference cases

  • 2 public reference cases

Workflow tasks

No workflow tasks are configured.

Recipe freeze marker

No recipe freeze time is recorded.

Frequently Asked Questions about Build a Continuous Batching Prompt Interruption and Rescheduling Replayer