CN102156659A - Scheduling method and system for job task of file - Google Patents
Scheduling method and system for job task of file Download PDFInfo
- Publication number
- CN102156659A CN102156659A CN2011100753553A CN201110075355A CN102156659A CN 102156659 A CN102156659 A CN 102156659A CN 2011100753553 A CN2011100753553 A CN 2011100753553A CN 201110075355 A CN201110075355 A CN 201110075355A CN 102156659 A CN102156659 A CN 102156659A
- Authority
- CN
- China
- Prior art keywords
- node
- load
- file
- data block
- job task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a scheduling method for a job task of a file, which comprises the following steps of: searching nodes where a plurality of data blocks of a file needed to carry out the job task are located; calculating loads produced by the file on the nodes where respective data blocks are located and operation loads of the nodes; comparing the operation loads of the nodes, and acquiring a node with the lightest load as a preset node; and scheduling the job task to be carried out on the preset node when the sum of the load produced by the file on the preset node and the operation load of the preset node is smaller than the threshold of a set load. When the method provided in the application is adopted, the system can distribute the job task to be carried out on the calculated preset node when the task is delivered in the file, and therefore the local property of data is met to the maximum extent, the increase of IO (Input/Output) expense due to data movement during the parallel execution of tasks is reduced, and the loads of the system are more balanced.
Description
Technical field
The application relates to the Distributed Calculation field, particularly relates to a kind of dispatching method and system of file job task.
Background technology
MapReduce is by the invention of Google company, is a kind of emerging Parallel Programming Models.It is placed on parallelization, fault-tolerant, DATA DISTRIBUTION, load balancing etc. in the storehouse, system all is summed up as two step: Map (mapping) stages and Reduce (abbreviation) stage to all operations of data, make the developer of those few of parallel computation experiences also can develop parallel the application, to carry out parallel processing to mass data.
When using the MapReduce model to carry out the parallel computation of large-scale data, in the Map stage, need split into a plurality of Map tasks for a MapReduce operation (being user's a computation requests) is distributed on a plurality of nodes and carries out, adopt mobile process (a Map task) to finish calculating, cause the IO of system expense to reduce mobile process to node.
The data acquisition that the MapReduce operation needs in the process of implementation is called file, a file is divided into a plurality of parts and stores, divide the unit data that comes out and be called data block, and in order to prevent dropout of data block, each data block also is provided with a plurality of copy data pieces simultaneously, data block is identical with the function of its a plurality of copy data pieces, and described data block store is on a plurality of back end, and a Map task in the MapReduce task is carried out on a data block.
Because data block is dispersed on a plurality of different pieces of information nodes, and the Map task also needs to be distributed to a plurality of different pieces of information nodes execution, so exist different Map tasks to be distributed to the data block required, cause the increase of IO expense in the task implementation not in the situation of same node with it.
Summary of the invention
For solving the problems of the technologies described above, the embodiment of the present application provides a kind of dispatching method and system of file job task, makes to the MapReduce job scheduling time, and the node at a Map task execution place also is that it calculates desired data place node; Reduced the increase that data moved the IO expense that causes when task is concurrent to be carried out.
Technical scheme is as follows:
A kind of dispatching method of file job task comprises:
Search the node at the data block place of carrying out the required file of job task, the quantity of described data block is a plurality of;
Calculate described file to the load of its each data block place node generation and the running load of described node;
Running load to described node compares, and obtains the lightest node of load as default node;
When the running load sum of the load that produces by described file on the described default node and described default node when setting load threshold, dispatch described job task to described default node execution.
Above-mentioned method, preferred, described file is specially the computation process of the load that its each data block place node produces:
Calculate to carry out the data block quantity that the required file of job task has and be in the data block quantity that belongs to described file on the described node;
To be in the load that the ratio of the data block quantity that data block quantity that belongs to described file on the described node and described file have produces described node as described file.
Above-mentioned method, preferred, the computation process of the running load of described node is specially:
Calculate of the load of the file of execution job task on the described node to described node generation;
The load that the different files of carrying out job task on the described node are produced described node and as the running load of described node.
Above-mentioned method, preferably, described load threshold is set according to the operation conditions of described node, when the running load sum of load that produces by described file on the described default node and described default node during not less than load threshold, give up this default node, dispatch described job task to the node that satisfies load threshold and carry out.
A kind of dispatching system of file job task comprises:
Search unit, computing unit, comparing unit and scheduling unit;
Wherein: describedly search the node that the unit is used to search the data block place of carrying out the required file of job task, the quantity of described data block is a plurality of;
Described computing unit is used to calculate the running load of described file to the described node of load machine of its each data block place node generation;
The running load that described comparing unit is used for described node that described computing unit is calculated compares, and obtains the lightest node of load as default node;
Described scheduling unit be used for when the running load sum of the load that produces by described file on the described default node and described default node when setting load threshold, dispatch described job task to described default node execution.
Above-mentioned dispatching system, preferred, described computing unit comprises first computation subunit;
Described first computation subunit is used to calculate carries out data block quantity that the required file of job task has and the quantity that is in the data block that belongs to described file on the described node; And calculate the ratio of the data block that the data block quantity that belongs to described file be on the described node and described file have, with described ratio as of the load of described file to described node generation.
Above-mentioned dispatching system, preferred, described computing unit also comprises second computation subunit;
Carry out the load summation that the different files of job task produce described node on the described node that described second computation subunit is used for described first computation subunit is calculated, and with described load and as the running load of described node.
Above-mentioned dispatching system, preferred, described scheduling unit comprises the threshold setting subelement;
Described threshold setting subelement is used for the load threshold of described node is set.
The technical scheme that is provided by above the embodiment of the present application as seen, the dispatching method and the system of the file job task that the embodiment of the present application provides, before file is not used by MapReduce, calculate the load of each data block place node of this document, and each data block of file is found out the default node of a node that load is the lightest of its correspondence as task of needing this data block of use to calculate in the future; When having operation to submit at this document, system will distribute the task of this operation and carry out to good as calculated default node, thereby maximizedly satisfied the data locality, data move the increase that causes the IO expense when having reduced the concurrent execution of task, and make the load of system balanced more.
Description of drawings
In order to be illustrated more clearly in the embodiment of the present application or technical scheme of the prior art, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, the accompanying drawing that describes below only is some embodiment that put down in writing among the application, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The dispatching method process flow diagram of the file job task that Fig. 1 provides for the embodiment of the present application;
One detail flowchart of the dispatching method of the file job task that Fig. 2 provides for the embodiment of the present application;
The structural representation of the dispatching system of the file job task that Fig. 3 provides for the embodiment of the present application;
One detailed structure synoptic diagram of the dispatching system of the file job task that Fig. 4 provides for the embodiment of the present application;
The another detailed structure synoptic diagram of the dispatching system of the file job task that Fig. 5 provides for the embodiment of the present application;
A detailed structure synoptic diagram again of the dispatching system of the file job task that Fig. 6 provides for the embodiment of the present application.
Embodiment
In order to make those skilled in the art person understand the application's scheme better.Below in conjunction with the accompanying drawing in the embodiment of the present application, the technical scheme in the embodiment of the present application is clearly and completely described, obviously, described embodiment only is the application's part embodiment, rather than whole embodiment.Based on the embodiment among the application, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all should belong to the scope of the application's protection.
The process flow diagram of the dispatching method of the file job task that the embodiment of the present application provides comprises as shown in Figure 1:
Step S101: search the node at the data block place of carrying out the required file of job task, the quantity of described data block is a plurality of;
All there is the copy data piece in each data block of file, and data block and its copy data piece are equivalent, and the node at the data block place of locating file comprises the node of searching data block and copy data piece place thereof;
Step S102: calculate described file to the load of its each data block place node generation and the running load of described node;
The different pieces of information piece of file may be stored on the different nodes, or several different pieces of information pieces of file are stored on the same node simultaneously, so the load difference that file produces each node;
Simultaneously, on the same node, the situation that may exist a plurality of different files to be used simultaneously, the load that described a plurality of different files produce described node and be the running load of described node;
Step S103: the running load to described node compares, and obtains the lightest node of load as default node;
Step S104: when the running load sum of the load that produces by described file on the described default node and described default node when setting load threshold, dispatch described job task to described default node execution.
Need be to what above method described:
Above method at be the scheduling process between a certain data block and the described data block copy place node in the file, in the operation implementation, because operation is split into a plurality of Map tasks, the file data blocks that each Map required by task is asked also is stored on the different nodes, when carrying out for each Map task, all the method that can provide by the application is carried out required data block to the Map task and the copy data piece place node of described data block is selected, and selects the lightest node of node load to carry out the Map task executions.
For the detailed file job task dispatching method that the embodiment of the present application is provided directly perceived more is described, below the described method of the application is given an example with a specific embodiment:
Enactment document F, the total quantity of the data block that file F is divided into is S (F);
The quantity that a certain node N goes up the data block of storage file F be S (F, N);
Then file F is WF (N)=S (F to the load that its data block place node produces, N)/and S (F), the load that promptly described file produces its data block place node is the ratio that belongs to the data block quantity that the data block quantity of described file and described file have on the described node.
The quantity of node is a lot, and file F can produce load for each node, in the dispatching method that the embodiment of the present application provides, file F is produced maximal value in load as the load of file F self, that is: W (F)=max (WF (N)) to each node;
The file of executing the task on the node N has a plurality of, and the file of executing the task on the node N is the running load of described node to the load summation that described node produces, and supposing has on the node N
N file carried out, and then the running load of node N is
To with the load of node by after calculating, be at file F for the selection course of node, for the lightest node of load in the node of its this data block of each data block selection and the storage of all copy data pieces.
As: file F have n data block F=(B1, B2, B3 ... Bn);
At data block Bi, the span of i is 1～n, supposes that Bi has two copies, and the node of Bi and copy storage thereof is respectively Nj, Nk, Ni;
When the running load of Nj less than Nk, the running load of Ni, promptly W (Nj)≤W (Nk) and
During W (Nj)≤W (Ni), select the default node of Nj, when job task is submitted, the job task that needs to use the Bi data block in the job task is dispatched to node Nj goes up execution as Bi.
One detailed implementation of the dispatching method of the file job task that the embodiment of the present application provides comprises as shown in Figure 2:
For file F;
Step S201: the nodes of locations of finding out all data block places of file F;
Step S202: the load of calculation document;
Step S203: the running load that calculates each node N;
Step S204: each data block gathered find out the lightest node of place node load as default node; Step S204 is in waiting status;
When step S205 carries out, when promptly having submitted a MapReduce operation to for file F user, under the combination of step S205 and step S204, execution in step S206;
Step S206: for each the node N in the set of node, whether W (N)+WF (N) is less than preset value; If less than execution in step S207: the task of schedule job is carried out to default node; Otherwise, return step S204; To the residue node in the lightest node of load select, with this node as new default node.
Above method is carried out at the data block of Map required by task and copy data piece thereof, and when the default node of selecting satisfied W (N)+WF (N)＜preset value, distributed tasks was carried out to the lightest node of the load that pairing desired data piece calculates.
Described preset value is set according to the operation conditions of described node, and the type of preset value can be polytype, and when system moved, operating personnel can adjust described preset value according to actual operating state.
Statement by above method embodiment as can be known, this method is according to the file storage structure of the system that adopts the MapReduce model to calculate, before a file is not used by MapReduce, calculate the load of each data block place node of this document, and each data block of file is found out the default node of a node that load is the lightest of its correspondence as task of needing this data block of use to calculate in the future.When having operation to submit at this document, system will distribute the task of this operation and carry out to good as calculated default node; Thereby maximizedly make when satisfying the data locality load of system balanced more.
As seen, node data locality when the method oriented mission that the embodiment of the present application provides is distributed, be applicable to and use the MapReduce model to carry out the calculating cluster of job scheduling, high data locality is arranged when guaranteeing the concurrent execution of task, the increase that data move the IO expense that causes when carrying out so that the minimizing task is concurrent makes the MapReduce model obtain better utilization.
For aforesaid method embodiment, for simple description, so it all is expressed as a series of combination of actions, but those skilled in the art should know, the present invention is not subjected to the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or carry out simultaneously.Secondly, those skilled in the art also should know, the embodiment described in the instructions all belongs to preferred embodiment, and related action and module might not be that the present invention is necessary.
At above method embodiment, the embodiment of the present application also provides a kind of dispatching system of file job task, and its structural representation comprises as shown in Figure 3:
Wherein:
Search the node that unit 301 is used to search the data block place of carrying out the required file of job task, the quantity of described data block is a plurality of;
The running load that comparing unit 303 is used for described node that described computing unit 302 is calculated compares, and obtains the lightest node of load as default node;
In said system, computing unit 302 comprises first computation subunit 305, and its structural representation such as the embodiment of the present application are shown in Figure 4:
On the basis of system shown in Figure 4, computing unit 302 also comprises second computation subunit 306; Its structural representation is as shown in Figure 5:
Carry out the load summation that the different files of job task produce described node on the described node that second computation subunit 306 is used for described first computation subunit 305 is calculated, and with described load and as the running load of described node.
In the dispatching system of the file job task that the embodiment of the present application provides, scheduling unit 304 comprises threshold setting subelement 307;
Described threshold setting subelement 307 is used for the load threshold of described node is set.
For system embodiment, because it is substantially corresponding to method embodiment, so description is fairly simple, relevant part gets final product referring to the part explanation of method embodiment.
Each embodiment in this instructions all adopts the mode of going forward one by one to describe, and identical similar part is mutually referring to getting final product between each embodiment, and each embodiment stresses all is difference with other embodiment.The above only is the application's a embodiment; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the application's principle; can also make some improvements and modifications, these improvements and modifications also should be considered as the application's protection domain.
Claims (8)
1. the dispatching method of a file job task is characterized in that, comprising:
Search the node at the data block place of carrying out the required file of job task, the quantity of described data block is a plurality of;
Calculate described file to the load of its each data block place node generation and the running load of described node;
Running load to described node compares, and obtains the lightest node of load as default node;
When the running load sum of the load that produces by described file on the described default node and described default node when setting load threshold, dispatch described job task to described default node execution.
2. method according to claim 1 is characterized in that, described file is specially the computation process of the load that its each data block place node produces:
Calculate to carry out the data block quantity that the required file of job task has and be in the data block quantity that belongs to described file on the described node;
To be in the load that the ratio of the data block quantity that data block quantity that belongs to described file on the described node and described file have produces described node as described file.
3. method according to claim 2 is characterized in that, the computation process of the running load of described node is specially:
Calculate of the load of the file of execution job task on the described node to described node generation;
The load that the different files of carrying out job task on the described node are produced described node and as the running load of described node.
4. method according to claim 1, it is characterized in that, described load threshold is set according to the operation conditions of described node, when the running load sum of load that produces by described file on the described default node and described default node during not less than load threshold, give up this default node, dispatch described job task to the node that satisfies load threshold and carry out.
5. the dispatching system of a file job task is characterized in that, comprising:
Search unit, computing unit, comparing unit and scheduling unit;
Wherein: describedly search the node that the unit is used to search the data block place of carrying out the required file of job task, the quantity of described data block is a plurality of;
Described computing unit is used to calculate the running load of described file to the described node of load machine of its each data block place node generation;
The running load that described comparing unit is used for described node that described computing unit is calculated compares, and obtains the lightest node of load as default node;
Described scheduling unit be used for when the running load sum of the load that produces by described file on the described default node and described default node when setting load threshold, dispatch described job task to described default node execution.
6. dispatching system according to claim 5 is characterized in that described computing unit comprises first computation subunit;
Described first computation subunit is used to calculate carries out data block quantity that the required file of job task has and the quantity that is in the data block that belongs to described file on the described node; And calculate the ratio of the data block that the data block quantity that belongs to described file be on the described node and described file have, with described ratio as of the load of described file to described node generation.
7. dispatching system according to claim 6 is characterized in that described computing unit also comprises second computation subunit;
Carry out the load summation that the different files of job task produce described node on the described node that described second computation subunit is used for described first computation subunit is calculated, and with described load and as the running load of described node.
8. dispatching system according to claim 1 is characterized in that described scheduling unit comprises the threshold setting subelement;
Described threshold setting subelement is used for the load threshold of described node is set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100753553A CN102156659A (en) | 2011-03-28 | 2011-03-28 | Scheduling method and system for job task of file |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100753553A CN102156659A (en) | 2011-03-28 | 2011-03-28 | Scheduling method and system for job task of file |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102156659A true CN102156659A (en) | 2011-08-17 |
Family
ID=44438167
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100753553A Pending CN102156659A (en) | 2011-03-28 | 2011-03-28 | Scheduling method and system for job task of file |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102156659A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103218233A (en) * | 2013-05-09 | 2013-07-24 | 福州大学 | Data allocation strategy in hadoop heterogeneous cluster |
| CN103500119A (en) * | 2013-09-06 | 2014-01-08 | 西安交通大学 | Task allocation method based on pre-dispatch |
| CN103530182A (en) * | 2013-10-22 | 2014-01-22 | 海南大学 | Working scheduling method and device |
| CN103677752A (en) * | 2012-09-19 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Distributed data based concurrent processing method and system |
| CN106776984A (en) * | 2016-12-02 | 2017-05-31 | 航天星图科技（北京）有限公司 | A kind of cleaning method of distributed system mining data |
| CN108563497A (en) * | 2018-04-11 | 2018-09-21 | 中译语通科技股份有限公司 | A kind of efficient various dimensions algorithmic dispatching method, task server |
| CN115225628A (en) * | 2022-06-23 | 2022-10-21 | 中国电子科技集团公司第十五研究所 | Preheating type mirror image loading method based on lightweight container cloud environment |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101256515A (en) * | 2008-03-11 | 2008-09-03 | 浙江大学 | Method for implementing load equalization of multicore processor operating system |
-
2011
- 2011-03-28 CN CN2011100753553A patent/CN102156659A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101256515A (en) * | 2008-03-11 | 2008-09-03 | 浙江大学 | Method for implementing load equalization of multicore processor operating system |
Non-Patent Citations (2)
| Title |
|---|
| 冯玉才等: "基于任务分配的数据库集群模型", 《计算机工程与科学》, vol. 29, no. 12, 31 December 2007 (2007-12-31), pages 114 - 116 * |
| 柳旭日等: "异构集群服务器的动态加权负载均衡算法", 《微计算机信息》, vol. 25, no. 27, 31 December 2009 (2009-12-31), pages 201 - 203 * |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10009441B2 (en) | 2012-09-19 | 2018-06-26 | Tencent Technology (Shenzhen) Company Limited | Distributed data-based concurrent processing method and system, and computer storage medium |
| US10200497B2 (en) | 2012-09-19 | 2019-02-05 | Tencent Technology (Shenzhen) Company Limited | Distributed data-based concurrent processing method and system, and computer storage medium |
| CN103677752A (en) * | 2012-09-19 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Distributed data based concurrent processing method and system |
| WO2014044136A1 (en) * | 2012-09-19 | 2014-03-27 | 腾讯科技（深圳）有限公司 | Distributed data-based concurrent processing method and system, and computer storage medium |
| CN103677752B (en) * | 2012-09-19 | 2017-02-08 | 腾讯科技（深圳）有限公司 | Distributed data based concurrent processing method and system |
| CN103218233B (en) * | 2013-05-09 | 2015-11-18 | 福州大学 | Data allocation strategy in Hadoop isomeric group |
| CN103218233A (en) * | 2013-05-09 | 2013-07-24 | 福州大学 | Data allocation strategy in hadoop heterogeneous cluster |
| CN103500119A (en) * | 2013-09-06 | 2014-01-08 | 西安交通大学 | Task allocation method based on pre-dispatch |
| CN103500119B (en) * | 2013-09-06 | 2017-01-04 | 西安交通大学 | A kind of method for allocating tasks based on pre-scheduling |
| CN103530182A (en) * | 2013-10-22 | 2014-01-22 | 海南大学 | Working scheduling method and device |
| CN106776984A (en) * | 2016-12-02 | 2017-05-31 | 航天星图科技（北京）有限公司 | A kind of cleaning method of distributed system mining data |
| CN106776984B (en) * | 2016-12-02 | 2018-09-25 | 航天星图科技（北京）有限公司 | A kind of cleaning method of distributed system mining data |
| CN108563497A (en) * | 2018-04-11 | 2018-09-21 | 中译语通科技股份有限公司 | A kind of efficient various dimensions algorithmic dispatching method, task server |
| CN108563497B (en) * | 2018-04-11 | 2022-03-29 | 中译语通科技股份有限公司 | Efficient multi-dimensional algorithm scheduling method and task server |
| CN115225628A (en) * | 2022-06-23 | 2022-10-21 | 中国电子科技集团公司第十五研究所 | Preheating type mirror image loading method based on lightweight container cloud environment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102156659A (en) | Scheduling method and system for job task of file | |
| CN101819540B (en) | Method and system for scheduling task in cluster | |
| CN105117286A (en) | Task scheduling and pipelining executing method in MapReduce | |
| Bicer et al. | Time and cost sensitive data-intensive computing on hybrid clouds | |
| CN103078941B (en) | A kind of method for scheduling task of distributed computing system | |
| CN103729246A (en) | Method and device for dispatching tasks | |
| CN103197976A (en) | Method and device for processing tasks of heterogeneous system | |
| CN102521056A (en) | Task allocation device and task allocation method | |
| CN103049330A (en) | Method and system for scheduling trusteeship distribution task | |
| Kalinowski et al. | Predictive-reactive strategy for real time scheduling of manufacturing systems | |
| CN105450684A (en) | Cloud computing resource scheduling method and system | |
| CN104199739A (en) | Speculation type Hadoop scheduling method based on load balancing | |
| CN102708009A (en) | Method for sharing GPU (graphics processing unit) by multiple tasks based on CUDA (compute unified device architecture) | |
| CN108536539A (en) | A kind of method for scheduling task in industrial allocation formula data collecting system | |
| CN109032769A (en) | A kind of continuous integrating CI task processing method and device based on container | |
| Shojafar et al. | An efficient scheduling method for grid systems based on a hierarchical stochastic Petri net | |
| Taheri et al. | Hopfield neural network for simultaneous job scheduling and data replication in grids | |
| Kim et al. | An adaptive data placement strategy in scientific workflows over cloud computing environments | |
| Li | Parallel nonconvex generalized Benders decomposition for natural gas production network planning under uncertainty | |
| CN104239520B (en) | A kind of HDFS data block Placement Strategies based on historical information | |
| Biswas et al. | A novel resource aware scheduling with multi-criteria for heterogeneous computing systems | |
| Shah et al. | Hybrid resource allocation method for grid computing | |
| US11599540B2 (en) | Query execution apparatus, method, and system for processing data, query containing a composite primitive | |
| CN106155799A (en) | Codelet dispatching method based on genetic algorithm | |
| Jung et al. | A workflow scheduling technique for task distribution in spot instance-based cloud |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110817 |