KR102453343B1 - Electronic apparatus which enables fast data migration through scheduling of data migration tasks, and the operating method thereof - Google Patents

Abstract

Disclosed are an electronic device that enables fast data transfer through a scheduling for data transfer task, and an operating method therefor. The present invention relates to the electronic device capable of processing the data transfer task by simultaneously generating a thread of up to an optimal number based on a quantity of data subject to the data transfer task, and the operating method therefor. The electronic device comprises: an information storage part; a prediction part; a quantity selection part; and a task performing part.

Description

Electronic device enabling fast data migration through scheduling of data migration task and method of operation thereof

The present invention relates to an electronic device that enables fast data transfer through scheduling of a data transfer task and an operating method thereof.

Recently, with the development of IT technology, the amount of data used in electronic devices such as computers is increasing.

In this regard, when transferring data stored in a data storage to another data storage, there is a problem in that as the amount of data that is a target of the data migration operation increases, the time required to process the data migration operation increases.

Therefore, there is a need for a study on a technology for performing data migration for a large number of data more quickly and efficiently.

In general, when processing data migration for a large number of data, a parallel processing method of simultaneously migrating multiple data by creating multiple threads simultaneously is used instead of sequentially migrating data one by one. have.

However, if the number of threads that are simultaneously created within a limited computing resource is unconditionally increased, the performance of each created thread is degraded. The existing method is inefficient.

If the data migration task for a large number of data can be processed in parallel by simultaneously creating the optimal number of threads in consideration of the amount of data, the data migration operation can be processed faster and more efficiently.

Therefore, it is necessary to study a technology that enables fast data migration through scheduling of data migration tasks.

The present invention provides an electronic device for processing a data transfer task by simultaneously creating an optimal number of threads based on the quantity of data that is a target of the data transfer task, and an operating method thereof, thereby providing the electronic device. Through this, we want to support faster and more efficient data migration.

In an electronic device that enables fast data transfer through scheduling for a data transfer task according to an embodiment of the present invention, the maximum number of threads that can be simultaneously created in the electronic device is preset in order to perform the data transfer task. An information storage unit in which information about When this is approved, the work required time required to simultaneously create n threads and process the data transfer task - The task required time is equal to the k data from the first data storage by allocating the k data equally to the n threads. 2 Means the time it takes to process the data transfer operation to the data storage - By repeatedly performing the process for estimating n by 1 from 1 to the maximum number of threads, the electronic device can simultaneously create A predictor for predicting the task required time according to the number of threads, a first for which the task required time is predicted to be the minimum among the number of threads corresponding to 1 to the maximum number of threads that can be simultaneously created in the electronic device When the number selector for selecting the number of threads and the first number of threads is selected, the number of threads corresponding to the first number of threads is simultaneously created, and the k data are equally allocated to the number of threads corresponding to the first number of threads. , by simultaneously executing as many threads as the first number of threads, and a task performing unit for performing a data transfer operation for the k pieces of data from the first data storage to the second data storage.

In addition, according to an embodiment of the present invention, in the method of operating an electronic device that enables fast data transfer through scheduling for a data transfer task, the maximum preset value that can be simultaneously created in the electronic device is to perform the data transfer task. maintaining an information storage unit in which information on the number of threads is stored, and transferring k (k is a natural number greater than or equal to 2) data stored in a preset first data storage by a user to a preset second data storage When the instructing data transfer command is applied, the task required to process the data transfer task by simultaneously creating n threads - The task required time is the first time required by equally allocating the k data to the n threads. By repeatedly performing the process for estimating - which means the time required to process the data transfer operation from the data storage to the second data storage, increasing n by 1 from 1 to the maximum number of threads, the electron estimating the time required for the task according to the number of threads that can be simultaneously created in the device; among the number of threads corresponding to 1 to the maximum number of threads that can be simultaneously created in the electronic device, the task required time is the minimum selecting the predicted first number of threads, and when the first number of threads is selected, simultaneously generating as many threads as the first number of threads, and equally allocating the k data to the number of threads corresponding to the first number of threads and then performing a data migration operation for the k pieces of data from the first data storage to the second data storage by simultaneously executing as many threads as the first number of threads.

The present invention provides an electronic device for processing a data transfer task by simultaneously creating an optimal number of threads based on the quantity of data that is a target of the data transfer task, and an operating method thereof, thereby providing the electronic device. Through this, it is possible to support faster and more efficient data migration.

1 is a diagram illustrating a structure of an electronic device that enables fast data transfer through scheduling for a data transfer task according to an embodiment of the present invention.
2 is a flowchart illustrating a method of operating an electronic device that enables fast data transfer through scheduling for a data transfer task according to an embodiment of the present invention.

Hereinafter, embodiments according to the present invention will be described in detail with reference to the accompanying drawings. These descriptions are not intended to limit the present invention to specific embodiments, and should be understood to include all modifications, equivalents, and substitutes included in the spirit and scope of the present invention. In describing each drawing, like reference numerals are used for similar components, and unless otherwise defined, all terms used in this specification, including technical or scientific terms, refer to those of ordinary skill in the art to which the present invention belongs. It has the same meaning as is commonly understood by those who have it.

