| Stages of
Algorithm: Coarsening |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Task:
Create sequentially smaller graphs |
|||||||||||
| that make good
representation of original |
||||||||||||
| graph by
collapsing connected nodes. |
||||||||||||
| • | Issues: |
|||||||||||
| – | Minor concurrency
issues. |
|||||||||||
| – | Maintaining data
locality. |
|||||||||||
| – | Writing large
amount of data to memory in a |
|||||||||||
| scalable fashion. |
||||||||||||