What files does it need?

[thu-pacman]

What files does it need?

[bibrakc]

Thanks for that!
Ok so what I did is that I wrote a simple C program that reads from the graph an ASCII file and writes it into a binary file, as required by Gemini.

Here is that code: here
The file src/ASCII2Bin.c contains the converter
The file data/scale16_s.mm is the input to it, it has 65535 vertices and 1818848 edges

When I run: mpirun -n 1 ./sssp ./scale16_s.bin 65535 39

It seems to estimate the number of edges correctly. Further it gives the following output and halts with this error message:

thread support level provided by MPI: MPI_THREAD_SERIALIZED
thread-0 bound to socket-0
thread-3 bound to socket-0
thread-2 bound to socket-0
thread-1 bound to socket-0
threads=1*4
interleave on 0
|V| = 65535, |E| = 1818848
|V'_0| = 65535 |E^dense_0| = 1818761
|V'_0_0| = 65535 |E^dense_0_0| = 1818761
sssp: /home/user/codes/GeminiGraph-master/core/graph.hpp:336: int Graph::get_partition_id(VertexId) [with EdgeData = float; VertexId = unsigned int]: Assertion `false' failed.
[mypc:22558] *** Process received signal ***
[mypc:22558] Signal: Aborted (6)
[mypc:22558] Signal code: (-6)
[mypc:22558] [ 0] /lib/x86_64-linux-gnu/libpthread.so.0(+0x10330)[0x7f3e91e51330]
[mypc:22558] [ 1] /lib/x86_64-linux-gnu/libc.so.6(gsignal+0x37)[0x7f3e91ab2c37]
[mypc:22558] [ 2] /lib/x86_64-linux-gnu/libc.so.6(abort+0x148)[0x7f3e91ab6028]
[mypc:22558] [ 3] /lib/x86_64-linux-gnu/libc.so.6(+0x2fbf6)[0x7f3e91aabbf6]
[mypc:22558] [ 4] /lib/x86_64-linux-gnu/libc.so.6(+0x2fca2)[0x7f3e91aabca2]
[mypc:22558] [ 5] ./sssp[0x4125bc]
[mypc:22558] [ 6] ./sssp[0x409b5d]
[mypc:22558] [ 7] /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xf5)[0x7f3e91a9df45]
[mypc:22558] [ 8] ./sssp[0x409cef]
[mypc:22558] *** End of error message ***

mpirun noticed that process rank 0 with PID 22558 on node tulip exited on signal 6 (Aborted).

[coolerzxw]

Hi. Since your downloaded file is in WebGraph format, you need to write a program using the WebGraph library to decode the downloaded data and write out the edges in binary (i.e. each edge consists of two 32-bit integers representing source and destination, and an optional weight if you need to run algorithms on a weighted graph). Note that the byte orders of Java and C++ programs on your machine may be different (big-endians vs. little-endians) so you might need to pay attention to that.

[coolerzxw]

Hi, we assume the vertices are numbered from 0. So you need to replace 65535 with 65536 as the number of vertices and then it should work.

[bibrakc]

That helps!

I changed the code to do a decrement of vertex ids when I read them from the file, so it offsets it. The file that I am using starts from index 1 not 0.