KR102073029B1 - Apparatus and method for assigning task, apparatus and method for requesting reallocation of task - Google Patents

Abstract

Disclosed are a task assigning apparatus and method, and a task reassignment requesting apparatus and method. The task assigning apparatus, which is included in a master node, according to an embodiment of the present invention comprises: a task generation part dividing a job assigned to the master node to generate a plurality of tasks; and a task assignment part assigning the plurality of tasks to a plurality of slave nodes based on performance information, a battery level, and a battery consumption rate for each of the plurality of slave nodes connected with the master node through a network.

Description

Task assignment device and method, task reassignment request device and method {APPARATUS AND METHOD FOR ASSIGNING TASK, APPARATUS AND METHOD FOR REQUESTING REALLOCATION OF TASK}

The disclosed embodiments relate to task assignment or reassignment techniques.

Recently, with the rapid growth of IT technology, various researches related to IoT technology are being conducted. IoT devices such as smartphones are small in size and have various sensors and functions to increase user's work efficiency, mobility, and location convenience.These IoT devices are augmented reality due to limited computing power, storage capacity, and battery capacity. There is a limit in operating an application that requires big data processing, such as an application that provides (AR) or virtual reality (VR) service.

As application functions become more complex and powerful, various researches are being conducted for computing offloading of IoT devices to operate various applications quickly with IoT devices with the above constraints. Computing offloading means that one computing device uses the computing resources of another computing device. For example, one computing device entrusts a particular calculation or operation to another computing device and receives the result.

In this case, in order for one computing device to quickly return a result for a specific calculation or operation, it is desirable to use computing resources of another computing device having good computing power and large storage capacity. However, if another computing device supporting the computing resource is turned off due to the battery being depleted during a particular calculation or operation, the calculation or operation must be delegated to another computing device to perform the operation again. The time it takes to increase.

In order to prevent such a problem, a method of entrusting a calculation or a calculation may be considered in consideration of the remaining battery power of computing devices that initially provide computing resources. However, the remaining battery charge does not mean the time until the batteries are exhausted. For example, the battery consumption rate may vary depending on the specifications of the battery included in the computing device, the degree of aging of the battery, whether the battery is being charged, the running application, and the like, and thus, even when the battery is small, the battery consumption may be reduced. The time may be long and the time until the battery is exhausted may be short even if the battery level is large.

In addition, even if the computing device entrusts a particular calculation or operation in consideration of the battery consumption rate of another computing device, the battery consumption rate after charging depends on whether the battery of the computing device providing the computing resource is being charged or the running application. It may increase compared to the battery consumption rate at the time of charging. In such a case, a computing device supporting a computing resource may run out of battery power during a particular calculation or operation, and the power may be cut off. In this case, the calculation or operation should be delegated to another computing device to perform it again. The time required for the operation of the application is increased.

Disclosed embodiments are to provide a task assignment apparatus and method or a task reassignment request apparatus and method.

According to the disclosed embodiments, a task allocation apparatus included in a master node, the apparatus comprising: a task generator for generating a plurality of tasks by dividing a job assigned to the master node; And a task allocator configured to allocate the plurality of tasks to the plurality of slave nodes based on performance information, battery remaining amount, and battery consumption rate of each of the plurality of slave nodes connected through the network with the master node. Is provided.

The performance information may include at least one of information on a processor, a memory, and a storage space for each of the plurality of slave nodes.

The task allocator may select one or more candidate slave nodes among the plurality of slave nodes based on the performance information and the battery remaining amount, and based on a battery consumption rate of each of the selected one or more candidate slave nodes. May be allocated to the selected one or more candidate slave nodes.

The task allocator may allocate the plurality of tasks to a slave node having the minimum battery consumption rate among the selected one or more candidate slave nodes.

When the task allocator receives a request for reassignment of a task from one of the plurality of slave nodes, the slave requesting the reassignment of the task to the task that is requested to be reassigned based on the performance information, battery level, and battery consumption rate. You can reassign one of the remaining slave nodes except the node.

According to other disclosed embodiments, a task assignment method performed in a task assignment apparatus included in a master node, the method comprising: generating a plurality of tasks by dividing a job allocated to the master node; And allocating the plurality of tasks to the plurality of slave nodes based on performance information, battery level, and battery consumption rate of each of the plurality of slave nodes connected through the network with the master node. Is provided.

The performance information may include at least one of information on a processor, a memory, and a storage space for each of the plurality of slave nodes.

