ci(srtla): parallelize compat-matrix pairs - #37
Merged
Conversation
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.
Affected repo & language: srtla — C / TypeScript
What
One commit delivering Wave 5 test-speed improvements for srtla:
Parallelize compat-matrix pairs (
ci(srtla): parallelize compat-matrix pairs): The independent sequential compat-matrix pairs are fanned out via the existing CI matrix mechanism. All 13/13 pairs still execute; none are dropped. The existingcompat-buildcomposite action (which predates the CI standard and must not be removed) is preserved.Why
The compat-matrix pairs were running sequentially despite having no inter-dependencies. Parallelizing them via the CI matrix fan-out cuts wall-clock by ~29% (357 s → ~254 s) with zero coverage loss.
How to verify
git grep -n '.omo' -- ':!.gitignore'returns nothing.Before/after timing evidence:
srtla/.omo/evidence/task-26-device-completeness-test-speed.txt.Risks
None. Parallelism is additive — the same test code runs, just concurrently. The composite action is untouched.