Apparatus and method for parallel processing

• US 10,142,245 B2
• Filed: 06/13/2016
• Issued: 11/27/2018
• Est. Priority Date: 08/05/2015
• Status: Active Grant

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Choi, Kang-Il, Lee, Bhum-Cheol, Lee, Jung-Hee, Lee, Hyun-Yong
• Primary Examiner(s): Javaid, Jamal
• Application Number:
  US15/180,815
• Publication Number:
  US 20170041237A1
• Time in Patent Office: 897 Days
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 49/90 Buffering arrangements

Abstract

An apparatus for parallel processing according to an example may include a queue memory configured to store one or more queues, a data memory configured to store data, a mapper configured to classify the data into flows and store a pointer of the data in a queue mapped with the flow; a plurality of processors configured to perform a process based on the data; and a distributor configured to extract the data from the data memory by referring to the pointer stored in the queue and transmit the data to the processor, wherein the distributor transmits data corresponding to a single queue to a single processor.

Claims

1. An apparatus for parallel processing comprising:

a queue memory configured to store one or more queues,

a data memory configured to store data,

a mapper configured to classify the data into flows and store a pointer of the data in a queue mapped with the flow;

a table provider configured to store a flow table comprising queue information mapped with flow information;

a plurality of processors configured to perform a process based on the data; and

a distributor configured to extract the data from the data memory by referring to the pointer stored in the queue and transmit the data to the processor,

wherein the distributor transmits data corresponding to a single queue to a single processor, and

wherein the mapper maps each of the flows with a new queue or an activated queue based on the number of pointers stored in each activated queue and a predetermined critical value when the activated queue is not mapped with the flow by referring to the flow table.

2. The apparatus of claim 1,

wherein the mapper identifies the queue mapped with the flow by referring to the flow table.

3. The apparatus of claim 1, wherein the mapper maps the flow with the new queue when all of the number of pointers stored in each activated queue is higher than a predetermined critical value, and

wherein the mapper maps the flow with the activated queue when there is at least one activated queue of which the number of pointers is not higher than a predetermined critical value.

4. The apparatus of claim 3, further comprising a distributor manager configured to assign a distributor for the new queue when the mapper maps the flow with the new queue;

and a processor manager configured to assign a single processor for the new queue.

5. The apparatus of claim 3, wherein the mapper maps the flow with the queue where the least pointer is stored among the activated queues when there is at least one activated queue of which the number of pointers is not higher than a predetermined critical value and a mapping mode is a power saving mode.

6. The apparatus of claim 3, wherein the mapper maps the flow with the queue where the most pointer is stored among the activated queues when there is at least one activated queue of which the number of pointers is not higher than a predetermined critical value and a mapping mode is an even distribution mode.

7. A method for parallel processing in which an apparatus for parallel processing performs a parallel processing, the method comprising:

receiving data and storing the data in a data memory;

classifying the data into flows;

storing a pointer of the data in a queue which is mapped with the flow;

storing a flow table comprising queue information mapped with flow information;

extracting the data from the data memory by referring to the pointer stored in the queue and transmitting the data to a processor which is assigned for the queue; and

performing a process corresponding to the data using the processor assigned for the queue,

mapping each of the flows with a new queue or an activated queue based on the number of pointers stored in each activated queue and a predetermined critical value when the flow is not mapped with the activated queue by referring to the flow table.

8. The method of claim 7, further comprising identifying a queue mapped with the flow by referring to the flow table.

9. The method of claim 7, wherein the mapping the flow with a new queue or an activated queue based on the number of pointers stored in each activated queue and a predetermined critical value when the flow is not mapped with the activated queue by referring to the flow table, comprises:

mapping the flow with a new queue when flow information corresponding to the flow is not stored in the flow table and all of the number of pointers stored in each activated queue is higher than a predetermined critical value; and

mapping the flow with an activated queue when flow information corresponding to the flow is not stored in the flow table and there is at least one activated queue of which the number of pointers is not higher than a predetermined critical value.

10. The method of claim 9, further comprising assigning a distributor for the new queue when the flow is mapped with the new queue;

and assigning a single processor for the new queue.

11. The method of claim 9, wherein the mapping the flow with an activated queue when flow information corresponding to the flow is not stored in the flow table and there is at least one activated queue of which the number of pointers is not higher than a predetermined critical value, comprises mapping the flow with the queue where the least pointer is stored among the activated queues when a mapping mode is a power saving mode.

12. The method claim 9, wherein the mapping the flow with an activated queue when flow information corresponding to the flow is not stored in the flow table and there is at least one activated queue of which the number of pointers is not higher than a predetermined critical value, comprises mapping the flow with the queue where the most pointer is stored among the activated queues.