WO2019107955A1 - Optimization method for shortening time for distributed transcoding and system therefor - Google Patents

Abstract

An optimization method for shortening time for distributed transcoding and a system therefor are disclosed. A distributed transcoding method comprises the steps of: splitting image content into segments of a fixed interval and allocating the split segments to a plurality of workers; receiving encoded segments from each worker and storing the received segments in a storage; and concatenating the segments stored in the storage in order and merging same into one encoding file.

Description

Optimization method and system for time reduction of distributed transcoding

The following description relates to techniques for handling distributed transcoding.

With the recent expansion of video-on-demand systems and video services of various kinds of portals, there is an increasing need to transcode (encode) video contents in accordance with a service providing system.

Generally, a video service provider places a separate encoding server for encoding and transcoding through a compression algorithm (for example, MPEG2 or H.264).

For example, Korean Patent Laid-Open Publication No. 10-2005-0091369 (published on September 15, 2005) discloses a technique for converting a video coded in one format into another video coding format.

The encoding system encodes only one video file in one encoding server, especially since the encoding of high-quality video takes a considerable CPU load.

Due to this configuration, when real-time broadcast contents are to be provided as an on-demand video service, the demand for a quick service is disrupted. In the existing video service, it does not provide smooth service due to an increase in the time required for encoding and transcoding.

And provides an optimization technique for shortening the time of a distributed transcoder that performs parallel transcoding by dividing the original image into segments of a predetermined interval.

And to provide a method and system that can shorten the time to send encoded segments from each worker to storage for segment merging.

And provide a method and system that allows each walker to concatenate and merge encoded segments more quickly.

A distributed transcoding method performed in a computer-implemented server, the method comprising the steps of: dividing image content into segments of a predetermined interval, and allocating segmented segments to a plurality of workers; Receiving an encoded segment from each worker and storing the received segment in storage; And concatenating the segments stored in the storage in order and merging them into one encoded file.

According to an aspect of the present invention, each worker can transmit an encoded data unit to the server at the time when the encoding of each of the data units constituting the segment is completed with respect to the allocated segment.

According to another aspect, the data unit may be a unit that performs encoding in one unit in the worker.

According to another aspect of the present invention, each worker can transmit an entire encoded segment file to the server at the time when encoding of the entire segment file is completed with respect to the allocated segment.

According to another aspect of the present invention, the merging step may sequentially read the stored segments one by one in the storage and perform a connection operation.

According to another aspect, the merging step may preload the at least some segments stored in the storage in the temporary memory for the connection operation, and sequentially connect the preloaded segments to the temporary memory.

According to another aspect, the merging step may include determining the number of segments to be preloaded considering the number of concurrent encodings currently in progress and the available memory size.

According to another aspect, the merging step may include determining whether to perform additional preloading and scaling each time a connection operation for one segment is completed.

According to another aspect, the allocating step may include dividing the image content into segments of a group of pictures (GOP), or dividing the image contents into a minimum unit segment determined through a preliminary experiment.

According to another aspect, the allocating step may include allocating a segment according to a priority using at least one of the number of co-available encoders and the idle time of the worker.

There is provided a computer-readable recording medium having recorded thereon a program for causing a computer to execute the distributed transcoding method.

What is claimed is: 1. A distributed transcoding system in a computer-implemented server, the system comprising: at least one processor configured to execute computer-readable instructions contained in a memory, the at least one processor comprising: Assigning the segmented segments to a plurality of walkers; Receiving an encoded segment from each worker and storing the received segment in storage; And merging the segments stored in the storage into a single encoded file in order.

According to embodiments of the present invention, it is possible to maximize distributed encoding performance through an optimized concatenation process by quickly gathering encoded segments.

According to embodiments of the present invention, it is possible to shorten the time for transmitting the segment encoded in each worker to storage for segment merging.

According to embodiments of the present invention, the segments encoded in each worker can be connected and merged more quickly.

1 is a diagram illustrating an example of a network environment according to an embodiment of the present invention.

2 is a block diagram for explaining an internal configuration of an electronic device and a server in an embodiment of the present invention.

3 is a flow chart illustrating a distributed transcoding method in an embodiment of the present invention.

4 is a diagram illustrating an example of a component that may be included in a distributed transcoding system according to an embodiment of the present invention.

