Method and apparatus for load balancing in multi-level distributed computations
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
G06F-009/50
출원번호
US-0979112
(2010-12-27)
등록번호
US-8874747
(2014-10-28)
발명자
/ 주소
Boldyrev, Sergey
Laine, Hannu Ensio
Kaaja, Jari-Jukka Harald
Honkola, Jukka
Luukkala, Vesa-Veikko
Oliver, Ian Justin
출원인 / 주소
Nokia Corporation
대리인 / 주소
Ditthavong & Steiner, P.C.
인용정보
피인용 횟수 :
1인용 특허 :
5
초록▼
An approach is provided for providing load balancing in multi-level distributed computations. A distributed computation control platform determines closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a de
An approach is provided for providing load balancing in multi-level distributed computations. A distributed computation control platform determines closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level. The distributed computation control platform also determines functional flow information of the respective levels, one or more nodes of the respective levels, or a combination thereof with respect to at least one set of one or more computation closures. The distributed computation control platform further determines to cause, at least in part, processing at least the closure capability data, the functional flow information, or a combination thereof to determine: (a) a distribution of the one or more computation closures among the respective levels, (b) the one or more nodes, or (c) a combination thereof.
대표청구항▼
1. A method comprising: determining closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level, wherein the infrastructure level is part of a
1. A method comprising: determining closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level, wherein the infrastructure level is part of a communication network, each of the device level and the cloud computing level are connected to, but separate from the communication network, and the communication network includes the Internet;determining functional flow information of (i) the respective levels, (ii) one or more nodes of the respective levels, or (iii) a combination thereof with respect to at least one set of one or more computation closures; anddetermining to cause, at least in part, processing of at least the closure capability data, the functional flow information, or a combination thereof to determine a distribution of the one or more computation closures among the respective levels, the one or more nodes, or a combination thereof, whereinthe one or more computation closures correspond to one or more particular computation procedures to be performed. 2. A method of claim 1, wherein the processing of at least the closure capability data, the functional flow information, or a combination is further based, at least in part, on: (a) at least one cost function, (b) at least one computation migration rule, or (c) a combination thereof. 3. A method of claim 2, further comprising: processing the at least one cost function, the at least one computation migration rule, or a combination thereof to determine a cost value associated with at least a portion of the distribution of the one or more computation closures; anddetermining whether to initiate the distribution of the one or more computation closures based, at least in part, on a comparison of the cost value associated with the at least a portion of the distribution of the one or more computation closures against a threshold value. 4. A method of claim 1, further comprising: updating information associated with the closure capability data, the one or more computation closures, one or more executable states of the one or more computation closures, the functional flow information, or a combination thereof; andprocessing of at least the update information to determine a redistribution of the one or more computation closures among the respective levels, the one or more nodes, or a combination thereof. 5. A method of claim 4, wherein the redistribution includes, a least in part, a pause, an interruption, a resumption, an interaction, a termination, a rollback, or a combination thereof of at least a portion of the one or more computation closures. 6. A method of claim 1, further comprising: determining to cause, at least in part, retrieval of respective results of the one or more computation closures based, at least in part, on the distribution; andprocessing the respective results to generate an aggregated result. 7. A method of claim 1, wherein the distribution, the closure capability data, the functional flow information, an availability of at least a portion of the one or more computation closures at the respective levels, or a combination thereof are based, at least in part, on a service class information associated with at least one user of the at least one set of the one or more computation closures. 8. A method of claim 1, wherein the closure capability data includes, at least in part, data related to one or more computational branches, one or more computational elements, one or more resources, or a combination thereof associated with the respective levels, the one or more nodes, or a combination thereof. 9. A method of claim 1, wherein the processing of at least the closure capability data, the functional flow information, or a combination thereof is performed, at least in part, on traversal of at least one of the one or more computation closures from a first level of the respective levels to at least a second level of the respective levels, from a first node of the one or more nodes to at least a second node of the one or more nodes, or a combination thereof. 10. A method of claim 1, wherein the one or more computation closures include one or more static computation closures, one or more dynamic computation closures, or a combination thereof. 11. An apparatus comprising: at least one processor; andat 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, determine closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level, wherein the infrastructure level is part of a communication network, each of the device level and the cloud computing level are connected to, but separate from the communication network, and the communication network includes the Internet;determine functional flow information of the respective levels, (ii) one or more nodes of the respective levels, or (iii) a combination thereof with respect to at least one set of one or more computation closures; anddetermine to cause, at least in part, processing of at least the closure capability data, the functional flow information, or a combination thereof to determine a distribution of the one or more computation closures among the respective levels, the one or more nodes, or a combination thereof, whereinthe one or more computation closures correspond to one or more particular computation procedures to be performed. 12. An apparatus of claim 11, wherein the processing of at least the closure capability data, the functional flow information, or a combination is further based, at least in part, on: (a) at least one cost function, (b) at least one computation migration rule, or (c) a combination thereof. 13. An apparatus of claim 12, wherein the apparatus is further caused to: process the at least one cost function, the at least one computation migration rule, or a combination thereof to determine a cost value associated with at least a portion of the distribution of the one or more computation closures; anddetermine whether to initiate the distribution of the one or more computation closures based, at least in part, on a comparison of the cost value associated with the at least a portion of the distribution of the one or more computation closures against a threshold value. 14. An apparatus of claim 11, wherein the apparatus is further caused to: update information associated with the closure capability data, the one or more computation closures, one or more executable states of the one or more computation closures, the functional flow information, or a combination thereof; anddetermine a redistribution of the one or more computation closures among the respective levels, the one or more nodes, or a combination thereof. 15. An apparatus of claim 14, wherein the redistribution includes, a least in part, a pause, an interruption, a resumption, an interaction, a termination, a rollback, or a combination thereof of at least a portion of the one or more computation closures. 16. An apparatus of claim 11, wherein the apparatus is further caused to: determine to cause, at least in part, retrieval of respective results of the one or more computation closures based, at least in part, on the distribution; andprocess the respective results to generate an aggregated result. 17. An apparatus of claim 11, wherein the apparatus is further caused to: process service class information associated with at least one user of the at least one set of the one or more computation closures,wherein the distribution, the closure capability data, the functional flow information, an availability of at least a portion of the one or more computation closures at the respective levels, or a combination thereof are based, at least in part, on the service class information. 18. An apparatus of claim 11, wherein the closure capability data includes, at least in part, data related to one or more computational branches, one or more computational elements, one or more resources, or a combination thereof associated with the respective levels, the one or more nodes, or a combination thereof. 19. An apparatus of claim 11, wherein the processing of at least the closure capability data, the functional flow information, or a combination thereof is performed, at least in part, on traversal of at least one of the one or more computation closures from a first level of the respective levels to at least a second level of the respective levels, from a first node of the one or more nodes to at least a second node of the one or more nodes, or a combination thereof. 20. An apparatus of claim 11, wherein the device level includes a mobile phone further comprising: user interface circuitry and user interface software configured to facilitate user control of at least some functions of the mobile phone through use of a display and configured to respond to user input; anddisplay circuitry configured to display on the display at least a portion of a user interface of the mobile phone, the display and display circuitry configured to facilitate user control of at least some functions of the mobile phone.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (5)
Farkas,Keith Istvan; Ranganathan,Parthasarathy, Application management based on power consumption.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.