In this document, when a part "includes" a certain component, it means that other components may be further included, rather than excluding other components, unless otherwise stated. In addition, in various embodiments of the present invention, each of the components, functional blocks or means may be composed of one or more sub-components, and the electrical, electronic, and mechanical functions performed by each component are electronic. A circuit, an integrated circuit, an ASIC (Application Specific Integrated Circuit), etc. may be implemented with various well-known devices or mechanical elements, and may be implemented separately or two or more may be integrated into one.

On the other hand, the blocks in the accompanying block diagram or steps in the flowchart are computer program instructions that are loaded in a processor or memory of equipment capable of data processing, such as a general-purpose computer, a special-purpose computer, a portable notebook computer, and a network computer, and perform specified functions. can be interpreted as meaning Since these computer program instructions may be stored in a memory provided in a computer device or in a memory readable by a computer, the functions described in the blocks of the block diagram or the steps of the flowchart are produced in an article containing instruction means for performing the same. it might be In addition, each block or each step may represent a module, segment, or portion of code comprising one or more executable instructions for executing the specified logical function(s). It should also be noted that, in some alternative embodiments, it is possible for the functions recited in blocks or steps to be executed out of the prescribed order. For example, two blocks or steps shown one after another may be performed substantially simultaneously or in the reverse order, and in some cases, some blocks or steps may be omitted.

1 is a diagram illustrating a structure of an electronic device that enables fast data transfer through scheduling for a data transfer task according to an embodiment of the present invention.

Referring to FIG. 1 , an electronic device 110 according to an embodiment of the present invention includes an information storage unit 111 , a prediction unit 112 , a number selection unit 113 , and a task execution unit 114 .

In the information storage unit 111 , information on the maximum number of threads that can be simultaneously generated by the electronic device 110 is stored in advance to perform a data transfer operation.

In relation to this, when the number of threads generated in the electronic device 110 increases, the performance of one thread decreases by that much, so that the user 130 performs a data transfer operation in consideration of the performance of the electronic device 110 . Therefore, the maximum number of threads that can be created at the same time can be preset. In this regard, when the maximum number of threads preset by the user 130 is '8 (pcs)', information on '8 (pcs)', which is the maximum number of threads, is stored in the information storage unit 111. there may be

The prediction unit 112 instructs the user 130 to transfer k (k is a natural number greater than or equal to 2) data stored in the preset first data storage 11 to the preset second data storage 12 . When a data transfer command of The electronic device ( In 110), the task required time is predicted according to the number of threads that can be simultaneously created.

Here, the equal allocation refers to a method of allocating the k data in an equal number to the n threads. If '2' data can be allocated to each of the '6' threads and '10' data is equally allocated to '6' threads, '2' to each of '4' threads out of '6 threads' 'data' and 'one' data can be allocated to each of the remaining 'two' threads.

In this regard, in order to equally allocate the k pieces of data to the n threads, a method of allocating the k pieces of data to the n threads in a round robin manner may be used.

At this time, according to an embodiment of the present invention, when the data transfer command is applied by the user 130, the prediction unit 112 increases n by 1 from 1 to the maximum number of threads, and sequentially, the following By repeatedly performing steps (1) to (3) as shown in Table 1, it is possible to predict the time required for the task according to the number of threads that can be simultaneously created in the electronic device 110 .

(1) After simultaneously creating n threads, the number of data corresponding to a preset sampling rate among the k data is sampled, and through any one of the n threads, the first data storage 11 ) to the second data storage 12, by processing the data transfer operation for the sampled data, calculates a first time required to process the data transfer operation for the sampled data, and the first time By dividing by the number of the sampled data, the average time taken to process the data transfer operation of each of the sampled data is calculated. (Here, the transfer from the first data store 11 to the second data store 12 It is assumed that each of the k pieces of data to be data is of the same format as each other, and therefore, the time required for each of the k pieces of data to be transferred from the first data storage 11 to the second data storage 12 is Assuming they are the same in theory)

(2) Assuming that the data transfer operation is processed by allocating the k data equally to the n threads, the maximum number of data to be processed through one thread is calculated.

(3) By multiplying the average time by the maximum number of data, the time required for the task when the data transfer task is processed through the n threads is predicted.

In this case, according to an embodiment of the present invention, the prediction unit 112 may calculate the maximum number of data according to Equation 1 below in the process (2).

는 천장 함수를 의미한다.where p is the maximum number of data,

is the ceiling function.

The number selector 113 determines the number of each thread when the task required time according to the number of threads corresponding to 1 to the maximum number of threads that can be simultaneously created in the electronic device 110 is predicted through the predictor 112 . Among them, the first number of threads for which the work required time is predicted to be the minimum is selected.

When the first number of threads is selected by the number selection unit 113 , the task performing unit 114 simultaneously generates as many threads as the first number of threads, and includes the k threads in the first number of threads. After allocating data equally, the k data are transferred from the first data storage 11 to the second data storage 12 by simultaneously executing as many threads as the first number of threads.

Hereinafter, the operations of the prediction unit 112 , the number selection unit 113 , and the task execution unit 114 will be described in detail, for example.

First, it is assumed that the maximum number of threads stored in the information storage unit 111 is '8' and k is '1,000'. Assume that a data transfer command instructing to transfer '1,000' data stored in the second data storage 12 is applied.

Then, the prediction unit 112 sequentially and repeatedly performs steps (1) to (3) as shown in Table 1 while increasing n by 1 from 1 to '8', which is the maximum number of threads. The device 110 may estimate the task required time according to the number of threads that can be simultaneously created.