5 is an exemplary diagram for explaining a process of dividing and distributing an original image according to an embodiment of the present invention.

6 is an exemplary diagram for explaining a process of merging encoded segments into one encoding result in an embodiment of the present invention.

7 to 8 are exemplary diagrams illustrating a process of transmitting an encoded segment in a worker in an embodiment of the present invention.

9 to 10 are exemplary diagrams illustrating a process of connecting encoded segments in an embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Embodiments of the present invention relate to a distributed transcoder, and more particularly, to a method and system for performing parallel transcoding by dividing an image into segments for further improved time.

Embodiments including those specifically disclosed herein achieve significant advantages in terms of time improvement, cost savings, resiliency, efficiency, rationality, etc. through distributed transcoding.

1 is a diagram illustrating an example of a network environment according to an embodiment of the present invention. 1 shows an example in which a plurality of electronic devices 110, 120, 130, 140, a plurality of servers 150, 160, and a network 170 are included. 1, the number of electronic devices and the number of servers are not limited to those shown in FIG.

The plurality of electronic devices 110, 120, 130, 140 may be a fixed terminal implemented as a computer device or a mobile terminal. Examples of the plurality of electronic devices 110, 120, 130 and 140 include a smart phone, a mobile phone, a navigation device, a computer, a notebook, a digital broadcast terminal, a PDA (Personal Digital Assistants) ), A tablet PC, a game console, a wearable device, an Internet of things (IoT) device, a virtual reality (VR) device, and an augmented reality (AR) device. For example, FIG. 1 illustrates the shape of a smartphone as an example of the first electronic device 110, but in the embodiments of the present invention, the first electronic device 110 transmits the network 170 using a wireless or wired communication method. Or any of a variety of physical computer devices capable of communicating with other electronic devices 120, 130, 140 and / or servers 150,

The communication method is not limited and includes a communication method using a communication network (for example, a mobile communication network, a wired Internet, a wireless Internet, a broadcasting network, a satellite network, etc.) . For example, the network 170 may be a personal area network (LAN), a local area network (LAN), a campus area network (CAN), a metropolitan area network (MAN), a wide area network (WAN) , A network such as the Internet, and the like. The network 170 may also include any one or more of a network topology including a bus network, a star network, a ring network, a mesh network, a star-bus network, a tree or a hierarchical network, It is not limited.

Each of the servers 150 and 160 is a computer device or a plurality of computers that communicate with a plurality of electronic devices 110, 120, 130 and 140 through a network 170 to provide commands, codes, files, Lt; / RTI > devices. For example, the server 150 may be a system that provides a first service to a plurality of electronic devices 110, 120, 130, 140 connected through a network 170, 170, and 140 to the first and second electronic devices 110, 120, 130, and 140, respectively. More specifically, the server 150 may provide a service (for example, a video service or the like) for a corresponding application through an application as a computer program installed in a plurality of electronic apparatuses 110, 120, 130, As a single service, to a plurality of electronic devices 110, 120, 130, and 140. As another example, the server 160 may provide a service for distributing a file for installing and running the application to the plurality of electronic devices 110, 120, 130, and 140 as a second service.

2 is a block diagram for explaining an internal configuration of an electronic device and a server in an embodiment of the present invention. 2 illustrates an internal configuration of the electronic device 1 (110) and the server 150 as an example of the electronic device. Other electronic devices 120, 130, 140 and server 160 may also have the same or similar internal configuration as electronic device 1 110 or server 150 described above.