Assigning the plurality of tasks to the plurality of slave nodes comprises: selecting one or more candidate slave nodes of the plurality of slave nodes based on the performance information and the battery remaining amount; And assigning the plurality of tasks to the selected one or more candidate slave nodes based on a battery consumption rate for each of the selected one or more candidate slave nodes.

The operation of assigning the plurality of tasks to the candidate slave node may assign the plurality of tasks to a slave node having the minimum battery consumption rate among the selected one or more candidate slave nodes.

When a task reassignment is requested from one of the plurality of slave nodes, the remaining slaves other than the slave node requesting the reassignment of the task may be assigned to the task based on the performance information, battery level, and battery consumption rate. The method may further include reassigning one of the nodes.

According to another embodiment of the present disclosure, a task reassignment request apparatus included in a slave node, the apparatus comprising: a task receiver configured to allocate a task from a master node; A determination unit that determines whether the task can be performed based on the remaining battery capacity of the slave node and the amount of battery required for the task; And a task reassignment request unit for requesting reassignment of the task to the master node when it is determined that the task cannot be performed.

The determination unit may determine that the task cannot be performed when the battery level of the slave node is less than the battery amount required for the task.

According to another embodiment of the present disclosure, a task reassignment request method performed in a task reassignment request apparatus included in a slave node, the method comprising: receiving a task from a master node; Determining whether the task can be performed based on a battery level of the slave node and a battery amount required for the task; And requesting reassignment of the task to the master node when it is determined that the task is impossible to perform.

The operation of determining whether the task can be performed may include determining that the task cannot be performed when the remaining battery capacity of the slave node is smaller than the battery amount required for the task.

According to the disclosed embodiments, the task is allocated to the slave node by additionally considering the battery consumption rate in addition to the performance information and the battery level of each slave node, so that the task of the task reassignment that the battery of the slave node may be discharged and consumed may be performed. The increase in processing time can be prevented.

According to the disclosed embodiments, the task reassignment request device determines whether to request the reallocation of the task based on the amount of battery required for the execution of the task calculated in consideration of the battery consumption rate, so that the battery of the slave node is discharged. This reduces work processing time due to task reassignment that may be required.

1 is a block diagram of a task assignment system according to an embodiment.
2 is a block diagram of a task allocating apparatus according to an exemplary embodiment.
3 is a block diagram of an apparatus for reassigning a task, according to an exemplary embodiment.
4 is a flowchart of a task assigning method according to an exemplary embodiment.
5 is a flowchart of a task reassignment request method according to an embodiment.
6 is a block diagram illustrating and describing a computing environment including a computing device suitable for use in example embodiments.

Hereinafter, specific embodiments of the present invention will be described with reference to the drawings. The following detailed description is provided to assist in a comprehensive understanding of the methods, devices, and / or systems described herein. However, this is only an example and the present invention is not limited thereto.

In describing the embodiments of the present invention, when it is determined that the detailed description of the known technology related to the present invention may unnecessarily obscure the gist of the present invention, the detailed description thereof will be omitted. In addition, terms to be described below are terms defined in consideration of functions in the present invention, which may vary according to intention or custom of a user or an operator. Therefore, the definition should be made based on the contents throughout the specification. The terminology used in the description is for the purpose of describing embodiments of the invention only and should not be limiting. Unless expressly used otherwise, the singular forms “a,” “an,” and “the” include plural forms of meaning. In this description, expressions such as "comprises" or "equipment" are intended to indicate certain features, numbers, steps, actions, elements, portions, or combinations thereof, and one or more than those described. It should not be construed to exclude the presence or possibility of other features, numbers, steps, actions, elements, portions or combinations thereof.

Hereinafter, specific embodiments of the present invention will be described with reference to the drawings. The following detailed description is provided to assist in a comprehensive understanding of the methods, devices, and / or systems described herein. However, this is only an example and the present invention is not limited thereto.

In describing the embodiments of the present invention, when it is determined that the detailed description of the known technology related to the present invention may unnecessarily obscure the gist of the present invention, the detailed description thereof will be omitted. In addition, terms to be described below are terms defined in consideration of functions in the present invention, which may vary according to intention or custom of a user or an operator. Therefore, the definition should be made based on the contents throughout the specification. The terminology used in the description is for the purpose of describing embodiments of the invention only and should not be limiting. Unless expressly used otherwise, the singular forms “a,” “an,” and “the” include plural forms of meaning. In this description, expressions such as "comprises" or "equipment" are intended to indicate certain features, numbers, steps, actions, elements, portions, or combinations thereof, and one or more than those described. It should not be construed to exclude the presence or possibility of other features, numbers, steps, actions, elements, portions or combinations thereof.

