Designed algorithm for Spark Scala and GraphX Pregel API job which executed in multiple iterations until it parsed and partitioned the graph into a cluster of centroids based on nearest neighbors and Implemented in San Diego Supercomputer center (SDSC) cluster.
Designed algorithm for Spark Scala and GraphX Pregel API job which executed in multiple iterations until it parsed and partitioned the graph into a cluster of centroids based on nearest neighbors and Implemented in San Diego Supercomputer center (SDSC) cluster.
adityar003/A-Graph-Processing-Program-using-GraphX
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Designed algorithm for Spark Scala and GraphX Pregel API job which executed in multiple iterations until it parsed and partitioned the graph into a cluster of centroids based on nearest neighbors and Implemented in San Diego Supercomputer center (SDSC) cluster.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published