Method and apparatus for distributing computation closures

• US 9,201,701 B2
• Filed: 05/16/2011
• Issued: 12/01/2015
• Est. Priority Date: 07/16/2010
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Technologies Oy (Nokia Corporation)
• Inventors: Boldyrev, Sergey, Mannermaa, Mika Juhani, Oliver, Ian Justin, Lassila, Ora, Dive-Reclus, Corinne, Pyhlammi, Seppo Juhani
• Primary Examiner(s): Lee, Tammy
• Application Number:
  US13/108,571
• Publication Number:
  US 20120072917A1
• Time in Patent Office: 1,660 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/5066 Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs mappping at compile time, see G06F8/451
• CPC Class Codes: G06F 9/5072 Grid computing
• 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

Abstract

An approach is provided for backend based computation closure oriented distributed computing. A computational processing support infrastructure receives a request for specifying one or more processes executing on a device for distribution over a computation space. The computational processing support infrastructure also causes, at least in part, serialization of the one or more processes as one or more closure primitives, the one or more closure primitives representing computation closures of the one or more processes. The computational processing support infrastructure further causes, at least in part, distribution of the one or more closure primitives over the computation space based, at least in part, on a cost function.

Claims

1. A method comprising:

receiving a request for specifying one or more processes executing on a device for distribution over a computation space;

causing, at least in part, serialization of the one or more processes as one or more closure primitives, the one or more closure primitives representing computation closures of the one or more processes;

causing, at least in part, distribution of the one or more closure primitives over the computation space based, at least in part, on a cost function;

verifying a consistency of the one or more closure primitives based, at least in part, on one or more communications from agents of one or more run-time environments in the computation space; and

upon verification of the consistency, reconstructing an execution context associated with the one or more processes and resuming execution of the one or more closure primitives representing computation closures of the one or more processes.

2. A method of claim 1, wherein the cost function is based, at least in part, on one or more resources of the device, the computation space, one or more other devices with access to the computation space, or a combination thereof.

3. A method of claim 2, wherein the one or more resources include power reserves, processing power, memory size, bandwidth, or a combination thereof.

4. A method of claim 2, further comprising:

causing, at least in part, optimization of the cost function with respect to scalability, load-balancing, or a combination thereof.

5. A method of claim 1, further comprising:

determining whether the device is a legacy device; and

causing, at least in part, wrapping of at least one of the one or more closure primitives with one or more legacy libraries based, at least in part, on the determination.

6. A method of claim 1, further comprising:

determining a time of execution of the one or more processes; and

causing, at least in part, tracing of the one or more processes, taking a snapshot of a current state of the one or more processes,

wherein the serialization of the one or more closure primitives is further based, at least in part, on the tracing, the snapshot, or a combination thereof.

7. A method of claim 1, further comprising:

determining a user context, an execution context, or a combination thereof associated with the one or more processes;

generating metadata based, at least in part, on the user context, the execution context, or a combination thereof; and

causing, at least in part, annotation of the one or more closure primitives with the metadata.

8. A method of claim 1,

wherein reconstructing the execution context comprises reconstructing the execution context associated with the one or more processes based, at least in part, on a content of the one or more computation closures, and

wherein the computation space comprises the device, one or more other devices, one or more servers, or a combination thereof, and wherein all or a portion of the one or more closures primitives are distributed to the device, the one or more other devices, the one or more servers, of a combination thereof for the reconstruction.

9. A method of claim 1, further comprising:

retrieving one or more lambda expressions corresponding to the one or more processes, the one or more lambda expressions defining one or more anonymous functions corresponding to the one or more processes,

wherein the one or more closure primitives are based, at least in part, on the one or more lambda expressions.

10. A method of claim 1, wherein the cost function is based on an execution state of the one or more processes associated with the request, and a cost evaluation of varying one or more closure primitive assignment and migration patterns of the one or more closure primitives.

11. An apparatus comprising:

at least one processor; and

at least one memory including computer program code for one or more programs,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,

