The implemention is shown in the figure below:
The kernel will do the following steps:
- Set Uram: Load the original cids of the graph and scan vertices to set URAM. If vertex’s cid is first appear, the flag on URAM will be writen true，otherwise the flag will be writen false.
- Lookup HBM: Lookup HBM to get new cid that have been writen success, put it into stream. If the cid haven’t writen success, the cid will be put a waiting buffer. The buffer is a first-in first-out circular cache and read it regularly.
- Updated HBM: Scan stream to get new cid and write back to HBM.