Parallelizing a Coarse Grain Graph Search Problem Based upon LDPC Codes on a Supercomputer.
Vivek S. NittoorReiji SudaPublished in: PARELEC (2011)
Keyphrases
- graph search
- ldpc codes
- coarse grain
- fine grain
- distributed memory
- message passing
- shared memory
- decoding algorithm
- massively parallel
- search algorithm
- search problems
- memory efficient
- heuristic search
- graph databases
- parallel computing
- parallel machines
- search methods
- shortest path
- parallel implementation
- belief propagation
- markov random field