In relation to this, when n is '3', the prediction unit 112 performs processes (1) to (3) as shown in Table 1, thereby processing the data transfer operation through '3' threads. A process for estimating the required work time will be described below.

First, when the preset sampling rate is '1%', the prediction unit 112 simultaneously creates '3' threads in step (1), and then '1' which is the sampling rate among '1,000' pieces of data. By sampling '10' data, which is the number corresponding to %', '10' sampling data from the first data storage 11 to the second data storage 12 through '3' threads By processing the data transfer operation for , it is possible to calculate a first time required to process the data transfer operation for '10 pieces of sampled data. At this time, if it is assumed that the first time period is calculated as '30 (seconds)', the prediction unit 112 divides the first time period by '10', which is the number of sampling data, to obtain '10 pieces of sampled data. The average time taken to process each data transfer operation can be calculated as '3 (seconds)'.

Then, in step (2), based on Equation 1, the prediction unit 112 allocates '1,000' pieces of data equally to '3' threads to process the data transfer operation, one thread The maximum number of data to be processed can be calculated as '334 (pieces)'.

After that, in the process (3), the prediction unit 112 multiplies the average time of '3 (seconds)' by the maximum number of data, '334 (units)', to transfer data through '3' threads. When processing a job, the required time for the job may be predicted as '1,002 (seconds)'.

In this way, the prediction unit 112 repeatedly performs steps (1) to (3) as shown in Table 1 above while increasing n by 1 from 1 to '8', so that from 1 to '8' It is possible to estimate the time required for the operation according to the number of corresponding threads.

As a result, among the number of threads corresponding to 1 to '8', when the number of the first threads for which the work required time is predicted to be '6' is '6', the number selector 113 may '6', which is the first number of threads, may be selected from among the number of threads corresponding to 1 to '8' that can be created simultaneously.

Then, the task execution unit 114 simultaneously creates '6' threads, equally allocates '1,000' data to the '6' threads, and simultaneously executes the '6' threads, so that the first data storage A data migration operation for '1,000' pieces of data may be performed from (11) to the second data storage 12 .

At this time, according to an embodiment of the present invention, when the first number of threads is selected by the number selection unit 113 , the task execution unit 114 calculates the estimated first task required time for the first number of threads. , is displayed on the screen as the estimated time required to process the data transfer task for the k data, and then simultaneously creates as many threads as the first number of threads, and as many threads as the first number of threads After allocating the k data equally, by simultaneously executing as many threads as the first number of threads, data transfer operation for the k data from the first data storage 11 to the second data storage 12 At the same time, the time required for the first operation displayed on the screen is reversed, and when the time required for the first operation is all exhausted before the data transfer operation for the k pieces of data is completed, the first operation The process of increasing the required time by a preset additional time and counting again may be repeatedly performed until the data transfer operation for the k pieces of data is completed.

For example, as in the above-described example, it is assumed that '6', which is the first number of threads, is selected by the number selector 113, and in this case, the estimated first task required time for '6', which is the first number of threads, is Let's assume this is '800 (seconds)'.

Then, the task performing unit 114 displays '800 (seconds)', which is the first task required time, on the screen as the estimated task time expected to be required to process the data transfer task for '1,000' pieces of data. can do.

Thereafter, the task execution unit 114 may simultaneously create '6' threads and equally allocate '1,000' data to the '6' threads.

Then, the task execution unit 114 simultaneously executes '6' threads, thereby performing a data transfer operation for '1,000' pieces of data from the first data storage 11 to the second data storage 12 at the same time. , '800 (seconds)', which is the time required for the first operation displayed on the screen, is counted backward in the form of '799 (seconds), 798 (seconds), 797 (seconds), 796 (seconds), ...' can do.

Through this, the user 130 may estimate the required time required for the data transfer operation for '1,000' pieces of data to be completed.

However, since the time required for the first operation is only a theoretically calculated predicted time, depending on the system situation of the electronic device 110 , before the data transfer operation for '1,000' pieces of data is completed, the first There may be a situation in which '800 (seconds)', which is the required work time, is exhausted because the reverse count is completed. If such a situation occurs, even though the time required for the first operation is '0 (seconds)', the data transfer operation is not completed. As a result, inaccurate information is delivered to the user 130. can Therefore, the task performing unit 114 according to the present invention increases the first task required time by a preset additional time when a situation occurs in which the first task required time is all exhausted before the data transfer task is completed. Then, by repeating the process of counting again, it is possible to notify the user 130 that additional work time is required.

In this regard, if the preset additional time is '10 seconds', the task performing unit 114 sets the first task required time of '800 (seconds) before the data transfer operation for '1,000' pieces of data is completed. )' is exhausted, the time required for the first operation may be increased by '10 seconds' to count backward again.

In this way, the task performing unit 114 repeatedly performs the above process until the data transfer task for '1,000' pieces of data is completed, so that the data transfer task for '1,000' pieces of data is performed to the user 130 . It can provide continuous information about how long a task will take to complete.

According to an embodiment of the present invention, when the data transfer operation for the k pieces of data is completed, the electronic device 110 generates history information for the data transfer operation and stores it in a predetermined cloud storage server 140 . may further include. To this end, the electronic device 110 according to the present invention includes a table maintaining unit 115 , an event generating unit 116 , a serial number dividing unit 117 , an operation code generating unit 118 , and a hash value generating unit 119 . , an information storage processing unit 120 , an information receiving unit 121 , a serial number re-dividing unit 122 , an operation code regenerating unit 123 , a history information restoration unit 124 , and an information display unit 125 .

