MIOV: Reordering MOVI for even better locality
Peter Pere\v{s}\'ini, Nathaniel K. Brown, Travis Gagie, Ben, Langmead
TL;DR
This paper proposes a reordering technique for Nishimoto and Tabei's move structure to improve memory locality by increasing sequential row access, potentially enhancing algorithm performance.
Contribution
It introduces a novel reordering method for move structures that optimizes memory access patterns, improving locality in data processing.
Findings
Enhanced memory locality observed in reordered structures
Potential performance gains in algorithms using move structures
Reordering method applicable to similar data structures
Abstract
We consider how to reorder the rows of Nishimoto and Tabei's move structure such that we more often move from one row to the next in memory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIndustrial Vision Systems and Defect Detection