CN104750545A - Process scheduling method and device - Google Patents
Process scheduling method and device Download PDFInfo
- Publication number
- CN104750545A CN104750545A CN201310741925.7A CN201310741925A CN104750545A CN 104750545 A CN104750545 A CN 104750545A CN 201310741925 A CN201310741925 A CN 201310741925A CN 104750545 A CN104750545 A CN 104750545A
- Authority
- CN
- China
- Prior art keywords
- subprocess
- connection request
- host process
- server
- scheduling message
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a process scheduling method and device, aiming at solving the problem of a process scheduling process in the prior art that the consumption of system resources is great. The method comprises the following steps: a server monitors whether connection request information which is sent to the server by a node and is not scheduled to the process by the server exists or not by a main process; when the server monitors that the connection request information exists by the main process, the connection request information is scheduled to a local sub-process. With the adoption of the technical scheme, the main process of the server monitors the connection request information sent by the node, and schedules the connection request information to the corresponding sub-process, so that the resource waste problems caused by monitoring all the sub-processes are avoided and the consumption of the system resources is effectively saved.
Description
Technical field
The present invention relates to communication technical field, particularly relate to a kind of method and device of dispatching process.
Background technology
Along with the develop rapidly of multimedia technology, various ways can be adopted to carry out transmission and the broadcasting of Streaming Media, wherein, P2P(Peer to Peer; Point-to-point) stream media system is a kind of conventional streaming media and Play System.
In existing point-to-point stream media system, streaming medium content is cut into multiple data block (chunk), using each data block as the base unit of transmission of flow media data, thus complete continuous print data stream and transmit between node (Peer), wherein, each data block is identified by unique chunk id.Sharing and exchanging the buffered message (being called for short BM) all depending on the description node buffer status exchanged between node of programme content, namely completes sharing of programme content by buffered message and exchanges.
At present, when the node in point-to-point stream media system needs the node listing preserved in access services device, during to carry out node connection and to obtain data from the node established a connection, namely node sends connection request message to server, to obtain the node listing that server this locality is preserved, and the node corresponding with the node identification in this node listing is established a connection.In prior art, each subprocess of server monitors the connection request message that whether there is node and send simultaneously, when there is any node and sending connection request message to server, each subprocess is by this snoop results announcement server system, connection request scheduling message extremely above-mentioned any subprocess that server system sends by above-mentioned any node, by this any subprocess, above-mentioned connection request message is processed, this any node is sent to by node listing, this any node can be established a connection by the node that connection request message is corresponding with the node identification in node listing.As can be seen here, adopt technique scheme, in server, all subprocesss are all in listening state, add the resource consumption of system.
In sum, in process scheduling process, there is the problem that system resources consumption is large in prior art.
Summary of the invention
The embodiment of the present invention provides a kind of method and device of dispatching process, in order to solve prior art in process scheduling process, there is the problem that system resources consumption is large.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
A method for dispatching process, comprising:
Server by host process monitor whether exist be sent to described server by node and not by described server scheduling to the connection request message of process;
After described server to be listened to by host process and there is described connection request message, by described connection request scheduling message to local subprocess.
A device for dispatching process, comprising:
Monitoring unit, is sent to this locality by node and the connection request message not being scheduled to process for being monitored by host process whether to exist;
Scheduling unit, after being listened to by described host process and there is described connection request message, by described connection request scheduling message to local subprocess.
In the embodiment of the present invention, when the host process of server listens to after that node sends and not serviced device is dispatched to the connection request message of process, by this connection request scheduling message to local subprocess.Adopt technique scheme, the connection request message of node transmission is monitored by the host process of server, and by this connection request scheduling message to corresponding subprocess, avoid the problem of resource waste caused when all subprocesss are all monitored, effectively saved system resources consumption.
Accompanying drawing explanation
Fig. 1 is point-to-point Frame of Streaming Media System schematic diagram in the embodiment of the present invention;
Fig. 2 is the process flow diagram of dispatching process in the embodiment of the present invention;
Fig. 3 be in the embodiment of the present invention server by the logical diagram of host process scheduling sublayer process;
Fig. 4 is the process flow diagram of embody rule scene dispatching process in the embodiment of the present invention;
Fig. 5 is the apparatus structure schematic diagram of dispatching process in the embodiment of the present invention.
Embodiment
In order to solve prior art in process scheduling process, there is the problem that system resources consumption is large.In the embodiment of the present invention, in the embodiment of the present invention, when the host process of server listens to after that node sends and not serviced device is dispatched to the connection request message of process, by this connection request scheduling message to local subprocess.Adopt technique scheme, the connection request message of node transmission is monitored by the host process of server, and by this connection request scheduling message to corresponding subprocess, avoid the problem of resource waste caused when all subprocesss are all monitored, effectively saved system resources consumption.
The embodiment of the present invention is applied in point-to-point stream media system, consult and Figure 1 shows that point-to-point stream media system structural representation in the embodiment of the present invention, wherein, server is comprised in this point-to-point stream media system, and the multiple nodes under the administration of this server, below to be described in detail to the preferred embodiment of the present invention by reference to the accompanying drawings.
Consult shown in Fig. 2, in the embodiment of the present invention, the detailed process of dispatching process is:
Step 200: whether server is monitored to exist by host process and be sent to server by node and not serviced device is dispatched to the connection request message of process.
In the embodiment of the present invention, when any node in point-to-point stream media system needs the server corresponding with it to establish a connection, namely this any node sends connection request message to server, and server is based on RTMFP(Real Time Media Flow Protocol; Real-time stream media protocol) receive the connection request message that above-mentioned any node sends, and this connection request message to be processed.
Step 210: after server exists above-mentioned connection request message by host process monitoring, by this connection request scheduling message to local subprocess.
In the embodiment of the present invention, the connection request message that any node listened to by host process in local compass of competency when server is sent, and after the not serviced device of this connection request message is dispatched to process, the connection request scheduling message sent by this any node is to local subprocess.
Optionally, server by host process by above-mentioned connection request message random schedule to local any subprocess; Or server obtains the load parameter of each subprocess respectively by host process, by above-mentioned connection request scheduling message to the minimum subprocess of load parameter; Or server adopts polling mode by above-mentioned connection request scheduling message to local subprocess by host process; Or server adopts Weighted Round Robin mode by above-mentioned connection request scheduling message to local subprocess by host process.Consult and Figure 3 shows that in the embodiment of the present invention, server carries out the logical schematic of process scheduling by host process.Such as, server comprises three subprocesss and a host process, after any node sends connection request message to server, if the not serviced device of this connection request message is dispatched to any process, then namely server listens to this connection request message by host process, obtain the load parameter of acquisition three subprocesss respectively, if the load parameter of subprocess 1 is t1, the load parameter of subprocess 2 is t2, the load parameter of subprocess 3 is t3, and t1 < t2 < t3, then server by host process by above-mentioned any one node send connection request scheduling message to subprocess 3.For another example, consult shown in Fig. 3, the weighting coefficient of subprocess 1 is z1, the weighting coefficient of subprocess 2 is z2, the weighting coefficient of subprocess 3 is z3, and z1 > z2 > z3, then the connection request message prioritization that any node sends is dispatched to the maximum subprocess of local weighting coefficient 1 by host process according to Weighted Round Robin mode by server, when to have existed before connection request message be scheduled subprocess 1 time, preferential by connection request scheduling message to subprocess 2, by that analogy, repeat no more herein.
Adopt technique scheme, the connection request message prioritization that any node sends is dispatched to the minimum subprocess of load parameter, avoid in prior art when exist great deal of nodes to server send connection request message time, this a large amount of connection request message prioritization can be sent to subprocess queue subprocess foremost by server, cause the problem that the subprocess charge capacity of subprocess queue front is large, the balanced load of each subprocess, reduces system burden.
Optionally, server is obtained the process of the load parameter of each subprocess respectively and is by host process: server obtains by host process the load parameter that each subprocess dynamically reports according to predetermined period respectively.The task quantity that this load parameter can perform for above-mentioned subprocess, when the task quantity that subprocess is performing is larger, load parameter is larger.
Special, if the load parameter that there are at least two subprocesss is equal, and being the minimum subprocess of load parameter, server is by host process random selected subprocess from least two subprocesss, and the connection request scheduling message sent by above-mentioned any node is to selected subprocess; Or server obtains the local dispatching record preserved by host process, the subprocess that selected scheduling frequency is the highest from least two subprocesss, the connection request scheduling message sent by above-mentioned any node is to selected subprocess; Or, server obtains the execution efficiency of these at least two subprocesss by host process, the subprocess that selected execution efficiency is the highest from these at least two subprocesss, the connection request scheduling message sent by above-mentioned any node is to selected subprocess, wherein, the ratio that this execution efficiency can perform the task amount of any task and the execution duration of this any task by subprocess obtains.
Such as, consult shown in Fig. 3, server comprises three subprocesss and a host process, after any node sends connection request message to server, server is by the load parameter of host process acquisition three subprocesss respectively, if the load parameter of subprocess 1 is t1, the load parameter of subprocess 2 is t2, the load parameter of subprocess 3 is t3, and t1 < t2=t3, then server by host process by above-mentioned any one node send connection request message random schedule to subprocess 3 or subprocess 2; Or, server obtains the execution efficiency of above-mentioned subprocess 2 and subprocess 3 by host process, if the execution efficiency of subprocess 2 is p1, the execution efficiency of subprocess 3 is p2, and p1 < p2, then server by host process by above-mentioned any one node send connection request scheduling message to subprocess 2.
In addition, if the load parameter that there are at least two subprocesss is equal, and being the minimum subprocess of load parameter, then server adopts polling mode by the subprocess of connection request scheduling message at least two subprocesss of any node transmission by host process; Or, the subprocess of connection request scheduling message at least two subprocesss that server adopts Weighted Round Robin mode to be sent by any node by host process.
Below in conjunction with concrete application scenarios, consult shown in Fig. 4, describe the flow process of dispatching process in the embodiment of the present invention in detail:
Step 400: whether server is monitored by host process exists node and be sent to this server and not serviced device is dispatched to the connection request message of process, if so, performs step 410; Otherwise, perform step 420.
Step 410: server obtains the load parameter of each subprocess by host process, obtains the subprocess that load parameter is minimum.
Step 420: server continues to monitor by host process.
Step 430: server determines whether by host process the subprocess that existence two load parameters are minimum, if so, performs step 440; Otherwise, perform step 450.
Step 440: server obtains the highest subprocess of above-mentioned execution efficiency by host process, by the above-mentioned connection request scheduling message subprocess that extremely above-mentioned execution efficiency is the highest.
Step 450: by the above-mentioned connection request scheduling message subprocess that extremely above-mentioned load parameter is minimum.
Based on technique scheme, consult shown in Fig. 5, the invention provides a kind of device of dispatching process, comprise monitoring unit 50 and scheduling unit 51, wherein:
Monitoring unit 50, is sent to this locality by node and the connection request message not being scheduled to process for being monitored by host process whether to exist;
Scheduling unit 51, after being listened to by described host process and there is described connection request message, by described connection request scheduling message to local subprocess.
Further, said apparatus also comprises acquiring unit 52, for adopting polling mode by described connection request scheduling message to local subprocess by host process; Or, the load parameter of each subprocess is obtained respectively by host process, and by the described connection request scheduling message subprocess that extremely local load parameter is minimum; Or, adopt Weighted Round Robin mode by described connection request scheduling message to local subprocess by host process; Wherein, the size of the load parameter of subprocess is directly proportional to the load of subprocess.
In sum, in the embodiment of the present invention, whether server is monitored to exist by host process and is sent to server by node and not serviced device is dispatched to the connection request message of process; After server exists above-mentioned connection request message by host process monitoring, by this connection request scheduling message to local subprocess.Adopt technique scheme, the connection request message of node transmission is monitored by the host process of server, and by this connection request scheduling message to corresponding subprocess, avoid the problem of resource waste caused when all subprocesss are all monitored, effectively saved system resources consumption.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the present invention can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disk memory, CD-ROM, optical memory etc.) of computer usable program code.
The present invention describes with reference to according to the process flow diagram of the method for the embodiment of the present invention, equipment (system) and computer program and/or block scheme.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block scheme and/or square frame and process flow diagram and/or block scheme and/or square frame.These computer program instructions can being provided to the processor of multi-purpose computer, special purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computing machine or other programmable data processing device produce device for realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
These computer program instructions also can be loaded in computing machine or other programmable data processing device, make on computing machine or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computing machine or other programmable devices is provided for the step realizing the function of specifying in process flow diagram flow process or multiple flow process and/or block scheme square frame or multiple square frame.
Although describe the preferred embodiments of the present invention, those skilled in the art once obtain the basic creative concept of cicada, then can make other change and amendment to these embodiments.So claims are intended to be interpreted as comprising preferred embodiment and falling into all changes and the amendment of the scope of the invention.
Obviously, those skilled in the art can carry out various change and modification to the embodiment of the present invention and not depart from the spirit and scope of the embodiment of the present invention.Like this, if these amendments of the embodiment of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.
Claims (8)
1. a method for dispatching process, is characterized in that, comprising:
Server by host process monitor whether exist be sent to described server by node and not by described server scheduling to the connection request message of process;
After described server to be listened to by host process and there is described connection request message, by described connection request scheduling message to local subprocess.
2. the method for claim 1, is characterized in that, by described connection request scheduling message to local subprocess, specifically comprises:
Described server adopts polling mode by described connection request scheduling message to local subprocess by host process; Or,
Described server obtains the load parameter of each subprocess respectively by host process, and by the described connection request scheduling message subprocess that extremely local load parameter is minimum; Or,
Described server adopts Weighted Round Robin mode by described connection request scheduling message to local subprocess by host process;
Wherein, the size of the load parameter of subprocess is directly proportional to the load of subprocess.
3. method as claimed in claim 2, it is characterized in that, server obtains the load parameter of each subprocess respectively by host process, specifically comprises:
Described server obtains by host process the load parameter that each subprocess dynamically reports according to predetermined period respectively.
4. method as claimed in claim 2 or claim 3, is characterized in that, if the load parameter that there are at least two subprocesss is equal, and is the minimum subprocess of load parameter, by described connection request scheduling message to local subprocess, specifically comprises:
Described server selectes a subprocess, by described connection request scheduling message to selected subprocess by host process is random from described at least two subprocesss; Or,
The execution efficiency that described in described server is obtained by host process, at least two subprocesss are corresponding respectively, the subprocess that selected execution efficiency is the highest from described at least two subprocesss, by described connection request scheduling message to selected subprocess; Or,
Described server adopts polling mode by a subprocess in described connection request scheduling message to described at least two subprocesss by host process; Or,
Described server adopts Weighted Round Robin mode by a subprocess in described connection request scheduling message to described at least two subprocesss by host process.
5. a device for dispatching process, is characterized in that, comprising:
Monitoring unit, is sent to this locality by node and the connection request message not being scheduled to process for being monitored by host process whether to exist;
Scheduling unit, after being listened to by described host process and there is described connection request message, by described connection request scheduling message to local subprocess.
6. device as claimed in claim 5, is characterized in that, also comprise acquiring unit, for:
Polling mode is adopted by described connection request scheduling message to local subprocess by host process; Or, the load parameter of each subprocess is obtained respectively by host process, and by the described connection request scheduling message subprocess that extremely local load parameter is minimum; Or, adopt Weighted Round Robin mode by described connection request scheduling message to local subprocess by host process; Wherein, the size of the load parameter of subprocess is directly proportional to the load of subprocess.
7. device as claimed in claim 6, is characterized in that, described acquiring unit, specifically for:
The load parameter that each subprocess dynamically reports according to predetermined period is obtained respectively by described host process.
8. device as claimed in claims 6 or 7, is characterized in that, described scheduling unit, specifically for:
If the load parameter that there are at least two subprocesss is equal, and is the minimum subprocess of load parameter, then by described host process random selected subprocess from described at least two subprocesss, by described connection request scheduling message to selected subprocess; Or, the execution efficiency that described in being obtained by host process, at least two subprocesss are corresponding respectively, the subprocess that selected execution efficiency is the highest from described at least two subprocesss, by described connection request scheduling message to selected subprocess; Or, adopt polling mode by a subprocess in described connection request scheduling message to described at least two subprocesss by host process; Or, adopt Weighted Round Robin mode by a subprocess in described connection request scheduling message to described at least two subprocesss by host process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310741925.7A CN104750545A (en) | 2013-12-27 | 2013-12-27 | Process scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310741925.7A CN104750545A (en) | 2013-12-27 | 2013-12-27 | Process scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104750545A true CN104750545A (en) | 2015-07-01 |
Family
ID=53590288
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310741925.7A Pending CN104750545A (en) | 2013-12-27 | 2013-12-27 | Process scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104750545A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106375372A (en) * | 2016-08-23 | 2017-02-01 | 东方网力科技股份有限公司 | Big data resource allocation method and device |
| CN110333916A (en) * | 2019-06-18 | 2019-10-15 | 平安银行股份有限公司 | Request message processing method, device, computer system and readable storage medium storing program for executing |
| CN110839034A (en) * | 2019-11-15 | 2020-02-25 | 腾讯科技（深圳）有限公司 | Communication connection control method and related equipment |
| CN110908810A (en) * | 2019-10-30 | 2020-03-24 | 泰康保险集团股份有限公司 | Message transmission method and device |
| CN116089049A (en) * | 2023-04-07 | 2023-05-09 | 北京卡普拉科技有限公司 | Asynchronous parallel I/O request-based process synchronous scheduling method, device and equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101014002A (en) * | 2006-12-12 | 2007-08-08 | 华为技术有限公司 | Cluster message transmitting method and distributed cluster system |
| CN101252506A (en) * | 2007-12-29 | 2008-08-27 | 中国建设银行股份有限公司 | Data transmission system |
| US20100005473A1 (en) * | 2008-07-01 | 2010-01-07 | Blanding William H | System and method for controlling computing resource consumption |
| CN101702735A (en) * | 2009-11-24 | 2010-05-05 | 恒生电子股份有限公司 | TCP service device and method |
| CN102916953A (en) * | 2012-10-12 | 2013-02-06 | 青岛海信传媒网络技术有限公司 | Method and device for realizing concurrent service on basis of TCP (transmission control protocol) connection |
-
2013
- 2013-12-27 CN CN201310741925.7A patent/CN104750545A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101014002A (en) * | 2006-12-12 | 2007-08-08 | 华为技术有限公司 | Cluster message transmitting method and distributed cluster system |
| CN101252506A (en) * | 2007-12-29 | 2008-08-27 | 中国建设银行股份有限公司 | Data transmission system |
| US20100005473A1 (en) * | 2008-07-01 | 2010-01-07 | Blanding William H | System and method for controlling computing resource consumption |
| CN101702735A (en) * | 2009-11-24 | 2010-05-05 | 恒生电子股份有限公司 | TCP service device and method |
| CN102916953A (en) * | 2012-10-12 | 2013-02-06 | 青岛海信传媒网络技术有限公司 | Method and device for realizing concurrent service on basis of TCP (transmission control protocol) connection |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106375372A (en) * | 2016-08-23 | 2017-02-01 | 东方网力科技股份有限公司 | Big data resource allocation method and device |
| CN106375372B (en) * | 2016-08-23 | 2019-12-06 | 东方网力科技股份有限公司 | big data resource allocation method and device |
| CN110333916A (en) * | 2019-06-18 | 2019-10-15 | 平安银行股份有限公司 | Request message processing method, device, computer system and readable storage medium storing program for executing |
| CN110333916B (en) * | 2019-06-18 | 2024-03-19 | 平安银行股份有限公司 | Request message processing method, device, computer system and readable storage medium |
| CN110908810A (en) * | 2019-10-30 | 2020-03-24 | 泰康保险集团股份有限公司 | Message transmission method and device |
| CN110839034A (en) * | 2019-11-15 | 2020-02-25 | 腾讯科技（深圳）有限公司 | Communication connection control method and related equipment |
| CN116089049A (en) * | 2023-04-07 | 2023-05-09 | 北京卡普拉科技有限公司 | Asynchronous parallel I/O request-based process synchronous scheduling method, device and equipment |
| CN116089049B (en) * | 2023-04-07 | 2023-09-12 | 北京卡普拉科技有限公司 | Asynchronous parallel I/O request-based process synchronous scheduling method, device and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7112919B2 (en) | Smart device task processing method and device | |
| US10826979B2 (en) | Apparatus and method for logically grouping client nodes in an IoT environment using client identifiers | |
| CN105939335A (en) | Method and system for managing channel ownership in a publish-subscribe data processing environment | |
| CN103297395B (en) | The implementation method of a kind of Internet service, system and device | |
| WO2018072687A1 (en) | Resource scheduling method and apparatus, and filtered scheduler | |
| CN103279351B (en) | A kind of method of task scheduling and device | |
| CN105007337A (en) | Cluster system load balancing method and system thereof | |
| CN104750545A (en) | Process scheduling method and device | |
| CN104079630A (en) | Business server side load balancing method, client side, server side and system | |
| CN105338061A (en) | Lightweight message oriented middleware realization method and system | |
| KR20130055423A (en) | Apparatus and method for supporting qos in middleware for data distribution service | |
| CN108650667B (en) | Terminal scheduling method and device | |
| CN106201723A (en) | The resource regulating method of a kind of data center and device | |
| US9648128B2 (en) | Dynamic ad hoc cloud based memory management for mobile devices | |
| EP1744519A8 (en) | Information exchange system, management server, and method for reducing the network load | |
| EP1746765A3 (en) | Information exchange system and method for reducing network load | |
| CN113259415B (en) | Network message processing method and device and network server | |
| US8121129B2 (en) | Optimizing throughput of data in a communications network | |
| CN104243610A (en) | Distributed file transmission service method | |
| CN107920108A (en) | A kind of method for pushing of media resource, client and server | |
| CN112104679B (en) | Method, apparatus, device and medium for processing hypertext transfer protocol request | |
| CN106790354B (en) | Communication method and device for preventing data congestion | |
| KR101634322B1 (en) | QoS profile generating apparatus and method for supporting data distribution service in cyber physical system | |
| CN106911739B (en) | Information distribution method and device | |
| CN103795810A (en) | Data distribution system and method and central server of data distribution system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150701 |