The table holding unit 115 stores a serial number table in which a serial number of preset different 2t (t is a natural number equal to or greater than 2) digits corresponding to each number of threads corresponding to the number of threads from 1 to the maximum number of threads is recorded. keep

For example, as in the above example, when the maximum number of threads is '8' and t is '3', the table holding unit 115 sets the number of threads corresponding to 1 to '8'. Corresponding to, it is possible to store and maintain a serial number table in which preset serial numbers of different '6' digits are recorded.

number of threads Serial number with '6' digits One 921457 2 230514 3 881692 4 130286 5 631754 6 122945 7 610452 8 711328

When the data transfer operation for the k pieces of data is completed by the task execution unit 114 , the event generator 116 generates a history storage event for storing transfer history information for the k pieces of data.

When the history storage event is generated by the event generating unit 116 , the transfer history information generating unit 117 includes information on the date and time when the data transfer operation for the k pieces of data is completed, and the data on the k pieces of data. Information on the actual time required to perform the migration operation, information on the source data storage, identification information on the first data storage 11 and information on the target data storage, and the second data storage 12 Creates first transfer history information composed of identification information for

When the first transfer history information is generated by the transfer history information generating unit 117, the serial number dividing unit 118 extracts a first serial number corresponding to the first number of threads from the serial number table, The first serial number is divided into a first partial serial number of t digits on the left and a second partial serial number of t digits on the right side of the central axis of the first serial number.

The operation code generation unit 119 configures the result value when a modulo-2 operation is performed on each of the t numbers constituting the first partial serial number into a bit string, thereby generating the t-bit number. 1 operation code is generated and a result value obtained when modulo-2 operation is performed on each of the t numbers constituting the second partial serial number is configured as a bit string, thereby generating a t-bit second operation code create

Here, the modulo-2 operation refers to an operation that divides the dividend by 2 and calculates a remainder.

The hash value generator 120 generates a t-bit seed code by performing an exclusive-or (XOR) operation between the first operation code and the second operation code, and then converts the seed code to a preset hash. A first hash value is generated by applying it as an input to the function.

When the first hash value is generated by the hash value generator 120 , the information storage processing unit 121 encrypts the first transfer history information with the first hash value, and then sets a preset cloud storage server 140 . , by storing the encrypted first transfer history information and information on the number of first threads in correspondence with each other, the process of storing transfer history information for the k pieces of data is completed.

The information receiving unit 122 displays the first transfer history information by the user 130 after the encrypted first transfer history information and the information on the first number of threads are stored in the cloud storage server 140 . When the command is applied, the encrypted first migration history information and information on the number of the first threads are received from the cloud storage server 140 .

When the encrypted first transfer history information and the information on the first number of threads are received by the information receiving unit 122, the serial number re-dividing unit 123 receives from the serial number table, the number of threads corresponding to the first number of threads. The first serial number is extracted, and the first serial number is the first partial serial number of t digits on the left and the second partial serial number of t digits on the right with respect to the central axis of the first serial number. split into

The operation code regenerating unit 124 configures the result value when the modulo-2 operation is performed on each of the t numbers constituting the first partial serial number into a bit string, so that the t-bit first operation A code is generated and the result value obtained when modulo-2 operation is performed on each of the t numbers constituting the second partial serial number is configured as a bit string, thereby generating the t-bit second operation code. do.

The history information restoration unit 125 generates the t-bit seed code by performing an exclusive-OR operation between the first operation code and the second operation code, and applies the seed code as an input to the hash function. After generating a first hash value, the first migration history information is restored by decrypting the encrypted first migration history information into the first hash value.

When the first transfer history information is restored by the history information restoration unit 125 , the information display unit 126 displays the first transfer history information on the screen.

Hereinafter, the event generation unit 116, the transfer history information generation unit 117, the serial number division unit 118, the operation code generation unit 119, the hash value generation unit 120, the information storage processing unit 121, Operations of the information receiving unit 122 , the serial number repartitioning unit 123 , the operation code regenerating unit 124 , the history information restoring unit 125 , and the information displaying unit 126 will be described in detail, for example.

First, as in the above-described example, it is assumed that the first number of threads is '6', and according to the above-described example, the data transfer operation for '1,000' pieces of data is completed by the task execution unit 114 .

In this case, the event generator 116 may generate a history storage event for storing transfer history information for '1,000' pieces of data.

Then, the transfer history information generating unit 117 provides information on the date and time at which the data transfer operation for '1,000' pieces of data was completed, and the actual time required to perform the data transfer operation for '1,000' pieces of data. information on the source data storage, identification information on the first data storage 11 and information on the target data storage, and first transfer history information consisting of identification information on the second data storage 12 can create

Then, the serial number division unit 118 extracts '122945' corresponding to '6', which is the first number of threads, from the serial number table as shown in Table 2, and sets '122945' to the center of '122945'. Based on the axis, it can be divided into '122' which is a first partial serial number of '3' digits on the left and '945' which is a second partial serial number of '3' digits on the right side.

Then, the operation code generator 119 configures the result value when the modulo-2 operation is performed on each of the '3' numbers constituting the '122', which is the first partial serial number, into a bit string. , a first operation code of '3' bits can be generated like '100', and modulo-2 operation is performed on each of '3' numbers constituting '945', which is the second partial serial number. By composing the result value at the time of doing this as a bit string, the second operation code of '3' bits can be generated like '101'.