1 is a block diagram of a task assignment system 100 according to one embodiment.

Referring to FIG. 1, the task assignment system 100 according to an embodiment includes a master node 110 and a plurality of slave nodes 120-1, 120-2,..., 120-n.

The master node 110 may be assigned a job. For example, the master node 110 may be assigned a job by the user. When the master node 110 is assigned a task, the task may be divided to generate a plurality of tasks.

The master node 110 may assign the generated plurality of tasks to the plurality of slave nodes 120-1, 120-2, ..., 120-n. In this case, the master node 110 may allocate a task in consideration of performance information, battery remaining amount, and battery consumption rate of each of the plurality of slave nodes 120-1, 120-2, ..., 120-n. For example, the master node 110 has a relatively high performance among the plurality of slave nodes 120-1, 120-2,..., 120-n, and has a relatively high battery level and a relatively low battery consumption rate. Tasks can be assigned to slave nodes first.

The slave node 120 may receive a task from the master node, perform a task, and then transmit the result of the task to the master node 110.

Meanwhile, the master node 110 and the slave node 120 may be IoT devices such as a smartphone. When there are a plurality of IoT devices, an IoT device having a relatively good performance among a plurality of IoT devices, a relatively large battery remaining amount, and a relatively low battery consumption rate may be selected as the master node 110. At this time, the IoT device other than the IoT device selected as the master node 110 may be viewed as the slave node 120.

Meanwhile, the master node 110 and the slave node 120 may be connected through a network, and may exchange information related to a job with each other through wired / wireless communication. For example, the master node 110 and the slave node 120 may exchange information with respect to performance information, battery level, and battery consumption rate, as well as a task and a result of performing the task, and may share them.

On the other hand, if the IoT device used to play the role of the master node 110 is all the battery power is cut off, the performance of the IoT device used as a slave node is relatively excellent, the remaining battery capacity is relatively high, An IoT device having a relatively low battery consumption rate may be selected as the master node 110.

Meanwhile, the master node 110 exchanges heartbeats with a plurality of slave nodes 120-1, 120-2,..., 120-n and transmits a heartbeat to the plurality of slave nodes 120-1, 120-2. , ..., 120-n) can be updated.

2 is a block diagram of a task allocation apparatus 200 according to an exemplary embodiment.

The task assignment apparatus 200 illustrated in FIG. 2 may be implemented, for example, in one configuration included in the master node 110 illustrated in FIG. 1.

Referring to FIG. 2, the task assignment apparatus 200 according to an exemplary embodiment includes a task generator 210 and a task assigner 220.

The task generator 210 generates a plurality of tasks by dividing a task assigned to the master node 110.

The task allocator 220 is configured based on performance information, battery level, and battery consumption rate of each of the plurality of slave nodes 120-1, 120-2,..., 120-n connected to the master node 110 through a network. Assigns the generated task to the plurality of slave nodes. Here, the performance information may include at least one of information on a processor, a memory, and a storage space for each of the plurality of slave nodes 120-1, 120-2,..., 120-n.

Here, the battery consumption rate may be a battery consumption per unit time consumed by all programs running in the slave node 120 before the task is assigned to the slave node 120. According to an embodiment, the battery consumption rate may be a cumulative amount of battery consumption per unit time for a set time based on the task assignment time. This is to consider the battery consumption rate according to the device usage pattern of the user of the slave node 120. For example, the cumulative battery consumption per unit time may be calculated by Equation 1 below.

[Equation 1]

Here, T_BCR means the cumulative battery consumption per unit time. C_BCR refers to the battery consumption rate most recently measured among the battery consumption rates that are periodically measured, and B_BCR refers to the cumulative battery consumption per unit time calculated based on the C_BCR measurement. I denotes an identification number of a slave node, and COUNT means a number of times of periodically measuring a battery consumption rate.

The task allocator 220 may preferentially assign a task to a slave node having excellent performance information, a battery remaining amount, and a battery consumption rate among the plurality of slave nodes 120-1, 120-2,..., 120-n. For example, the task allocator 220 selects a candidate slave node based on the performance information and the remaining battery amount primarily, and selects a slave node to allocate a job among the selected candidate slave nodes based on the battery consumption rate. You can decide.

