mars-project / mars-project/mars
Optimize consecutive binary operands using tree reduction
Open
Nobody has claimed this yet.
mod: tensor
type: feature
- Dominant language
- Python
- Stars
- 2.7k
- Forks
- 325
- PR merge metrics
- No merged PRs in 30d
Description
Continuous arithmetic calculations like a + b + c + d can be optimized with tree reductions (i.e., TreeReduction(a, b, c, d) which makes operand tree more shallow and can be parallelized easier.
This may be implemented with
- operands for arithmetic tree reduction, and
- optimization strategy for continuous operands
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No files, tests, or entry points are named. Start by locating the existing TreeReduction implementation and the handling of consecutive arithmetic operands, then trace how an optimization strategy is selected. Done means continuous binary operands use the intended tree reduction and coverage verifies the optimization.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100