DATA PROCESSING APPARATUS FOR PIPELINE EXECUTION ACCELERATION AND METHOD THEREOF

• US 20150254116A1
• Filed: 02/09/2015
• Published: 09/10/2015
• Est. Priority Date: 03/04/2014
• Status: Active Grant

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: KIM, Kang-Ho, KOH, Kwang-Won, JEON, Seung-Hyub
• Granted Patent: US 9,804,903 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 9/54 Interprogram communication
• CPC Class Codes: G06F 9/544 Buffers; Shared memory; Pipes
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues

Abstract

Disclosed herein are a data processing apparatus for pipeline execution acceleration and a method thereof. According to an exemplary embodiment of the present invention, the data processing apparatus for pipeline execution acceleration includes: a processor configured to sequentially execute a first application program and a second application program reading or writing a specific file; and a file system configured to complete a write for a file data for the specific file to a data block previously allocated from the first application program and provide the file data for the specific file to the second application program prior to executing a close call for the specific file from the first application program, when executing a read call for the specific file from the second application program.

Claims

1. A data processing apparatus for pipeline execution acceleration, comprising:

a processor configured to sequentially execute a first application program and a second application program reading or writing a specific file; and

a file system configured to complete a write for a file data for the specific file to a data block previously allocated from the first application program and provide the file data for the specific file to the second application program prior to executing a close call for the specific file from the first application program, when executing a read call for the specific file from the second application program.

2. The data processing apparatus of claim 1, wherein the file system is implemented as a virtual ring type storage space configured of a data block in which some of the file data within the specific file are stored to use a circular queue in which a queue_tail representing a position for reading the file data within the ring type storage space and a queue_head representing a position for adding the file data are set.

3. The data processing apparatus of claim 2, wherein the file system sets a queue_index representing a start position of the circular queue at the time of executing the read call for the specific file from the second application program and reads a file data having a preset size from the set queue_index and then changes the queue_tail of the circular queue.

4. The data processing apparatus of claim 3, wherein the file system checks an offset and a size included in a received read request message in response to the read call and sets the queue_index using the offset when a size of the circular queue is larger than the size and the specific file is closed,

wherein the offset represents a value up to a position spaced apart from a start position of the specific file previously stored within the circular queue and the size represents a size of a data to be read.

5. The data processing apparatus of claim 3, wherein the queue_tail is obtained by the following Equation (queue_tail=(queue_tail+size) modulo queue_size), in which the queue_tail represents the queue_tail previously set within the circular queue, the size represents a size of data to be read, and the queue_size represents a size of the circular queue.

6. The data processing apparatus of claim 2, wherein the file system sets a queue_index representing a start position of the circular queue at the time of executing a write call for the specific file from the second application program and records a file data having a preset size from the set queue_index and then changes the queue_head of the circular queue.

7. The data processing apparatus of claim 6, wherein the file system checks an offset and a size included in a received write request message in response to the write call and sets the queue_index using the offset when the offset is included in an empty section of the circular queue and an available space of the circular queue is larger than the size,

wherein the offset represents a value up to a position spaced apart from a start position of the specific file previously stored within the circular queue and the size represents a size of a data to be read.

8. The data processing apparatus of claim 6, wherein the queue_head is obtained by the following Equation (queue_head=(queue_head+size) modulo queue_size), wherein the queue_head represents the queue_head previously set within the circular queue, the size represents a size of data to be read, and the queue_size represents a size of the circular queue.

9. The data processing apparatus of claim 1, wherein the file system includes:

a file system application programming interface (API) configured to perform write and read operations of the specific file at the time of executing the read call and the write call for the specific file;

a file state management module configured to update previously generated call information at the time of executing the read call and the write call for the specific file and provide the call information to allow the file system API to perform the read and write operations for the specific file; and

a file storage management module configured to manage the file data for the specific file and read or write the file data at the time of executing the read call and the write call from the first and second application programs.

10. A data processing method for pipeline execution acceleration, comprising:

sequentially executing, by a processor, a first application program and a second application program reading or writing a specific file; and

completing a write for a file data for the specific file to a data block previously allocated from the first application program and providing the file data for the specific file to the second application program prior to executing a close call for the specific file from the first application program, when a file system executes a read call for the specific file from the second application program.

11. The data processing method of claim 10, wherein in the providing, the file system provides the file data for the specific file stored in the data block within a circular queue to the second application program, wherein the circular queue is implemented as a virtual ring type storage space configured of a data block in which some of the file data within the specific file are stored to use a circular queue in which a queue_tail representing a position for reading the file data within the ring type storage space and a queue_head representing a position for adding the file data are set.

12. The data processing method of claim 11, wherein in the providing, a queue_index representing a start position of the circular queue is set at the time of executing the read call for the specific file from the second application program and

a file data having a preset size from the set queue_index is read and then the queue_tail of the circular queue is changed.

13. The data processing method of claim 12, wherein in the providing, an offset and a size included in a received read request message are checked in response to the read call and the queue_index is set using the offset when a size of the circular queue is larger than the size and the specific file is closed,

wherein the offset represents a value up to a position spaced apart from a start position of the specific file previously stored within the circular queue and the size represents a size of a data to be read.

14. The data processing method of claim 12, wherein the queue_tail is obtained by the following Equation (queue_tail=(queue_tail+size) modulo queue_size), in which the queue_tail represents the queue_tail previously set within the circular queue, the size represents a size of data to be read, and the queue_size represents a size of the circular queue.

15. The data processing method of claim 11, wherein in the providing, a queue_index representing a start position of the circular queue is set at the time of executing a write call for the specific file from the second application program and

a file data having a preset size from the set queue_index is recorded and then the queue_head of the circular queue is changed.

16. The data processing method of claim 15, wherein in the providing, an offset and a size included in a received write request message are checked in response to the write call and the queue_index is set using the offset when the offset is included in an empty section of the circular queue and an available space of the circular queue is larger than the size,

wherein the offset represents a value up to a position spaced apart from a start position of the specific file previously stored within the circular queue and the size represents a size of a data to be read.

17. The data processing method of claim 15, wherein the queue_head is obtained by the following Equation (queue_head=(queue_head+size) modulo queue_size), in which the queue_head represents the queue_head previously set within the circular queue, the size represents a size of data to be read, and the queue_size represents a size of the circular queue.