For example, the task allocator 220 may display the plurality of slave nodes 120-1 based on the performance information and the remaining battery capacity of each of the plurality of slave nodes 120-1, 120-2,..., 120-n. One or more of the plurality of slave nodes 120-1, 120-2,..., 120-n can perform the task by determining whether the task can be performed for each of the 120-2,. Candidate slave nodes may be selected. The task allocator 220 may allocate a plurality of tasks generated based on a battery consumption rate of each of the selected one or more candidate slave nodes to the candidate slave nodes. For example, the task allocator 220 may assign a task to a slave node having a minimum battery consumption rate among one or more selected candidate slave nodes.

On the other hand, when the task allocator 220 receives a request for reassignment of a task from one of a plurality of slave nodes, the slave requesting the reassignment of the task to the task that is requested to be reassigned based on the performance information, the battery level, and the battery consumption rate. You can reassign one of the remaining slave nodes except the node. For example, the task allocator 220 may select one or more candidate slave nodes capable of performing the task among the remaining slave nodes except for the slave node that requests the reassignment of the task, and determine a battery consumption rate for each of the selected candidate slave nodes. On the basis of this, the task that is requested to be reassigned may be allocated to the candidate slave node.

3 is a block diagram of a task reassignment requesting apparatus 300 according to an embodiment.

The task reassignment request apparatus 300 illustrated in FIG. 3 may be implemented in one configuration included in, for example, the slave node 120 illustrated in FIG. 1.

Referring to FIG. 3, the task reassignment request apparatus 300 according to an embodiment includes a task receiver 310, a determiner 320, and a task reassignment requester 330.

The task receiver 310 is assigned a task from the master node.

The determination unit 320 determines whether the assigned task can be performed based on the remaining battery capacity of the slave node 120 and the amount of battery required for performing the assigned task. For example, the determination unit 320 may determine that the assigned task is impossible to perform if the remaining battery capacity of the slave node 120 is less than the battery amount required for the execution of the assigned task. Meanwhile, the determination unit 320 may determine whether the assigned task can be performed at a set time interval.

Herein, the amount of battery required for the execution of the assigned task may be calculated based on the battery consumption rate considering only the execution of the assigned task and the estimated time to complete the task. In detail, the amount of batteries required for performing the task may be calculated by Equation 2 below.

[Equation 2]

Here, A_RB refers to the amount of battery required for the execution of the assigned task, A_BCR refers to the battery consumption rate considering only the execution of the assigned task, and A_Time refers to the estimated time to complete the task. I denotes an identification number of a slave node, and j denotes an identification number of an assigned job.

Here, the battery consumption rate A_BCR considering only the execution of the assigned task may be calculated based on the remaining battery capacity when the assigned task is being performed and the remaining battery capacity when the assigned task is not being performed. Specifically, the battery consumption rate A_BCR considering only the execution of the assigned task may be calculated by Equation 3 below.

[Equation 3]

Action_BC refers to the battery level when the assigned task is running, and Base_BC refers to the battery level when the assigned task is not running. And, COUNT is the number of times the battery consumption rate is measured periodically.

Meanwhile, the battery remaining amount BC may be calculated based on the remaining battery amount of the slave node and the total battery amount of the slave node. Specifically, the battery remaining amount BC may be calculated by Equation 4 below.

[Equation 4]

CB means the remaining battery amount of the slave node, TB means the total battery amount of the slave node.

Meanwhile, the estimated time A_Time to complete the execution of the task may be calculated based on the expected end time of the task and the start time of the task. In detail, an expected time A_Time to complete the execution of the task may be calculated by Equation 5 below.

[Equation 5]

End_Action means the expected end time of the task, and Start_Action means the start time of the task.

Meanwhile, the amount of battery required for the execution of the assigned task may be calculated based on the battery consumption rate considering the execution of other programs besides the execution of the assigned task and the estimated time to complete the task.

4 is a flowchart of a task assignment method according to an embodiment of the present invention.

The method shown in FIG. 4 may be performed by the task assignment apparatus 200 shown in FIG. 2, for example.

In the flowchart shown, the method is divided into a plurality of steps, but at least some of the steps may be performed in a reverse order, in combination with other steps, omitted together, divided into detailed steps, or not shown. One or more steps may be added and performed.

First, the task assignment apparatus 200 generates a plurality of tasks by dividing a task assigned to the master node 110 (410).

Next, the task assignment apparatus 200 may perform performance information on each of the plurality of slave nodes 120-1, 120-2,..., 120-n connected to the master node 110 through a network, a battery remaining amount, and a battery consumption rate. Based on the generated task, the generated task is allocated to the plurality of slave nodes 120-1, 120-2,..., 120-n (420).

