OFFLOADING GRAPH BASED COMPUTATIONS TO A BACKEND DEVICE

• US 20160205172A1
• Filed: 01/08/2015
• Published: 07/14/2016
• Est. Priority Date: 01/08/2015
• Status: Abandoned Application

• Current Assignee: Futurewei Technologies Incorporated (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: Futurewei Technologies Incorporated (Huawei Investment & Holding Co., Ltd.)
• Inventors: Chadha, Vineet, Shi, Guangyu, Palani, Gopinath
• Application Number:
  US14/592,664
• Publication Number:
  US 20160205172A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 2009/45562 Creating, deleting, cloning virtual machine instances
• CPC Class Codes: G06F 2009/4557 Distribution of virtual machine instances; Migration and load balancing
• CPC Class Codes: G06F 9/45558 Hypervisor-specific management and integration aspects
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

An apparatus is configured to perform a method for a graph based computation. The method includes receiving a procedural call from an application server, the procedural call comprising at least one primitive extended from a distributed file system (DFS) protocol. The method also includes initiating at least one virtual machine. The method further includes performing a graph based computation based on the procedural call using the at least one virtual machine. The method still further includes transmitting a result of the graph based computation to the application server.

Claims

1. A method for a graph based computation, the method comprising:

receiving a procedural call from an application server, the procedural call comprising at least one primitive extended from a distributed file system (DFS) protocol;

initiating at least one virtual machine;

performing a graph based computation based on the procedural call using the at least one virtual machine; and

transmitting a result of the graph based computation to the application server.

2. The method of claim 1, wherein the at least one primitive is extended from the NFS or CIFS protocol.

3. The method of claim 1, wherein the at least one primitive comprises at least one of:

graph_compute, graph_compute_save, graph_from, graph_add_edge, graph_del_edge, graph_add_vertex, or graph_del_vertex.

4. The method of claim 1, wherein the at least one virtual machine comprises a plurality of virtual machines, each virtual machine comprising a graph node associated with the graph based computation, wherein a message exchange between two of the virtual machines is associated with a graph edge associated with the graph based computation.

5. The method of claim 1, wherein the at least one virtual machine is a lightweight virtual machine initiated at a storage device.

6. The method of claim 5, wherein the storage device comprises a remote network attached storage (NAS) device configured to communicate with the application server over a network.

7. The method of claim 1, further comprising:

loading a kernel communication module to create an inter-process communication (IPC) channel between a kernel address space and a user address space and to forward the procedural call to a secured container associated with the at least one virtual machine.

8. An apparatus for a graph based computation, the apparatus comprising:

at least one memory; and

at least one processor coupled to the at least one memory, the at least one processor configured to;

receive a procedural call from an application server, the procedural call comprising at least one primitive extended from a distributed file system (DFS) protocol;

initiate at least one virtual machine;

perform a graph based computation based on the procedural call using the at least one virtual machine; and

transmit a result of the graph based computation to the application server.

9. The apparatus of claim 8, wherein the at least one primitive is extended from the NFS or CIFS protocol.

10. The apparatus of claim 8, wherein the at least one primitive comprises at least one of:

graph_compute, graph_compute_save, graph_from, graph_add_edge, graph_del_edge, graph_add_vertex, or graph_del_vertex.

11. The apparatus of claim 8, wherein the at least one virtual machine comprises a plurality of virtual machines, each virtual machine comprising a graph node associated with the graph based computation, wherein a message exchange between two of the virtual machines is associated with a graph edge associated with the graph based computation.

12. The apparatus of claim 8, wherein the at least one virtual machine is a lightweight virtual machine initiated at the apparatus.

13. The apparatus of claim 12, wherein the apparatus comprises a remote network attached storage (NAS) device configured to communicate with the application server over a network.

14. The apparatus of claim 8, wherein the at least one processor is further configured to:

load a kernel communication module to create an inter-process communication (IPC) channel between a kernel address space and a user address space and to forward the procedural call to a secured container associated with the at least one virtual machine.

15. A non-transitory computer readable medium embodying a computer program, the computer program comprising computer readable program code for:

receiving a procedural call from an application server, the procedural call comprising at least one primitive extended from a distributed file system (DFS) protocol;

initiating at least one virtual machine;

performing a graph based computation based on the procedural call using the at least one virtual machine; and

transmitting a result of the graph based computation to the application server.

16. The non-transitory computer readable medium of claim 15, wherein the at least one primitive is extended from the NFS or CIFS protocol.

17. The non-transitory computer readable medium of claim 15, wherein the at least one primitive comprises at least one of:

graph_compute, graph_compute_save, graph_from, graph_add_edge, graph_del_edge, graph_add_vertex, or graph_del_vertex.

18. The non-transitory computer readable medium of claim 15, wherein the at least one virtual machine comprises a plurality of virtual machines, each virtual machine comprising a graph node associated with the graph based computation, wherein a message exchange between two of the virtual machines is associated with a graph edge associated with the graph based computation.

19. The non-transitory computer readable medium of claim 15, wherein the at least one virtual machine is a lightweight virtual machine initiated at a storage device.

20. The non-transitory computer readable medium of claim 19, wherein the storage device comprises a remote network attached storage (NAS) device configured to communicate with the application server over a network.