llvm/llvm-project
GitHub で見るImplement strategy for loop ordering choice (true compiler starter)
Open
#51,651 opened on 2021年10月25日
bugzillagood first issuemlir:tensor
Repository metrics
- Stars
- (26,378 stars)
- PR merge metrics
- (平均マージ 1d 2h) (30d で 1,000 merged PRs)
説明
| Bugzilla Link | 52309 |
| Version | unspecified |
| OS | Linux |
| CC | @joker-eph |
Extended Description
The sparse compiler uses a topsort to find a suitable loop ordering (following the sparse constraints always, and possibly adding in the dense constraints if this does not yield cycles). However, often we still have an ordering choice, and the way we currently go from conservative ordering to relaxed ordering can possibly be improved. The bug requests investigating and implementing a good strategy for picking a loop order.
Relevant code to start looking at:
Method computeIterationGraph() in https://github.com/llvm/llvm-project/blob/main/mlir/lib/Dialect/SparseTensor/Transforms/Sparsification.cpp