Thereafter, the hash value generating unit 120 performs an exclusive OR operation between '100', which is the first operation code, and '101', which is the second operation code, to convert the '3' bit seed code to '001' and After generating together, the first hash value may be generated by applying the seed code '001' as an input to a preset hash function.

Then, the information storage processing unit 121 encrypts the first transfer history information with the first hash value, and sends the encrypted first transfer history information and the first number of threads to a preset cloud storage server 140 . By storing information on '6' in correspondence with each other, the process of storing transfer history information for '1,000' pieces of data can be completed.

After that, it is assumed that a display command for the first transfer history information is applied to the electronic device 110 by the user 130 .

Then, the information receiving unit 122 may receive, from the cloud storage server 140 , the encrypted first migration history information and information on '6', which is the first number of threads.

Then, the serial number subdivision unit 123 extracts '122945' corresponding to '6', which is the first number of threads, from the serial number table as shown in Table 2, and sets '122945' to the center of '122945'. Based on the axis, it may be divided into '122', which is the first partial serial number of '3' digits on the left side, and '945', which is the second partial serial number of '3' digits on the right side.

Then, the operation code regeneration unit 124 configures the result value when the modulo-2 operation is performed on each of the '3' numbers constituting the '122', which is the first partial serial number, into a bit string. , the first operation code of '3' bits can be generated like '100', and modulo-2 operation is performed on each of '3' numbers constituting '945', which is the second partial serial number. By composing the result value at the time of execution into a bit string, the second operation code of '3' bits can be generated as '101'.

Thereafter, the history information restoration unit 125 performs an exclusive-OR operation between '100', which is the first operation code, and '101', which is the second operation code, thereby converting the '3'-bit seed code to '001' and After generating together, the first hash value may be generated by applying the seed code '001' as an input to the hash function.

Then, the history information restoration unit 125 may restore the first migration history information by decrypting the encrypted first migration history information into the first hash value.

Then, the information display unit 126 may display the first transfer history information on the screen.

That is, when the data transfer operation for the k pieces of data is completed, the electronic device 110 generates and stores transfer history information for the k pieces of data in the cloud storage server 140 , so that the user 130 can It can support to check information about the history to which the k pieces of data have been transferred.

2 is a flowchart illustrating a method of operating an electronic device that enables fast data transfer through scheduling for a data transfer task according to an embodiment of the present invention.

In step S210, in order to perform the data transfer operation, the electronic device maintains an information storage unit in which information on the maximum number of threads that can be created simultaneously is stored.

In step S220, when a data transfer command instructing to migrate k (k is a natural number greater than or equal to 2) data stored in the preset first data store to the preset second data store is applied by the user, the thread is started in step S220. Time required to generate n pieces of data at the same time and process the data transfer operation By repeatedly performing a process for predicting (meaning time required to process a task), increasing n by 1 from 1 to the maximum number of threads, Estimate the time it will take to work.

In step S230, the electronic device selects the first number of threads for which the work required time is predicted to be the minimum from among the number of threads corresponding to 1 to the maximum number of threads that can be simultaneously created in the electronic device.

In step S240, if the first number of threads is selected, threads corresponding to the first number of threads are simultaneously created, and the k data are equally allocated to the first number of threads, and then the first number of threads is created. By simultaneously executing as many threads as the number of threads, a data migration operation for the k pieces of data is performed from the first data storage to the second data storage.

At this time, according to an embodiment of the present invention, in step S220, when the data transfer command is applied by the user, n is sequentially increased from 1 to the maximum number of threads by 1, as shown in Table 1 above. By repeatedly performing steps (1) to (3), it is possible to estimate the time required for the task according to the number of threads that can be simultaneously created in the electronic device.

At this time, according to an embodiment of the present invention, in step S220, in step (2), the maximum number of data may be calculated according to Equation 1 above.

In addition, according to an embodiment of the present invention, when the first number of threads is selected in step S240 , the estimated first task required time for the first number of threads is used for the data transfer task for the k pieces of data. After displaying on the screen as the estimated work time expected to process Then, by simultaneously executing the number of threads as many as the first number of threads, the data transfer operation for the k pieces of data from the first data storage to the second data storage is performed, and the first operation displayed on the screen Reverse counting the required time, and when all the required time for the first operation is exhausted before the data transfer operation for the k pieces of data is completed, the required time for the first operation is increased by a preset additional time to reverse count The process may be repeatedly performed until the data transfer operation for the k pieces of data is completed.