For example, the task allocating apparatus 200 may perform at least one candidate slave capable of performing a task generated among the plurality of slave nodes 120-1, 120-2,..., 120-n based on the performance information and the battery remaining amount. The node may be selected and a task may be assigned to the candidate slave node based on the battery consumption rate for each of the selected one or more candidate slave nodes. In detail, the task allocating apparatus 200 may allocate the generated task to a slave node having a minimum battery consumption rate among the selected one or more candidate slave nodes.

5 is a flowchart illustrating a task reassignment request method according to an embodiment of the present invention.

For example, the method illustrated in FIG. 5 may be performed by the task reassignment request apparatus 300 illustrated in FIG. 3.

In the flowchart shown, the method is divided into a plurality of steps, but at least some of the steps may be performed in a reverse order, in combination with other steps, omitted together, divided into detailed steps, or not shown. One or more steps may be added and performed.

First, the task reassignment request apparatus 300 receives a task from the master node 110 (510).

Next, the task reassignment request apparatus 300 determines whether the assigned task can be performed based on the battery remaining amount of the slave node 120 and the battery amount required for the execution of the assigned task (520).

For example, the task reassignment request apparatus 300 may determine that the assigned task is impossible to perform when the battery remaining amount of the slave node 120 is less than the battery amount required for the execution of the assigned task.

Lastly, if it is determined that the task to be assigned is impossible to perform, the task reassignment request apparatus 300 requests reassignment of the assigned task to the master node 110 (530).

6 is a block diagram illustrating and describing a computing environment 10 that includes a computing device suitable for use in the exemplary embodiments.

In the illustrated embodiment, each component may have different functions and capabilities in addition to those described below, and may include additional components in addition to those described below.

The illustrated computing environment 10 includes a computing device 12. In one embodiment, computing device 12 may be task assignment device 200 or task reassignment request device 300. Computing device 12 includes at least one processor 14, computer readable storage medium 16, and communication bus 18. The processor 14 may cause the computing device 12 to operate according to the example embodiments mentioned above. For example, processor 14 may execute one or more programs stored in computer readable storage medium 16. The one or more programs may include one or more computer executable instructions that, when executed by the processor 14, cause the computing device 12 to perform operations in accordance with an exemplary embodiment. Can be.

Computer readable storage medium 16 is configured to store computer executable instructions or program code, program data and / or other suitable forms of information. The program 20 stored in the computer readable storage medium 16 includes a set of instructions executable by the processor 14. In one embodiment, computer readable storage medium 16 includes memory (volatile memory, such as random access memory, nonvolatile memory, or a suitable combination thereof), one or more magnetic disk storage devices, optical disk storage devices, flash Memory devices, or any other form of storage medium accessible by computing device 12 and capable of storing desired information, or a suitable combination thereof.

The communication bus 18 interconnects various other components of the computing device 12, including the processor 14 and the computer readable storage medium 16.

Computing device 12 may also include one or more input / output interfaces 22 and one or more network communication interfaces 26 that provide an interface for one or more input / output devices 24. The input / output interface 22 and the network communication interface 26 are connected to the communication bus 18. The input / output device 24 may be connected to other components of the computing device 12 via the input / output interface 22. Exemplary input / output device 24 may include a pointing device (such as a mouse or trackpad), a keyboard, a touch input device (such as a touchpad or touchscreen), a voice or sound input device, various types of sensor devices, and / or imaging devices. Input devices, and / or output devices such as display devices, printers, speakers, and / or network cards. The example input / output device 24 may be included inside the computing device 12 as one component of the computing device 12, and may be connected to the computing device 12 as a separate device from the computing device 12. It may be.

Meanwhile, embodiments of the present invention may include a program for performing the methods described herein on a computer, and a computer readable recording medium including the program. The computer-readable recording medium may include program instructions, local data files, local data structures, etc. alone or in combination. The media may be those specially designed and constructed for the purposes of the present invention, or those conventionally available in the field of computer software. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tape, optical recording media such as CD-ROMs, DVDs, and specially configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Hardware devices are included. Examples of such programs may include high-level language code that can be executed by a computer using an interpreter as well as machine code such as produced by a compiler.

The above detailed description should not be construed as limiting in all aspects but considered as illustrative. The scope of the present invention should be determined by reasonable interpretation of the appended claims, and all changes within the equivalent scope of the present invention are included in the scope of the present invention.

