US 12,217,201 B2
Method and device for managing project by using data pointer
Min Woo Park, Seongnam-si (KR); Jeong Sik Jang, Seongnam-si (KR); Jung Ho Park, Seoul (KR); and Ji Won Choe, Seoul (KR)
Assigned to CROWDWORKS, INC., Seoul (KR)
Filed by CROWDWORKS, INC., Seoul (KR)
Filed on Jun. 22, 2022, as Appl. No. 17/846,790.
Claims priority of application No. 10-2021-0081192 (KR), filed on Jun. 22, 2021.
Prior Publication US 2022/0405678 A1, Dec. 22, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06Q 10/0631 (2023.01); G06Q 10/10 (2023.01); G06Q 10/0639 (2023.01)
CPC G06Q 10/06316 (2013.01) [G06Q 10/103 (2013.01); G06Q 10/06395 (2013.01)] 13 Claims
OG exemplary drawing
 
1. A project management method, which is performed by a project management device connected with task processing terminals via a network, the method comprising:
transmitting, via the network, source data of an n-th child project among a plurality of child projects connected in sequential order to a first task processing terminal, and requesting, via the network, the first task processing terminal to process the n-th child project, wherein ‘n’ is a natural number;
receiving, via the network, result data that is a processing result of the n-th child project from the first task processing terminal, in response to the request;
storing the result data of the n-th child project at a specific location in a hardware memory, and generating location information including an address value of the specific location;
recording the location information at a result pointer of the n-th child project by changing a value of the result pointer of the n-th child project from a garbage value or null value to an address value corresponding to the location information;
recording the location information at a source pointer of an (n+1)-th child project among a plurality of child projects by changing a value of the source pointer of the (n+1)-th child project from another garbage value or null value to the address value corresponding to the location information;
automatically obtaining the result data of the n-th child project, stored at the location indicated by the source pointer as source data of the (n+1)-th child project among the plurality of child projects, by using the result pointer of the n-th child project and the source pointer the (n+1)-th child project, which have the same location information;
transmitting, via the network, the source data of the (n+1)-th child project to a second task processing terminal, and requesting, via the network, the second task processing terminal to process the (n+1)-th child project,
wherein each of the plurality of child projects includes one or more tasks, and is divided depending on a type of a task included in each of the plurality of child projects,
wherein each of the tasks indicates a minimum unit task to be processed by a task processing terminal,
wherein, when the (n+1)-th child project is connected in parallel to a (n+2)-th child project among the plurality of child projects, the result data of the n-th child project is used as the source data of the (n+1)-th child project and source data of the (n+2)-th child project,
wherein the source pointer of the (n+1)-th child project and a source pointer of the (n+2)-th child project indicate one address in the memory, and
wherein the one address in the memory corresponds to the location information at which the result data of the n-th child project is stored; and
processing a cost payment for processing of the n-th child project to the first task processing terminal is after result data of the (n+1)-th child project is received from the second task processing terminal by the project management device; and
when the project management device receives a processing-impossibility selection for the (n+1)-th child project from the second task processing terminal, requesting, by the project management device, the first task processing terminal to re-process the n-th child project instead of the cost payment for the processing of the n-th child project.