Memlet stride optimality overlay
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- JavaScript
- Stars
- 4
- Forks
- 10
- PR merge metrics
- No merged PRs in 30d
Description
An overlay for the global view, which highlights memlets in red, where the striding is suboptimal with respect to a given data layout.
E.g.:
with A = int[N, N]:
for i in range(N):
for j in range(N):
A[i, j] += A[j, i]
One of the memlets in the resulting map accesses a contiguous dimension, and one does not.
Contributor guide
No contributing guide indexed for this repository
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
Start by locating the global view and the code that renders memlets in this web client. Use the A[i, j] and A[j, i] example to determine how contiguous and non-contiguous accesses are represented. Done means the global view highlights memlets with suboptimal strides in red for a given data layout.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- data-visualization, frontend
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 42/100