Document bounded optimization for repetitive work - #47335
Merged
Conversation
Co-authored-by: pelikhan <4175913+pelikhan@users.noreply.github.com>
Copilot created this pull request from a session on behalf of
pelikhan
July 22, 2026 14:44
View session
pelikhan
marked this pull request as ready for review
July 22, 2026 15:18
Contributor
There was a problem hiding this comment.
Pull request overview
Adds bounded, fair batch-processing guidance for large repetitive workloads.
Changes:
- Recommends budget-safe subsets with persistent rotation state.
- Adds bounded-work checks to timeout and token optimization plans.
Show a summary per file
| File | Description |
|---|---|
.github/aw/token-optimization.md |
Documents bounded backlog processing and continuity. |
.github/aw/optimize-agentic-workflow.md |
Adds bounded-work analysis to optimization guidance. |
Review details
Tip
Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
- Files reviewed: 2/2 changed files
- Comments generated: 2
- Review effort level: Medium
|
|
||
| ### Bound repetitive work to a manageable subset | ||
|
|
||
| Do not require one run to finish an unbounded backlog such as hundreds of lint violations. Set a per-run item, time, turn, or AI-credit budget and stop after a useful subset. Persist a compact cursor or processed-item set in `cache-memory` when stable state is available; otherwise use a deterministic heuristic such as file-path buckets, issue-number modulo, or oldest-first ordering. Rotate buckets round-robin across runs so every item eventually receives attention without repeatedly selecting the easiest items. |
| 2. Are there long-running tool calls that could be replaced with DataOps pre-steps? | ||
| 3. Is the prompt asking the agent to do too much in one run? | ||
| 4. Can `max-turns` or `timeout-minutes` be raised, or should the task be split? | ||
| 4. For a large repetitive backlog, can each run process a manageable subset selected with a cache cursor or deterministic round-robin heuristic? |
Contributor
|
🎉 This pull request is included in a new release. Release: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Large repetitive workloads can exhaust agent budgets before making durable progress. Optimization guidance should favor manageable subsets that advance fairly across runs.
Changes
Bounded execution
Fair work selection
cache-memory.Progress continuity