Also, according to an embodiment of the present invention, in the method of operating the electronic device, the number of preset different 2t (t is a natural number equal to or greater than 2) digits corresponding to the number of threads corresponding to 1 to the maximum number of threads. When the data transfer operation for the k pieces of data is completed by storing and maintaining the serial number table in which the serial numbers are recorded, by step S240, history storage for storing transfer history information for the k pieces of data generating an event, when the history storage event occurs, information on the date and time when the data transfer operation on the k pieces of data is completed, and the actual time required to perform the data transfer operation on the k pieces of data generating first migration history information including information on the source data storage, identification information on the first data storage and information on the target data storage, and identification information on the second data storage; , when the first transfer history information is generated, a first serial number corresponding to the first number of threads is extracted from the serial number table, and the first serial number is set based on the central axis of the first serial number. , dividing into a first partial serial number of t digits on the left and a second partial serial number of t digits on the right side, performing a modulo-2 operation on each of t numbers constituting the first partial serial number By composing the result value at the time of the operation into a bit string, a t-bit first operation code is generated, and the result when modulo-2 operation is performed on each of the t numbers constituting the second partial serial number After generating a t-bit seed code by generating a t-bit second operation code by composing the value into a bit string, performing an exclusive-OR operation between the first operation code and the second operation code, generating a first hash value by applying a seed code to a preset hash function as an input; when the first hash value is generated, the first migration history information is applied to the first hash value After encryption, the process of storing the transfer history information for the k pieces of data by storing the encrypted first transfer history information and the information on the number of first threads in correspondence with each other in a preset cloud storage server. Completing, after the encrypted first transfer history information and information on the number of first threads are stored in the cloud storage server, when a display command for the first transfer history information is applied by the user, the Receiving the encrypted first transfer history information and information on the number of first threads from the cloud storage server. When the encrypted first transfer history information and information on the first number of threads are received, the serial extracting the first serial number corresponding to the first number of threads from the number table, and using the first serial number as the first partial serial number of the left t-digit number based on the central axis of the first serial number and dividing into the second partial serial number of t digits to the right, and a bit string of a result value obtained when modulo-2 operation is performed on each of t numbers constituting the first partial serial number By doing so, the first operation code of t bits is generated, and the result value when the modulo-2 operation is performed on each of the t numbers constituting the second partial serial number is configured as a bit string, t generating the second operation code of bits and performing an exclusive-OR operation between the first operation code and the second operation code to generate the seed code of t bits, and input the seed code to the hash function After generating the first hash value by applying to , restoring the first migration history information by decrypting the encrypted first migration history information to the first hash value, and the first migration history information is restored The method may further include displaying the first transfer history information on a screen.

In the above, a method of operating an electronic device that enables fast data transfer through scheduling of a data transfer task according to an embodiment of the present invention has been described with reference to FIG. 2 . Here, the operation method of the electronic device that enables fast data transfer through scheduling for the data transfer task according to an embodiment of the present invention may correspond to the configuration of the operation of the electronic device 110 described with reference to FIG. 1 . Therefore, a more detailed description thereof will be omitted.

According to an embodiment of the present invention, the method of operating an electronic device that enables fast data transfer through scheduling for a data transfer task may be implemented as a computer program stored in a storage medium for execution through combination with a computer.

In addition, the method of operating an electronic device that enables fast data transfer through scheduling for a data transfer task according to an embodiment of the present invention is implemented in the form of a program command that can be executed through various computer means and is a computer-readable medium. can be recorded in The computer-readable medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded on the medium may be specially designed and configured for the present invention, or may be known and available to those skilled in the art of computer software. Examples of the computer-readable recording medium include magnetic media such as hard disks, floppy disks and magnetic tapes, optical media such as CD-ROMs and DVDs, and magnetic such as floppy disks. - includes magneto-optical media, and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine language codes such as those generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like.

As described above, in the present invention, specific matters such as specific components, etc., and limited embodiments and drawings have been described, but these are only provided to help a more general understanding of the present invention, and the present invention is not limited to the above embodiments. , various modifications and variations are possible from these descriptions by those of ordinary skill in the art to which the present invention pertains.

Therefore, the spirit of the present invention should not be limited to the described embodiments, and not only the claims described below, but also all those with equivalent or equivalent modifications to the claims will be said to belong to the scope of the spirit of the present invention. .

110: electronic device
111: information storage unit 112: prediction unit
113: number selection unit 114: task execution unit
115: table maintenance unit 116: event generating unit
117: transfer history information generation unit 118: serial number division unit
119: operation code generation unit 120: hash value generation unit
121: information storage processing unit 122: information receiving unit
123: serial number re-division unit 124: operation code regeneration unit
125: history information restoration unit 126: information display unit
130: user
140: cloud storage server

Claims (12)

An electronic device that enables fast data transfer through scheduling for data transfer tasks, the electronic device comprising:
an information storage unit for storing information on the maximum number of threads that are preset to be simultaneously generated by the electronic device in order to perform a data transfer operation;
When a data transfer command instructing to migrate k (k is a natural number greater than or equal to 2) data stored in the preset first data store to the preset second data store is applied by the user, n threads are simultaneously created and Operation time required to process the data transfer operation - The operation required time is when the data transfer operation is processed from the first data storage to the second data storage by allocating the k data equally to the n threads Meaning the time required - By repeatedly performing the process for predicting n while increasing n by 1 from 1 to the maximum number of threads, predicting the time required for the task according to the number of threads that can be simultaneously created in the electronic device predictor;
a number selection unit for selecting the first number of threads for which the work required time is predicted to be the minimum from among the number of threads corresponding to 1 to the maximum number of threads that can be simultaneously created in the electronic device; and
When the first number of threads is selected, as many threads as the first number of threads are simultaneously created, the k data are equally allocated to the first number of threads, and then the number of threads equal to the first number of threads a task performing unit performing a data transfer operation for the k pieces of data from the first data store to the second data store by simultaneously executing
An electronic device comprising a. According to claim 1,
the prediction unit
When the data transfer command is applied by the user, by repeatedly performing the following steps (1) to (3) sequentially while increasing n by 1 from 1 to the maximum number of threads, in the electronic device The electronic device of claim 1, wherein the operation duration is predicted according to the number of threads that can be simultaneously created.
(1) After simultaneously creating n threads, a number of data corresponding to a preset sampling rate among the k data is sampled, and from the first data storage through any one of the n threads By processing the data transfer operation for the sampled data to the second data storage, a first time required to process the data transfer operation for the sampled data is calculated, and the first time is used for the sampled data By dividing by the number of , the average time taken to process the data transfer operation of each of the sampled data is calculated.
(2) Assuming that the data transfer operation is processed by allocating the k data equally to the n threads, the maximum number of data to be processed through one thread is calculated.
(3) By multiplying the average time by the maximum number of data, the time required for the task when the data transfer task is processed through the n threads is predicted. 3. The method of claim 2,
the prediction unit
In the step (2), the electronic device characterized in that the maximum number of data is calculated according to Equation 1 below.
[Equation 1]

