Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Benchmark and profile construction of ArrayBasedDirectedGraph and SharedArrayBasedDirectedGraph on large graphs #171

Open
pankajgupta opened this issue Mar 5, 2015 · 0 comments
Open

Benchmark and profile construction of ArrayBasedDirectedGraph and SharedArrayBasedDirectedGraph on large graphs #171

pankajgupta opened this issue Mar 5, 2015 · 0 comments
Labels
feature request

Comments

@pankajgupta
Copy link
Contributor

Add this benchmark to cassovary-benchmarks. Use artificially constructed random graphs with say 100 million nodes and 1 billion edges and use java heap size of 8GB to study performance and memory usage characteristics.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
feature request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@pankajgupta