spcl / spcl/serverless-benchmarks
Improved Barabasi graphs for 501.graph-pagerank
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 199
- Forks
- 105
- PR merge metrics
- No merged PRs in 30d
Description
We have recently added a Node.js version of the 501.graph-pagerank benchmark in #314 PR. Python and C++ versions use igraph; ngraph used in Node.js does not have a Barabasi graph generation. We have a custom implementation, but it is not exactly the same as igraph version.
We should verify how the Node.js version performs, particularly at larger graphs. If the performance scales worse than igraph's version, then we should consider a rewrite that implements the same generation algorithm as igraph's prefix-sum trees.
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
Start with the Node.js 501.graph-pagerank benchmark and compare its Barabasi graph performance on larger graphs with the Python and C++ igraph versions. Done means documenting the scaling results and deciding whether a rewrite using igraph's prefix-sum tree algorithm is needed.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp, node.js, python
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100