where p is the maximum number of data,

is the ceiling function. According to claim 1,
The work execution unit
When the first number of threads is selected, the estimated first task required time for the first number of threads is displayed on the screen as the estimated work time required to process the data transfer task for the k pieces of data. then, by simultaneously creating as many threads as the first number of threads, allocating the k data equally to the threads as many as the first number of threads, and simultaneously executing the threads as many as the first number of threads, The data transfer operation for the k pieces of data is performed from the first data storage to the second data storage, and the time required for the first operation displayed on the screen is reversed, and the data transfer operation for the k pieces of data is performed. When all of the time required for the first task is exhausted before this is completed, the process of increasing the time required for the first task by a preset additional time and counting again is performed when the data transfer task for the k pieces of data is completed An electronic device, characterized in that it is repeatedly performed until According to claim 1,
a table holding unit for storing and maintaining a serial number table in which a serial number of preset different 2t (t is a natural number equal to or greater than 2) digits corresponding to each number of threads corresponding to the number of threads from 1 to the maximum number of threads;
an event generator generating, by the task execution unit, a history storage event for storing the transfer history information for the k pieces of data when the data transfer operation for the k pieces of data is completed;
When the history storage event occurs, information on the date and time at which the data transfer operation for the k pieces of data is completed, information on the actual time required to perform the data transfer operation on the k pieces of data, and source data a migration history information generator configured to generate first migration history information including storage information, identification information on the first data storage and target data storage information, and identification information on the second data storage;
When the first transfer history information is generated, a first serial number corresponding to the first number of threads is extracted from the serial number table, and the first serial number is based on a central axis of the first serial number, a serial number dividing unit dividing the first partial serial number of t digits on the left and the second partial serial number of t digits on the right side;
A t-bit first operation code is generated by composing a result value obtained when a modulo-2 operation is performed on each of the t numbers constituting the first partial serial number into a bit string, and an operation code generator generating a t-bit second operation code by configuring a result value obtained by performing a modulo-2 operation on each of the t numbers constituting the second partial serial number into a bit string;
By performing an exclusive-or (XOR) operation between the first operation code and the second operation code, a t-bit seed code is generated, and then the seed code is applied to a preset hash function as an input to obtain a first a hash value generator for generating a hash value;
When the first hash value is generated, after encrypting the first migration history information with the first hash value, the encrypted first migration history information and information on the number of the first threads in a preset cloud storage server an information storage processing unit that completes the process of storing the transfer history information for the k pieces of data by storing them in correspondence with each other;
After the encrypted first migration history information and information on the number of first threads are stored in the cloud storage server, when a display command for the first migration history information is applied by the user, the cloud storage server , an information receiving unit for receiving the encrypted first transfer history information and information on the number of the first threads;
When the encrypted first transfer history information and information on the number of first threads are received, the first serial number corresponding to the first number of threads is extracted from the serial number table, and the first serial number is , A serial number re-division unit dividing the first partial serial number of t digits on the left and the second partial serial number of t digits on the right with respect to the central axis of the first serial number;
The t-bit first operation code is generated by configuring a result value obtained when a modulo-2 operation is performed on each of the t numbers constituting the first partial serial number into a bit string, and the second operation code is generated. an operation code regenerating unit generating the t-bit second operation code by composing a result value obtained when a modulo-2 operation is performed on each of the t numbers constituting the partial serial number into a bit string;
The t-bit seed code is generated by performing an exclusive-OR operation between the first operation code and the second operation code, and the first hash value is generated by applying the seed code as an input to the hash function. , a history information restoration unit for restoring the first transfer history information by decrypting the encrypted first transfer history information into the first hash value; and
When the first transfer history information is restored, an information display unit for displaying the first transfer history information on a screen
An electronic device further comprising a. A method of operating an electronic device that enables fast data transfer through scheduling for data transfer tasks, the method comprising:
maintaining an information storage unit storing information on a maximum number of threads that are preset to be simultaneously generated by the electronic device in order to perform a data transfer operation;
When a data transfer command instructing to migrate k (k is a natural number greater than or equal to 2) data stored in the preset first data store to the preset second data store is applied by the user, n threads are simultaneously created and Operation time required to process the data transfer operation - The operation required time is when the data transfer operation is processed from the first data storage to the second data storage by allocating the k data equally to the n threads Meaning the time required - By repeatedly performing the process for predicting n while increasing n by 1 from 1 to the maximum number of threads, predicting the time required for the task according to the number of threads that can be simultaneously created in the electronic device to do;
selecting, from among the number of threads corresponding to 1 to the maximum number of threads that can be simultaneously created in the electronic device, the first number of threads for which the work required time is predicted to be the minimum; and
When the first number of threads is selected, as many threads as the first number of threads are simultaneously created, the k data are equally allocated to the first number of threads, and then the number of threads equal to the first number of threads performing a data migration operation for the k pieces of data from the first data storage to the second data storage by simultaneously executing
A method of operating an electronic device comprising a. 7. The method of claim 6,
The predicting step
When the data transfer command is applied by the user, by repeatedly performing the following steps (1) to (3) sequentially while increasing n by 1 from 1 to the maximum number of threads, in the electronic device The method of operating an electronic device, characterized in that predicting the time required for the operation according to the number of threads that can be simultaneously created.
(1) After simultaneously creating n threads, a number of data corresponding to a preset sampling rate among the k data is sampled, and from the first data storage through any one of the n threads By processing the data transfer operation for the sampled data to the second data storage, a first time required to process the data transfer operation for the sampled data is calculated, and the first time is used for the sampled data By dividing by the number of , the average time taken to process the data transfer operation of each of the sampled data is calculated.
(2) Assuming that the data transfer operation is processed by allocating the k data equally to the n threads, the maximum number of data to be processed through one thread is calculated.
(3) By multiplying the average time by the maximum number of data, the time required for the task when the data transfer task is processed through the n threads is predicted. 8. The method of claim 7,
The predicting step
In step (2), the method of operating an electronic device, characterized in that the maximum number of data is calculated according to Equation 1 below.
[Equation 1]

