Striping of directed graphs and nodes with improved functionality

Embodiments are disclosed for striping a directed graph, e.g., a social graph, so as to efficiently perform an operation to each node in the directed graph. At least some of the embodiments can select first and second sets of nodes from the directed graph to form first and second stripes. The first...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Chakrabarti Deepayan, Kabiljo Maja, Ching Avery Li Kuang, Chang Jonathan
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTING COUNTING ELECTRIC COMMUNICATION TECHNIQUE ELECTRIC DIGITAL DATA PROCESSING ELECTRICITY PHYSICS TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Embodiments are disclosed for striping a directed graph, e.g., a social graph, so as to efficiently perform an operation to each node in the directed graph. At least some of the embodiments can select first and second sets of nodes from the directed graph to form first and second stripes. The first and second sets of nodes are selected, for example, based on available computing resources. First and second intermediate results can be generated by performing the operation to each node of the first and the second stripes, respectively. The operation iteratively performs a superstep. The first and the second intermediate results are combined to form a collective result as an output of the superstep.