10: Computing Environment
12: computing device
14: Processor
16: computer readable storage media
18: communication bus
20: Program
22: I / O interface
24: input / output device
26: network communication interface
100: task assignment system
110: master node
120: slave node
200: task allocation device
210: task generator
220: task assignment unit
300: task reassignment request device
310: task receiver
320: judgment
330: task reassignment request unit

Claims (14)

In the task assignment device included in the master node,
A task generator configured to generate a plurality of tasks by dividing a job assigned to the master node; And
And a task allocator configured to allocate the plurality of tasks to the plurality of slave nodes based on performance information, battery level, and battery consumption rate of each of the plurality of slave nodes connected through the network with the master node.
The battery consumption rate is a cumulative amount of battery consumption per unit time for a preset time based on the task assignment time.
The cumulative battery consumption per unit time is calculated by Equation 1 below.
[Equation 1]

(T_BCR is the cumulative battery consumption per unit time, C_BCR is the most recently measured battery consumption rate, B_BCR is the battery accumulation consumption per unit time calculated based on before the C_BCR is measured, i is the identification of the slave node. Number, COUNT is the number of measurements of the battery consumption rate)
The method according to claim 1,
The performance information includes at least one of information on a processor, a memory, and a storage space for each of the plurality of slave nodes.
The method according to claim 1,
The task allocator may select one or more candidate slave nodes among the plurality of slave nodes based on the performance information and the battery remaining amount, and based on a battery consumption rate of each of the selected one or more candidate slave nodes. Assigning the selected one or more candidate slave nodes.
The method according to claim 3,
The task allocator assigns the plurality of tasks to a slave node having the minimum battery consumption rate among the selected one or more candidate slave nodes.
The method according to claim 1,
When the task allocator receives a request for reassignment of a task from one of the plurality of slave nodes, the slave requesting the reassignment of the task to the task that is requested to be reassigned based on the performance information, battery level, and battery consumption rate. A device that is reassigned to one of the remaining slave nodes except for the node.
In the task assignment method performed in the task assignment apparatus included in the master node,
Generating a plurality of tasks by dividing a job assigned to the master node; And
Allocating the plurality of tasks to the plurality of slave nodes based on performance information, battery level, and battery consumption rate of each of the plurality of slave nodes connected through the network with the master node;
The battery consumption rate is a cumulative amount of battery consumption per unit time for a preset time based on the task assignment time.
The cumulative battery consumption per unit time is calculated by Equation 1 below.
[Equation 1]

(T_BCR is the cumulative battery consumption per unit time, C_BCR is the most recently measured battery consumption rate, B_BCR is the battery accumulation consumption per unit time calculated based on before the C_BCR is measured, i is the identification of the slave node. Number, COUNT is the number of measurements of the battery consumption rate) The method according to claim 6,
The capability information includes at least one of information on a processor, a memory, and a storage space for each of the plurality of slave nodes.
The method according to claim 6,
Assigning the plurality of tasks to the plurality of slave nodes comprises: selecting one or more candidate slave nodes of the plurality of slave nodes based on the performance information and the battery remaining amount; And
And assigning the plurality of tasks to the selected one or more candidate slave nodes based on a battery consumption rate for each of the selected one or more candidate slave nodes.
The method according to claim 8,
And allocating the plurality of tasks to the candidate slave node assigns the plurality of tasks to a slave node having the lowest battery consumption among the selected one or more candidate slave nodes.
The method according to claim 6,
When a task reassignment is requested from one of the plurality of slave nodes, the remaining slaves other than the slave node requesting the reassignment of the task may be assigned to the task based on the performance information, battery level, and battery consumption rate. And reassigning to one of the nodes.
delete The method according to claim 10,
The slave node requesting the reassignment determines that the task cannot be performed when the remaining battery amount is less than the battery amount required for the task,
Requesting reassignment of the task if the task cannot be performed.
A task reassignment request method performed in a task reassignment request apparatus included in a slave node,
Receiving a task from a master node;
Determining whether the task can be performed based on the remaining battery capacity of the slave node and the amount of battery required to perform the task; And
Requesting reassignment of the task to the master node if it is determined that the task cannot be performed;
The amount of battery required to perform the task is calculated based on the battery consumption rate considering only the assigned performance of the task and the estimated time to complete the task,
The battery consumption rate considering only the performance of the task is calculated based on the remaining battery power when the task is running and the remaining battery power when the task is not performing.
The method according to claim 13,
The operation of determining whether the task can be performed, if the remaining battery capacity of the slave node is less than the amount of battery required to perform the task, the task reassignment request method.

Images