Patent ID: 11921786
Assignee: SAP SE
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 16:
17. The method of claim 16, wherein the partitioning of the graph includes partitioning, into a plurality of intervals, a plurality of vertices of the graph, wherein the partitioning of the graph further includes partitioning each interval of the plurality of intervals into a plurality of sub-intervals, wherein a size of each sub-interval of the plurality of sub-intervals corresponds to a size of a label scratch pad of each graph core, wherein the label scratch pad comprises an on-chip memory serving non-sequential read requests that occur during each iteration of the graph processing algorithm, wherein each graph core processes the one or more partitions by at least reading a partition specific interval of a vertex label array into the label scratch pad, reading vertex labels and pointers sequentially, reading a neighbors array of a current partition sequentially, placing a plurality of neighbor vertex identifiers in parallel through the crossbar to pass the plurality of neighbor vertex identifiers to a correct graph core, and retrieving, from the crossbar, a plurality of resulting neighbor vertex labels in an original order.