The electronic device 1 110 and the server 150 may include memories 211 and 221, processors 212 and 222, communication modules 213 and 223 and input / output interfaces 214 and 224. The memories 211 and 221 are non-transitory computer readable recording media and can be used to store non-transient computer readable media such as random access memory (RAM), read only memory (ROM), disk drive, solid state drive (SSD), flash memory And may include a permanent mass storage device. The non-decaying mass storage device such as a ROM, an SSD, a flash memory, a disk drive, or the like may be included in the electronic device 110 or the server 150 as a separate persistent storage device separate from the memories 211 and 221. The memory 211 and the memory 221 are provided with an operating system and at least one program code (for example, a program installed in the electronic device 1 (110) and used for a browser or an application installed in the electronic device 1 Code) can be stored. These software components may be loaded from a computer readable recording medium separate from the memories 211 and 221. [ Such a computer-readable recording medium may include a computer-readable recording medium such as a floppy drive, a disk, a tape, a DVD / CD-ROM drive, and a memory card. In other embodiments, the software components may be loaded into memory 211, 221 via communication modules 213, 223 rather than a computer readable recording medium. For example, at least one program may be a computer program installed by files provided by a file distribution system (e.g., the server 160 described above) that distributes installation files of developers or applications, May be loaded into the memory 211, 221 based on the application (e.g., the application described above).

Processors 212 and 222 may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input / output operations. The instructions may be provided to the processors 212 and 222 by the memories 211 and 221 or the communication modules 213 and 223. For example, the processor 212, 222 may be configured to execute a command received in accordance with a program code stored in a recording device, such as the memory 211, 221.

The communication modules 213 and 223 may provide functions for the electronic device 1 110 and the server 150 to communicate with each other through the network 170 and may be provided to the electronic device 1 110 and / May provide a function for communicating with another electronic device (e.g., electronic device 2 120) or another server (e.g., server 160). The request generated by the processor 212 of the electronic device 1 110 according to the program code stored in the recording device such as the memory 211 is transmitted to the server 170 via the network 170 under the control of the communication module 213 150 < / RTI > Conversely, control signals, commands, contents, files, and the like provided under the control of the processor 222 of the server 150 are transmitted to the communication module 223 of the electronic device 110 via the communication module 223 and the network 170 213 to the electronic device 1 (110). For example, control signals, commands, contents, files, and the like of the server 150 received through the communication module 213 can be transmitted to the processor 212 or the memory 211, (The above-mentioned persistent storage device), which may further include a storage medium 110.

The input / output interface 214 may be a means for interfacing with the input / output device 215. For example, the input device may include a device such as a keyboard, a mouse, a microphone, a camera, and the like, and the output device may include a device such as a display, a speaker, a haptic feedback device, As another example, the input / output interface 214 may be a means for interfacing with a device having integrated functions for input and output, such as a touch screen. The input / output device 215 may be composed of the electronic device 1 (110) and one device. The input / output interface 224 of the server 150 may be a means for interfacing with the server 150 or an interface with a device (not shown) for input or output that the server 150 may include. More specifically, when the processor 212 of the electronic device 1 (110) processes the command of the computer program loaded in the memory 211, the configuration is performed using the data provided by the server 150 or the electronic device 2 (120) A service screen or contents can be displayed on the display through the input / output interface 214. [

Also, in other embodiments, electronic device 1 110 and server 150 may include more components than the components of FIG. However, there is no need to clearly illustrate most prior art components. For example, electronic device 1 110 may be implemented to include at least a portion of input / output devices 215 described above, or may be implemented with other components such as a transceiver, Global Positioning System (GPS) module, camera, Elements. More specifically, when the electronic device 1 (110) is a smart phone, the acceleration sensor, the gyro sensor, the camera module, various physical buttons, buttons using a touch panel, input / output ports, A vibrator, and the like may be further included in the electronic device 1 (110).

Hereinafter, specific embodiments of the distributed transcoding method and the distributed transcoding system will be described.

3 is a flow chart illustrating a basic process for distributed transcoding in one embodiment of the present invention.

The server 150 according to the present embodiment serves as a platform for providing a moving image service to a plurality of electronic devices 110, 120, 130, and 140 which are clients. The server 150 can provide a moving image service in cooperation with an application installed on the electronic devices 110, 120, 130 and 140.

The server 150 may include a processor 222 as a component for performing the distributed transcoding method according to FIG. In accordance with an embodiment, the processor 222 may be separated into two or more components for presentation of the functionality of the processor 222.

Such a processor 222 may control the server 150 to perform the steps S301 to S303 that are included in the distributed transcoding method of FIG. For example, the processor 222 may be implemented to execute instructions in accordance with the code of the operating system and the code of at least one program that the memory 221 contains.

The distributed transcoding method according to the present invention is performed by the server 150. As shown in FIG. 3, basically, a split process (S301) of dividing an original image into segments of a predetermined interval (S301) A transcoding process (S302), and a process of merging the transcoded segments into a single encoded file (S303).

4 is a diagram illustrating an example of a component that may be included in a distributed transcoding system according to an embodiment of the present invention.

4, the distributed transcoding system 400 is a component for distributed transcoding, and includes a controller 410, a splitter & merge 420, and an encoding / (Not shown). For example, the control unit 410 and the splitting and merging unit 420 may be included in the processor 222 of the server 150 described with reference to FIG. 1 and FIG. The encoding unit 430 includes a worker which is a unit transcoder for performing an encoding task and each of the walkers is a separate computer device connected to the server 150 and is connected to the division and merging unit 420 It acts as an encoding server to perform assigned tasks.

The control unit 410 manages the overall state of the encoding operation. The control unit 410 may control the encoding operation required to provide the moving picture service corresponding to the request of the electronic apparatuses 110, 120, 130,

The splitting and merging unit 420 is responsible for distributed transcoding as a distribution subject. Specifically, the dividing and merging unit 420 divides the original image into segments of an appropriate size for the encoding task requested by the control unit 410, distributes the divided images to the walkers corresponding to the encoding unit 430, And merge them into one encoding result.

Each of the walkers performs an encoding operation on the segment received from the segmenting and merging unit 420 and transmits the segmented segment to the segmenting and merging unit 420 again.

5 is an exemplary diagram for explaining a process of dividing and distributing an original image according to an embodiment of the present invention.

5, the dividing and merging unit 420 may divide the original image 501 into a plurality of segments S_0, S_1, S_2, ..., S_N 503 having appropriate sizes. For example, the dividing and merging unit 420 may divide the original image 501 into segments 503 of group of pictures (GOP). In other words, the dividing and merging unit 420 divides the original image 501 based on the GOP boundary of the image. If the GOP size of the original image 501 is large, the size of the segment 503 increases. As another example, the dividing and merging unit 420 may divide the original image 501 based on a division unit (for example, 4 seconds) of a predetermined size. If the length of the segment 503 is too short, an increase in the number of segments 503 leads to an increase in encoding overhead. On the other hand, if the length of the segment 503 is too long, the difference in encoding completion time between walkers increases, that is, the encoding load is not distributed evenly across the walkers, resulting in a longer total encoding time. It is possible to determine an appropriate length by minimizing the overhead incurred in the encoding process and to distribute the encoding load evenly to all the workers, and divides the original image 501 with the determined length as a division unit. As another example, the dividing and merging unit 420 basically divides the original image 501 into GOP units and divides the length of the GOP unit into a plurality of GOP units The original image 501 can be divided into a minimum unit determined by experiment rather than a GOP unit.

The dividing and merging unit 420 divides the segments S_0, S_1, S_2, ..., S_N 503 into worker_0, worker_1, worker_2, ..., worker_M N). At this time, the dividing and merging unit 420 allocates the walkers (Worker_0, Worker_1, Worker_2, ..., Worker_M) of the encoding performing unit 430 to the segments S_0, S_1, S_2, And may follow priorities of predetermined criteria. For example, the partitioning and merging unit 420 may first allocate a worker having the maximum number of simultaneous encoding available. Since each walker may have a different number of encodings at a time, you can assign the walkers in the order of the number of encodings available. It is a good idea to evenly distribute segments across all worker equipment. As the number of simultaneous encodings performed on one device increases, the overall encoding speed increases, but the encoding speed per segment becomes slower. Therefore, it is important to avoid the situation where the segment is concentrated on the worker of a specific equipment when allocating the segment to the walker, in order to keep the encoding speed at an optimal state. As another example, the partitioning and merging unit 420 may first allocate a worker having the longest idle time. The walkers can be allocated in the order of the long waiting time in consideration of the waiting time in which the latest segment is not allocated. As another example, it is also possible that the dividing and merging unit 420 allocates the walkers considering the number of available encodings and the idle time. For example, a worker with the largest idle time can be assigned if the number of available encodings is the same and the number of available encodings is the same.

6 is an exemplary diagram for explaining a process of merging encoded segments into one encoding result in an embodiment of the present invention.

6, the segmentation and merging unit 420 includes a segment receiver 601, a local storage 602, and a concatenator 603 as components for merging. . ≪ / RTI >

The segment receiving unit 601 receives a segment encoded from each worker (Worker_0, Worker_1, Worker_2, ..., Worker_M) to which segments (S_0, S_1, S_2, ..., S_N) 503 of the original image 501 are assigned It plays a role.

In order to connect the segments encoded in each worker (Worker_0, Worker_1, Worker_2,..., Worker_M) at the connection unit 603, a process of collecting them into one storage 602 is required.

The segment receiving unit 601 stores the segment file received from each worker (Worker_0, Worker_1, Worker_2, ..., Worker_M) in the local storage 602. [ A data packet corresponding to a moving picture can be separately encoded into a video stream V and an audio stream A, respectively, and a segment file for the video stream and a segment file for the audio stream are stored in the local storage 602 Can be stored separately.

The connection unit 603 can create an encoded result packet (i.e., a concatenated file) by connecting the segment files stored in the local storage 602 in the segment order based on the segment division information for the original image 501. [ At this time, the connection unit 603 may interleave the segment file for the video stream and the segment file for the audio stream in a temporally interleaved manner, and store the encoded file as a result in the local storage 602 have.

In the present embodiment, both the video stream and the audio stream are described as distributed encoding, but in some cases it is also possible to process the audio stream in a single encoding and the video stream in a distributed encoding.

Therefore, in the present invention, the original image 501 is divided into segments 503 having a constant interval, and parallel transcoding using a plurality of walkers is performed, thereby improving the overall encoding time and distributed encoding performance for a moving picture service.

A specific embodiment of the optimization part will be described for a better time improvement of the distributed transcoding.

In order to connect segments encoded in each worker (Worker_0, Worker_1, Worker_2, ..., Worker_M) in the connection unit 603, it is necessary to collect the encoded segments in one storage 602. In this process, ) Can be optimized.

FIG. 7 shows an example of a process of transmitting an encoded segment.

7, in each of the worker (Worker_0, Worker_1, Worker_2) to which the segments (S_0, S_1, S_2) are assigned, the encoded segment files (E_S_0, E_S_1, E_S_2) To the splitting and merging unit 420. [ In other words, each worker (Worker_0, Worker_1, Worker_2) splits and merges segment files (E_S_0, E_S_1, E_S_2) encoded with a transmission control protocol (TCP) at the completion of encoding the entire segment file ). At this time, the segment receiving unit 601 receives the segment files E_S_0, E_S_1, and E_S_2 encoded from the walkers (Worker_0, Worker_1, and Worker_2) to which the segments S_0, S_1 and S_2 are assigned and stores them in the local storage 602 do.

FIG. 8 shows another example of a process of transmitting an encoded segment.

8, each worker (Worker_0, Worker_1, Worker_2) to which the segments (S_0, S_1, S_2) are assigned transmits the encoding file to the segmenting and merging unit 420, (801). In this case, the data unit 801 means a unit for performing encoding in units of one unit by a worker. For example, in the case of video data, a frame may be a data unit 801. [

The worker (Worker_0, Worker_1, and Worker_2) does not transmit the entire segmented encoded file at the time of completion of the encoding of the entire segment file, but at the time when encoding of each data unit 801 constituting the segment is completed, Data unit. In other words, the worker (Worker_0, Worker_1, Worker_2) transmits the encoded data unit 801 to the splitting and merging unit 420 when the encoding of the data unit 801 of the corresponding segment file is completed send. For example, when a segment S_0 composed of four frames 0a, 0b, 0c, and 0d is assigned to a worker Worker_0 as shown in Fig. 8, the worker Worker_0 sequentially encodes the frames 0a, 0b, 0c, and 0d of the segment S_0 And immediately transmits the encoded frame every time the encoding is completed.

The transmission of the encoded data units 801 is performed in parallel by a plurality of workers (Worker_0, Worker_1, and Worker_2). When the encoding file is transmitted in the data unit 801, the time required for all the segments of the original image 501 to converge on the local storage 602 can be further improved as compared with a method in which the encoding file is transmitted in the segment unit.

When all of the encoded segments are collected for the original image 501, an operation for connecting the encoded segments is performed. In this process, it is also possible to optimize for connecting the encoded segments quickly.

The connection unit 603 can create a single encoding result by connecting the segment files stored in the local storage 602 in the order of the segments based on the segmentation information for the original image 501. [ Segment linking operations must be performed in order of segment. However, since the encoding time differs for each segment according to the complexity of the image and the server situation, the time for storing the encoded segment in the local storage 602 may be different from the segment order.

FIG. 9 shows an example of a process of connecting encoded segments.

The connection unit 603 reads the segments arriving at the local storage 602 (i.e., stored) one by one in the order of the segments, and performs a connection operation.

9, when the remaining segments except for the 6th, 14th and 22nd segments arrive at the local storage 602 with respect to the original image 501 divided into 28 segments 503, Reads the first to fifth segments from the local storage 602 first and connects them in order and holds the connection operation until the sixth segment arrives. If the sixth segment arrives, it is stored in the local storage 602, Read them one by one and restart the connection.

FIG. 10 shows another example of a process of linking an encoded segment.

10, the connection unit 603 pre-loads at least some of the segments arriving (i.e., stored) in the local storage 602 into the temporary memory 1001, that is, the preloading window, regardless of the segment order (Parallel preloading process). 10, when the remaining segments except for the 6th, 14th and 22nd segments arrive at the local storage 602 with respect to the original image 501 divided into 28 segments 503, A segment arriving at the local storage 602 is placed in the temporary memory 1001 for connection and the segment on the temporary memory 1001 is connected in order of segment. At this time, when the sixth segment is not received, the segment is read and connected when the segment arrives, and since the segments are previously loaded in the temporary memory 1001, the connection operation of the next segments can proceed more quickly.

Accordingly, in the present invention, the encoding result can be quickly generated by performing a connection operation using a method of previously loading the encoded segment into the temporary memory 1001. [

The preloading scale can be appropriately adjusted according to the memory status of the segmenting and merging unit 420. [ The segmenting and merging unit 420 determines whether additional preloading and preloading are performed each time segment transfer from each worker is completed, or when one preloaded segment is exhausted (i.e., when a connection operation for one segment is completed) The loading scale can be determined. At this time, the dividing and merging unit 420 may determine the preloading scale, that is, the number of segments to be preloaded, considering the number of concurrent encodings currently in progress and the available memory size.

For example, if the preloaded_count of the preloaded segments is less than the preloading count of the preloadable segment, the segmentation and merge unit 420 may preload the segment by the difference (preloading_count-preloaded_count) have. For example, the final number of preloadable segments (preloading_count) can be calculated by Equation (1).

[Equation 1]

preloading_count = MIN (preloading_count_max average_segment_size, available_memory) / average_segment_size

Where MIN (a, b) is the minimum value of a and b, and available_memory is the current available memory size (bytes).

In Equation (1), preloading_count_max denotes the maximum number of segments that can be preloaded, and can be calculated, for example, by Equation (2).

&Quot; (2) "

preloading_count_max = worker_count × concurrent_encoding_per_worker × (concurrent_encoding_max-concurrent_encoding_count)

Herein, worker_count is the number of currently assigned worker, concurrent_encoding_per_worker is the number of simultaneous encodings per worker, concurrent_encoding_max is the maximum number of simultaneous encodings available in the dividing and merging unit 420, and concurrent_encoding_count is currently being divided and merged ≪ / RTI >

In Equation (1), average_segment_size denotes an expected average size of an encoded segment, and can be calculated, for example, by Equation (3).

&Quot; (3) "

average_segment_size = average_segment_second × target_bitrate × α

Here, average_segment_second is the average length (in seconds) of the segment, target_bitrate is the target bit rate (bits), and? Is a constant.

Accordingly, the dividing and merging unit 420 can determine the preloading size in consideration of the current number of simultaneous encodings and the available memory size, and can perform the connection operation more quickly through the segment preloading of the determined size.

As described above, according to the embodiments of the present invention, it is possible to improve the overall encoding time and the distributed encoding performance for the moving picture service by quickly collecting the encoded segments and performing the connection operation.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented as a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA), a programmable logic unit, a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be embodied in any type of machine, component, physical device, computer storage media, or device for interpretation by a processing device or to provide instructions or data to the processing device have. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. At this time, the medium may be a program that continuously stores a computer executable program, or temporarily stores the program for execution or downloading. Further, the medium may be a variety of recording means or storage means in the form of a combination of a single hardware or a plurality of hardware, and is not limited to a medium directly connected to a computer system, but may be dispersed on a network. Examples of the medium include a magnetic medium such as a hard disk, a floppy disk and a magnetic tape, an optical recording medium such as CD-ROM and DVD, a magneto-optical medium such as a floptical disk, And program instructions including ROM, RAM, flash memory, and the like. As another example of the medium, a recording medium or a storage medium that is managed by a site or a server that supplies or distributes an application store or various other software is also enumerated.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

Claims (20)

1. A distributed transcoding method performed on a computer-implemented server,

   A step of dividing the image contents into segments of a predetermined interval and allocating the segmented segments to a plurality of workers;

   Receiving an encoded segment from each worker and storing the received segment in storage; And

   Linking the segments stored in the storage in order and merging them into one encoding file

   / RTI >
2. The method according to claim 1,

   Each worker transmits an encoded data unit to the server at the time when the encoding of each of the data units constituting the segment is completed for the allocated segment

   And a second transcoding method.
3. 3. The method of claim 2,

   The data unit is a unit for performing encoding in one unit in the worker

   And a second transcoding method.
4. The method according to claim 1,

   Each worker transmits an entire encoded segment file to the server at the time when encoding of the entire segment file is completed for the allocated segment

   And a second transcoding method.
5. The method according to claim 1,

   Wherein the merging comprises:

   And sequentially reading the stored segments one by one in the storage and performing a connection operation

   And a second transcoding method.
6. The method according to claim 1,

   Wherein the merging comprises:

   Preloading at least some segments stored in the storage into a temporary memory for a connection operation and connecting the preloaded segments to the temporary memory sequentially

   And a second transcoding method.
7. The method according to claim 6,

   Wherein the merging comprises:

   Determining the number of segments to be preloaded considering the number of concurrent encodings currently in progress and the available memory size

   / RTI >
8. The method according to claim 6,

   Wherein the merging comprises:

   Determine whether additional preloading and sizing each time a connection to a segment is completed

   / RTI >
9. The method according to claim 1,

   Wherein the assigning comprises:

   Dividing the image content into segments of a group of pictures (GOP) or dividing the image contents into a minimum unit segment determined through a preliminary experiment

   / RTI >
10. The method according to claim 1,

    Wherein the assigning comprises:

    Allocating a segment according to a priority using at least one of the number of simultaneously available encoders and idle time of the worker

    / RTI >
11. A computer-readable recording medium on which a program for causing a computer to execute the distributed transcoding method according to any one of claims 1 to 10 is recorded.
12. A distributed transcoding system in a computer-implemented server,

    At least one processor configured to execute computer readable instructions contained in memory,

    Lt; / RTI >

    Wherein the at least one processor comprises:

    A step of dividing the image contents into segments at predetermined intervals and allocating the segmented segments to a plurality of walkers;

    Receiving an encoded segment from each worker and storing the received segment in storage; And

    A process of merging the segments stored in the storage into a single encoding file

    To a distributed transcoding system.
13. 13. The method of claim 12,

    Each worker transmits an encoded data unit to the server at the time when the encoding of each of the data units constituting the segment is completed for the allocated segment

    Wherein the transcoding system is a distributed transcoding system.
14. 14. The method of claim 13,

    The data unit is a unit for performing encoding in one unit in the worker

    Wherein the transcoding system is a distributed transcoding system.
15. 13. The method of claim 12,

    The merging process includes:

    And sequentially reading the stored segments one by one in the storage and performing a connection operation

    Wherein the transcoding system is a distributed transcoding system.
16. 13. The method of claim 12,

    The merging process includes:

    Loading at least some segments stored in the storage into a temporary memory for a connection operation and sequentially connecting the preloaded segments to the temporary memory

    Wherein the transcoding system is a distributed transcoding system.
17. 17. The method of claim 16,

    The merging process includes:

    The process of determining the number of segments to be preloaded considering the number of concurrent encodings currently in progress and the available memory size

    / RTI >
18. 17. The method of claim 16,

    The merging process includes:

    The process of determining whether additional preloading and sizing each time a connection to a segment is completed

    / RTI >
19. 13. The method of claim 12,

    Wherein the allocating step comprises:

    Dividing the image content into segments of GOP units or dividing the image contents into segments of a minimum unit determined through a preliminary experiment

    / RTI >
20. 13. The method of claim 12,

    Wherein the allocating step comprises:

    A process of assigning a segment according to a priority using at least one of the number of simultaneous usable encoders and the idle time

    / RTI >

Images