US 12,008,400 B2
Method and device for arranging schedule for computing task to server on basis of task dependency
Kisuk Kweon, Suwon-si (KR); Haneul Ko, Seoul (KR); Sangheon Pack, Seoul (KR); Jaewook Lee, Seoul (KR); Joonwoo Kim, Seoul (KR); and Yujin Tae, Seoul (KR)
Assigned to Samsung Electronics Co., Ltd., Suwon-si (KR); and Korea University Research And Business Foundation, Seoul (KR)
Appl. No. 17/309,183
Filed by Samsung Electronics Co., Ltd., Suwon-si (KR); and Korea University Research And Business Foundation, Seoul (KR)
PCT Filed Oct. 24, 2019, PCT No. PCT/KR2019/014040
§ 371(c)(1), (2) Date May 4, 2021,
PCT Pub. No. WO2020/096239, PCT Pub. Date May 14, 2020.
Claims priority of application No. 10-2018-0135343 (KR), filed on Nov. 6, 2018.
Prior Publication US 2021/0373947 A1, Dec. 2, 2021
Int. Cl. G06F 9/48 (2006.01); G06F 9/455 (2018.01); G06F 9/50 (2006.01)
CPC G06F 9/4881 (2013.01) [G06F 9/455 (2013.01); G06F 9/45558 (2013.01); G06F 9/48 (2013.01); G06F 9/4806 (2013.01); G06F 9/4843 (2013.01); G06F 9/50 (2013.01); G06F 9/5005 (2013.01); G06F 9/5027 (2013.01); G06F 9/5038 (2013.01); G06F 9/505 (2013.01); G06F 9/5066 (2013.01); G06F 2009/4557 (2013.01); G06F 2209/501 (2013.01)] 11 Claims
OG exemplary drawing
 
1. A control server for scheduling a computing task comprising a plurality of tasks to be performed by computation servers, the control server comprising:
a transceiver;
a memory; and
at least one processor configured to:
receive the computing task from a terminal,
generate a task dependency graph based on a dependency relationship of each of the plurality of tasks included in the computing task,
obtain computation processing capacity information of each of a plurality of computation servers and information of transmission latency between the plurality of computation servers,
schedule the plurality of tasks to be performed by at least two computation servers of the plurality of computation servers, based on the task dependency graph, the computation processing capacity information, and the information of transmission latency,
transmit, to the terminal, an execution result of the plurality of tasks received from at least one of the plurality of computation servers,
schedule the plurality of tasks to be performed by the at least two computation servers of the plurality of computation servers by allocating the plurality of tasks to the at least two computation servers and determining a time at which each of the plurality of tasks is to performed,
identify a computational complexity of each of the plurality of tasks, adjust the computational complexity of each of the plurality of tasks by converting at least one of the plurality of tasks into at least one sub-task, generate a spread task dependency graph according to a dependency relationship of each of the plurality of tasks whose computational complexities are adjusted, allocate the plurality of tasks to the at least two computation servers based on the spread task dependency graph, and
determine a time at which each of the plurality of tasks is to be performed based on the task dependency graph generated based on the dependency relationship of each of the plurality of tasks whose computational complexities are not adjusted.