where p is the maximum number of data,

is the ceiling function. 7. The method of claim 6,
The performing step is
When the first number of threads is selected, the estimated first task required time for the first number of threads is displayed on the screen as the estimated work time required to process the data transfer task for the k pieces of data. then, by simultaneously creating as many threads as the first number of threads, allocating the k data equally to the threads as many as the first number of threads, and simultaneously executing the threads as many as the first number of threads, The data transfer operation for the k pieces of data is performed from the first data storage to the second data storage, and the time required for the first operation displayed on the screen is reversed, and the data transfer operation for the k pieces of data is performed. When all of the time required for the first task is exhausted before this is completed, the process of increasing the time required for the first task by a preset additional time and counting again is performed when the data transfer task for the k pieces of data is completed A method of operating an electronic device, characterized in that it is repeatedly performed until 7. The method of claim 6,
storing and maintaining a serial number table in which serial numbers of preset different 2t (t is a natural number equal to or greater than 2) digit number corresponding to each number of threads corresponding to 1 to the maximum number of threads are recorded;
generating a history storage event for storing migration history information for the k pieces of data when the data migration operation for the k pieces of data is completed by the performing;
When the history storage event occurs, information on the date and time at which the data transfer operation for the k pieces of data is completed, information on the actual time required to perform the data transfer operation on the k pieces of data, and source data generating first migration history information including identification information on the second data storage as information on the storage, identification information on the first data storage and information on the target data storage;
When the first transfer history information is generated, a first serial number corresponding to the first number of threads is extracted from the serial number table, and the first serial number is based on a central axis of the first serial number, dividing the first partial serial number of t digits on the left side and the second partial serial number of t digits on the right side;
A t-bit first operation code is generated by composing a result value obtained when a modulo-2 operation is performed on each of the t numbers constituting the first partial serial number into a bit string, and generating a t-bit second operation code by composing a result value obtained by performing a modulo-2 operation on each of the t numbers constituting the second partial serial number into a bit string;
By performing an exclusive-or (XOR) operation between the first operation code and the second operation code, a t-bit seed code is generated, and then the seed code is applied to a preset hash function as an input to obtain a first generating a hash value;
When the first hash value is generated, after encrypting the first migration history information with the first hash value, the encrypted first migration history information and information on the number of the first threads in a preset cloud storage server Completing the process of storing the transfer history information for the k pieces of data by storing them in correspondence with each other;
After the encrypted first migration history information and information on the number of first threads are stored in the cloud storage server, when a display command for the first migration history information is applied by the user, the cloud storage server , receiving the encrypted first transfer history information and information on the number of the first threads;
When the encrypted first transfer history information and information on the number of first threads are received, the first serial number corresponding to the first number of threads is extracted from the serial number table, and the first serial number is , dividing the first partial serial number of t digits on the left and the second partial serial number of t digits on the right with respect to the central axis of the first serial number;
The t-bit first operation code is generated by configuring a result value obtained when a modulo-2 operation is performed on each of the t numbers constituting the first partial serial number into a bit string, and the second operation code is generated. generating the t-bit second operation code by composing a result value obtained by performing a modulo-2 operation on each of the t numbers constituting the partial serial number into a bit string;
The t-bit seed code is generated by performing an exclusive-OR operation between the first operation code and the second operation code, and the first hash value is generated by applying the seed code as an input to the hash function. , restoring the first transfer history information by decrypting the encrypted first transfer history information into the first hash value; and
When the first transfer history information is restored, displaying the first transfer history information on a screen
The method of operating an electronic device further comprising a. A computer-readable recording medium recording a computer program for executing the method of any one of claims 6 to 10 through combination with a computer. A computer program stored in a storage medium for executing the method of any one of claims 6 to 10 through combination with a computer.

Images