- Patent Title: Striping of directed graphs and nodes with improved functionality
-
Application No.: US15077852Application Date: 2016-03-22
-
Publication No.: US09805140B2Publication Date: 2017-10-31
- Inventor: Deepayan Chakrabarti , Jonathan Chang , Avery Li Kuang Ching , Maja Kabiljo
- Applicant: Facebook, Inc.
- Applicant Address: US CA Menlo Park
- Assignee: Facebook, Inc.
- Current Assignee: Facebook, Inc.
- Current Assignee Address: US CA Menlo Park
- Agency: Perkins Coie LLP
- Main IPC: G06F9/46
- IPC: G06F9/46 ; G06F17/30 ; H04L12/911 ; H04L29/06

Abstract:
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.
Public/Granted literature
- US20160203235A1 STRIPING OF DIRECTED GRAPHS AND NODES WITH IMPROVED FUNCTIONALITY Public/Granted day:2016-07-14
Information query