receive a request for specifying one or more processes executing on a device for distribution over a computation space;

cause, at least in part, serialization of the one or more processes as one or more closure primitives, the one or more closure primitives representing computation closures of the one or more processes;

cause, at least in part, distribution of the one or more closure primitives over the computation space based, at least in part, on a cost function;

verify a consistency of the one or more closure primitives based, at least in part, on one or more communications from agents of one or more run-time environments in the computation space; and

upon verification of the consistency, reconstruct an execution context associated with the one or more processes and resume execution of the one or more closure primitives representing computation closures of the one or more processes.

12. An apparatus of claim 11, wherein the cost function is based, at least in part, on one or more resources of the device, the computation space, one or more other devices with access to the computation space, or a combination thereof.

13. An apparatus of claim 12, wherein the one or more resources include power reserves, processing power, memory size, bandwidth, or a combination thereof.

14. An apparatus of claim 12, wherein the apparatus is further caused to:

cause, at least in part, optimization of the cost function with respect to scalability, load-balancing, or a combination thereof.

15. An apparatus of claim 11, wherein the apparatus is further caused to:

determine whether the device is a legacy device; and

cause, at least in part, wrapping of at least one of the one or more closure primitives with one or more legacy libraries based, at least in part, on the determination.

16. An apparatus of claim 11, wherein the apparatus is further caused to:

determine a time of execution of the one or more processes; and

cause, at least in part, tracing of the one or more processes, taking a snapshot of a current state of the one or more processes,

wherein the serialization of the one or more closure primitives is further based, at least in part, on the tracing, the snapshot, or a combination thereof.

17. An apparatus of claim 11, wherein the apparatus is further caused to:

determine a user context, an execution context, or a combination thereof associated with the one or more processes;

generate metadata based, at least in part, on the user context, the execution context, or a combination thereof; and

cause, at least in part, annotation of the one or more closure primitives with the metadata.

18. An apparatus of claim 11, wherein the apparatus is further caused to:

Reconstruct the execution context by reconstructing the execution context associated with the one or more processes based, at least in part, on a content of the one or more computation closures,

wherein the computation space comprises the device, one or more other devices, one or more servers, or a combination thereof, and wherein all or a portion of the one or more closures primitives are distributed to the device, the one or more other devices, the one or more servers, of a combination thereof for the reconstruction.

19. An apparatus of claim 11, wherein the apparatus is further caused to:

retrieve one or more lambda expressions corresponding to the one or more processes, the one or more lambda expressions defining one or more anonymous functions corresponding to the one or more processes,

wherein the one or more closure primitives are based, at least in part, on the one or more lambda expressions.

20. An apparatus of claim 11, wherein the cost function is based on an execution state of the one or more processes associated with the request, and a cost evaluation of varying one or more closure primitive assignment and migration patterns of the one or more closure primitives.

21. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following steps:

receiving a request for specifying one or more processes executing on a device for distribution over a computation space;

causing, at least in part, serialization of the one or more processes as one or more closure primitives, the one or more closure primitives representing computation closures of the one or more processes;

causing, at least in part, distribution of the one or more closure primitives over the computation space based, at least in part, on a cost function;

verifying a consistency of the one or more closure primitives based, at least in part, on one or more communications from agents of one or more run-time environments in the computation space; and

upon verification of the consistency, reconstructing an execution context associated with the one or more processes and resuming execution of the one or more closure primitives representing computation closures of the one or more processes.

22. A non-transitory computer-readable storage medium of claim 21, further comprising:

reconstructing the execution context by reconstructing the execution context associated with the one or more processes based, at least in part, on a content of the one or more computation closures,

wherein the cost function is based, at least in part, on one or more resources of the device, the computation space, one or more other devices with access to the computation space, or a combination thereof.

23. A non-transitory computer-readable storage medium of claim 21, wherein the cost function is based on an execution state of the one or more processes associated with the request, and a cost evaluation of varying one or more closure primitive assignment and migration patterns of the one or more closure primitives.