Method and device for managing project by using cost payment time point setting

1. A project management method, which is performed by a project management device and which uses a setting of a cost payment time point, the method comprising:

transmitting 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 the first task processing terminal to process the n-th child project, wherein ‘n’ is a natural number;

receiving 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 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 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;

when the source data of the (n+1)-th child project is obtained, updating data attribute information related to the n-th child project or the (n+1)-th child project;

transmitting the source data of the (n+1)-th child project to a second task processing terminal and requesting the second task processing terminal to process the (n+1)-th child project; and

determining a cost payment for processing of the n-th child project to the first task processing terminal based on a response of the second task processing terminal to the request,

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 the automatically obtaining of the result data as the source data includes:

obtaining the result data of the n-th child project as the source data of the (n+1)-th child project by using at least one of a data pointer and data filtering,

wherein the updating of the data attribute information includes:

when obtaining the source data of the (n+1)-th child project by using the data pointer, updating pointer-related data attribute information; and

when obtaining the source data of the (n+1)-th child project by using the data filtering, updating filtering-related data attribute information,

wherein the pointer-related data attribute information includes a result pointer value of the n-th child project and a source pointer value of the (n+1)-th child project,

wherein the filtering-related data attribute information includes a filtering status of the n-th child project and a filter pass list,

wherein the determining of the cost payment includes:

selecting a processing-impossibility selection for the (n+1)-th child project from the second task processing terminal; and

requesting the first task processing terminal to re-process the n-th child project instead of a cost payment for the processing of the n-th child project.

2. The method of claim 1 , wherein, when obtaining the source data of the (n+1)-th child project by using the data pointer, the requesting of the first task processing terminal to re-process the n-th child project includes:

changing a source pointer value of the n-th child project included in the pointer-related data attribute information to a result pointer value of the n-th child project; and

transmitting the result data of the n-th child project stored at a location indicated by the changed source pointer value to the first task processing terminal and requesting the first task processing terminal to re-process the n-th child project.

3. The method of claim 1 , wherein, when obtaining the source data of the (n+1)-th child project by using the data filtering, the requesting of the first task processing terminal to re-process the n-th child project includes:

changing the filtering status of the n-th child project included in the filtering-related data attribute information from a true value to a false value, and excluding a filter ID related to the (n+1)-th child project from the filter pass list.

4. The method of claim 1 , further comprising:

transmitting result data re-processed by the first task processing terminal to the second task processing terminal selecting processing-impossibility and requesting the second task processing terminal to process the (n+1)-th child project again.

5. The method of claim 1 , wherein the determining of the cost payment includes:

receiving result data, which is processing result of the (n+1)-th child project, from the second task processing terminal; and

determining the cost payment for the processing of the n-th child project to the first task processing terminal.

6. The method of claim 1 , wherein the cost payment time point for the processing of the n-th child project is set in advance as a time point at which data attribute information related to the (n+1)-th child project is updated from a value indicating that the processing for the (n+1)-th child project is in progress, to a value indicating completion, and

wherein the data attribute information is updated as the plurality of child projects are processed depending on the order.

7. A non-transitory computer-readable recording medium storing a program combined with a computer being a piece of hardware to execute the method according to claim 1 .

8. A project management device using a setting of a cost payment time point, the project management device comprising:

a communication unit;

a memory including at least one process necessary for project management using the setting of the cost payment time point; and

a processor operating depending on the process,

wherein the processor is configured, based on the process, to:

transmit 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 request the first task processing terminal to process the n-th child project, wherein ‘n’ is a natural number;

receive result data that is a processing result of the n-th child project from the first task processing terminal, in response to the request;

store the result data at a specific location in a hardware memory, and generating location information including an address value of the specific location;

record 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;

record 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 obtain the result data 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;

when the source data of the (n+1)-th child project is obtained, update data attribute information related to the n-th child project or the (n+1)-th child project;

transmit the source data of the (n+1)-th child project to a second task processing terminal and request the second task processing terminal to process the (n+1)-th child project; and

determine a cost payment for processing of the n-th child project to the first task processing terminal based on a response of the second task processing terminal to the request,

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 the processor is further configured to:

obtain the result data of the n-th child project as the source data of the (n+1)-th child project by using at least one of a data pointer and data filtering;

when obtaining the source data of the (n+1)-th child project by using the data pointer, update pointer-related data attribute information; and

when obtaining the source data of the (n+1)-th child project by using the data filtering, update filtering-related data attribute information,

wherein the pointer-related data attribute information includes a result pointer value of the n-th child project and a source pointer value of the (n+1)-th child project,

wherein the filtering-related data attribute information includes a filtering status of the n-th child project and a filter pass list, and

wherein the processor is further configured to:

select a processing-impossibility selection for the (n+1)-th child project from the second task processing terminal; and

request the first task processing terminal to re-process the n-th child project instead of a cost payment for the processing of the n-th child project.