mars-project / mars-project/mars
Optimize tileable graph using some planning rules
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 2.7k
- Forks
- 325
- PR merge metrics
- No merged PRs in 30d
Description
**Is your feature request related to a problem? Please describe.**
As described in #636, some optimization modules have been created now except 'tileable_graph',
we need do some work on coarse-grained graph optimization.
As a first step, we can apply some rules on the coarse-grained graph before tiles, predicate pushdown could be the first experimental rule.
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
Review issue #636 and the existing optimization modules first; this issue identifies tileable_graph and coarse-grained graph optimization as the area to investigate. The proposed first step is applying planning rules before tiling, with predicate pushdown as the first experimental rule. Done means the coarse-grained graph can use that initial rule.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- data-engineering, distributed-systems
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100