CN105574407B - A kind of shared treating method and apparatus - Google Patents
A kind of shared treating method and apparatus Download PDFInfo
- Publication number
- CN105574407B CN105574407B CN201511004740.3A CN201511004740A CN105574407B CN 105574407 B CN105574407 B CN 105574407B CN 201511004740 A CN201511004740 A CN 201511004740A CN 105574407 B CN105574407 B CN 105574407B
- Authority
- CN
- China
- Prior art keywords
- subject
- token
- threads
- thread
- search
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/52—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems during program execution, e.g. stack integrity ; Preventing unwanted data erasure; Buffer overflow
- G06F21/54—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems during program execution, e.g. stack integrity ; Preventing unwanted data erasure; Buffer overflow by adding security routines or objects to programs
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of shared treating method and apparatus.The method includes：Searching request is received, described search request includes thread identification and corresponding user information and keyword to be searched；It is asked according to described search, obtains the first token corresponding with the user information；If the quantity of described search request is multiple, it is determined that the 1st subject thread identifies；First token is given into the 1st subject thread and identifies corresponding 1st subject thread, so that the 1st subject thread is according to first token, corresponding 1st search result of corresponding with the 1st subject thread mark keyword to be searched is obtained from described search engine.The invention also discloses the devices for realizing the method.
Description
Technical field
The present invention relates to field of computer technology more particularly to a kind of shared treating method and apparatus.
Background technology
Token (can be referred to as TOKEN) can be used for the authentication in the data transmission in computer, it both can be with
The function of the secure access critical resource of lock is provided, and is utilized when conditional-variable makes thread fight for critical resource and is ordered into
's.
But in authentication in the prior art, since a thread needs a corresponding TOKEN, with the TOKEN
Search result is obtained from search engine, therefore causes the waste of resource.
Invention content
The embodiment of the present invention provides a kind of shared treating method and apparatus, for solving in the prior art due to a line
Journey need a corresponding TOKEN and caused by resource waste the problem of.
A kind of shared processing method, includes the following steps：
Searching request is received, described search request includes thread identification and corresponding user information and key to be searched
Word；
It is asked according to described search, obtains the first token corresponding with the user information；
If the quantity of described search request is multiple, it is determined that the 1st subject thread identifies；
First token is given into the 1st subject thread and identifies corresponding 1st subject thread, for the 1st mesh
Graticule journey obtains corresponding to be searched with the 1st subject thread mark according to first token from described search engine
Corresponding 1st search result of keyword.
By receiving searching request, which includes thread identification and corresponding user information and key to be searched
Word obtains the first token corresponding with the user information according to the searching request, if the quantity of the searching request is multiple,
It determines that the 1st subject thread identifies, and the first token is distributed to the 1st subject thread and identifies corresponding 1st subject thread, for this
1st subject thread obtains key to be searched corresponding with the 1st subject thread mark according to first token from search engine
Corresponding 1st search result of word, due to that can determine that the 1st subject thread identifies when the quantity of searching request is multiple, and will
First token gives the 1st subject thread and identifies corresponding 1st subject thread, so that the 1st subject thread first is enabled using this
Board carries out corresponding searching request, it is thereby achieved that multiple threads can share a token, to be effectively saved money
Source.
Further, if the quantity of described search request is multiple, it is determined that subject thread identifies, including：
If the quantity of described search request is multiple, according to the chronological order for receiving described search request, to institute
It states searching request to be ranked up, and the thread identification in the searching request of sequence the 1st is determined that the 1st subject thread identifies；
Then after the 1st subject thread obtains corresponding 1st search result, the method further includes：
Determine that the thread identification in the searching request of sequence N determines that N subject threads identify, and by first token
The N subject threads mark is distributed to, so that the N subject threads are according to first token, from described search engine
It is middle to obtain the corresponding N search results of corresponding with N subject threads mark keyword to be searched；By N+1, the step is repeated
Suddenly, until all threads obtain corresponding search result；
Wherein, N is positive integer, and is 2 when N is initial.
So as to realize the sequencing according to the time, thread is allowed to use token successively.
Further, if the quantity of described search request is multiple, it is determined that subject thread identifies, including：
If the quantity of described search request is multiple, according to competitive way, determine that the 1st subject thread identifies；
Then after the 1st subject thread obtains corresponding 1st search result, the method further includes：
According to competitive way, determine that N subject threads identify；First token is distributed into the N subject threads
Mark obtains and the N scores so that the N subject threads are according to first token from described search engine
The corresponding N search results of the corresponding keyword to be searched of journey mark；By N+1, the step is repeated, until the acquisition pair of all threads
The search result answered；
Wherein, N is positive integer, and is 2 when N is initial.
So as to realize the competitive way by thread, which thread is determined to use token.
Further, the method further includes：
If monitoring, the N subject threads identify corresponding N subject threads according to first token, described in acquisition
The search feedback that search engine returns includes token overdue indicator, then is updated processing to first token, to obtain
Second token；
Second token is distributed into N subject threads mark, so that the N subject threads are according to described the
Two tokens obtain the corresponding N of corresponding with N subject threads mark keyword to be searched from described search engine and search
Hitch fruit；By N+1, the step is repeated, until all threads obtain corresponding search result.
It thereby may be ensured that the token that per thread uses all is effective.
A kind of shared processing unit, including：
Receiving module, for receiving searching request, described search request includes thread identification and corresponding user information
With keyword to be searched；
Acquisition module obtains the first token corresponding with the user information for being asked according to described search；
Determining module, if the quantity for described search request is multiple, it is determined that the 1st subject thread identifies；
Distribution module identifies corresponding 1st subject thread for first token to be given the 1st subject thread,
So that the 1st subject thread is according to first token, obtains from described search engine and identified with the 1st subject thread
Corresponding 1st search result of corresponding keyword to be searched.
By receiving searching request, which includes thread identification and corresponding user information and key to be searched
Word obtains the first token corresponding with the user information according to the searching request, if the quantity of the searching request is multiple,
It determines that the 1st subject thread identifies, and the first token is distributed to the 1st subject thread and identifies corresponding 1st subject thread, for this
1st subject thread obtains key to be searched corresponding with the 1st subject thread mark according to first token from search engine
Corresponding 1st search result of word, due to that can determine that the 1st subject thread identifies when the quantity of searching request is multiple, and will
First token gives the 1st subject thread and identifies corresponding 1st subject thread, so that the 1st subject thread first is enabled using this
Board carries out corresponding searching request, it is thereby achieved that multiple threads can share a token, to be effectively saved money
Source.
Further, if the quantity that the determining module is specifically used for described search request is multiple, according to reception institute
The chronological order for stating searching request, to described search request be ranked up, and by sequence the 1st searching request in thread
Mark determines the 1st subject thread mark；
Then the distribution module is additionally operable to determine that the thread identification in the searching request of sequence N determines N subject threads
Mark, and first token is distributed into the N subject threads and is identified, so that the N subject threads are according to described the
One token obtains the corresponding N of corresponding with N subject threads mark keyword to be searched from described search engine and searches
Hitch fruit；By N+1, the step is repeated, until all threads obtain corresponding search result；
Wherein, N is positive integer, and is 2 when N is initial.
So as to realize the sequencing according to the time, thread is allowed to use token successively.
Further, if the quantity that the determining module is specifically used for described search request is multiple, according to competition side
Formula determines that the 1st subject thread identifies；
Then the distribution module is additionally operable to, according to competitive way, determine that N subject threads identify；By first token point
N subject threads described in dispensing identify, so that the N subject threads are according to first token, from described search engine
Obtain the corresponding N search results of corresponding with N subject threads mark keyword to be searched；By N+1, the step is repeated
Suddenly, until all threads obtain corresponding search result；
Wherein, N is positive integer, and is 2 when N is initial.
So as to realize the competitive way by thread, which thread is determined to use token.
Further, which further includes：
Update module, if for monitoring that the N subject threads identify corresponding N subject threads according to described first
Token, it includes token overdue indicator to obtain the search feedback that described search engine returns, then is carried out more to first token
New processing, to obtain the second token；
Then the distribution module is additionally operable to second token distributing to the N subject threads mark, for described
N subject threads obtain wait for corresponding with the N subject threads mark according to second token from described search engine
The corresponding N search results of search key；By N+1, the step is repeated, until all threads obtain corresponding search result.
It thereby may be ensured that the token that per thread uses all is effective.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
It obtains it is clear that understand through the implementation of the invention.The purpose of the present invention and other advantages can be by the explanations write
Specifically noted structure is realized and is obtained in book, claims and attached drawing.
Below by drawings and examples, technical scheme of the present invention will be described in further detail.
Description of the drawings
Attached drawing is used to provide further understanding of the present invention, and a part for constitution instruction, the reality with the present invention
It applies example to be used to explain the present invention together, not be construed as limiting the invention.In the accompanying drawings：
Fig. 1 is the flow diagram for the progress asynchronous refresh processing method that the embodiment of the present invention one provides；
Fig. 2 is the flow diagram of progress asynchronous refresh processing method provided by Embodiment 2 of the present invention；
Fig. 3 is the flow diagram for the progress asynchronous refresh processing method that the embodiment of the present invention three provides；
Fig. 4 is the flow diagram for the progress asynchronous refresh processing method that the embodiment of the present invention four provides；
Fig. 5 is the structural schematic diagram for the progress asynchronous refresh processing unit that the embodiment of the present invention five provides；
Fig. 6 is the structural schematic diagram for the progress asynchronous refresh processing unit that the embodiment of the present invention eight provides.
Specific implementation mode
Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings, it should be understood that preferred reality described herein
Apply example only for the purpose of illustrating and explaining the present invention and is not intended to limit the present invention.
Fig. 1 is the flow diagram for the progress asynchronous refresh processing method that the embodiment of the present invention one provides, as shown in Figure 1,
This approach includes the following steps：
Step 101 receives searching request, and described search request includes thread identification and corresponding user information and waits searching
Rope keyword.
In the present embodiment, searching request in many cases, including user information be identical, such as user
Name and password are identical.In addition, its corresponding thread identification differs, that is, it is shown to be multiple threads and shares a user information
Obtain the same token.
Step 102 is asked according to described search, obtains the first token corresponding with the user information.
If the quantity of step 103, described search request is multiple, it is determined that the 1st subject thread identifies.
First token is given corresponding 1st subject thread of the 1st subject thread mark by step 104, for institute
The 1st subject thread is stated according to first token, is obtained from described search engine corresponding with the 1st subject thread mark
Corresponding 1st search result of keyword to be searched.
In the present embodiment, multiple threads may obtain the first token according to the same user information, to according to this
First token obtains search result.Although shared first token, from absolute time, the same moment in multiple threads
There are one threads can use the first token, therefore, when number of threads is multiple, can first determine a thread, i.e. the 1st mesh for energy
The corresponding 1st subject thread mark of graticule journey obtains and the 1st subject thread mark so that the 1st subject thread is according to the first token
Know corresponding 1st search result of corresponding keyword to be searched.To ensure that in shared token, allow a thread every time
It scans for handling using the token.
In the present embodiment, by receiving searching request, which includes thread identification and corresponding user information
The first token corresponding with the user information is obtained, if the number of the searching request according to the searching request with keyword to be searched
Amount is multiple, it is determined that the 1st subject thread identifies, and the first token is distributed to the 1st subject thread and identifies corresponding 1st target
Thread obtains corresponding with the 1st subject thread mark so that the 1st subject thread is according to first token from search engine
Corresponding 1st search result of keyword to be searched, due to can the quantity of searching request be it is multiple when, determine the 1st target
Thread identification, and first token is given into the 1st subject thread and identifies corresponding 1st subject thread, for the 1st subject thread
Corresponding searching request is carried out using first token, it is thereby achieved that multiple threads can share a token, to effectively
Ground saves resource.
Fig. 2 is the flow diagram of progress asynchronous refresh processing method provided by Embodiment 2 of the present invention, in above-mentioned Fig. 1 institutes
On the basis of showing embodiment, as shown in Fig. 2, a kind of specific implementation of step 103 is：
It is suitable according to the time order and function for receiving described search request if the quantity of step 201, described search request is multiple
Sequence is ranked up described search request, and the thread identification in the searching request of sequence the 1st is determined the 1st subject thread mark
Know.
Then after step 104, this method can further include：
Thread identification in step 202, the searching request of determining sequence N determines that N subject threads identify, and will be described
First token distributes to N subject threads mark, so that the N subject threads are according to first token, from described
The corresponding N search results of corresponding with N subject threads mark keyword to be searched are obtained in search engine；By N+1,
The step is repeated, until all threads obtain corresponding search result.
Wherein, N is positive integer, and is 2 when N is initial.
In the present embodiment, when the 1st subject thread is when using the first token, other send the thread in searching request then
First token cannot be used, that is, until needing that the 1st subject thread is waited for use the first token.Further optionally, it can dock
It receives searching request to be ranked up according to the time, then allows corresponding thread to use the first token successively according to the sequence of sequence,
So as to realize the sequencing according to the time, thread is allowed to use token successively.
Fig. 3 is the flow diagram for the progress asynchronous refresh processing method that the embodiment of the present invention three provides, in above-mentioned Fig. 1 institutes
On the basis of showing embodiment, as shown in figure 3, a kind of specific implementation of step 103 is：
If the quantity of step 301, described search request is multiple, according to competitive way, the 1st subject thread mark is determined
Know.
Then after step 104, the method can also include：
Step 302, according to competitive way, determine that N subject threads identify；First token is distributed into the N
Subject thread identifies, and so that the N subject threads are according to first token, is obtained from described search engine and described the
The corresponding N search results of the corresponding keyword to be searched of N subject threads mark；By N+1, the step is repeated, until institute is wired
Journey obtains corresponding search result.
Wherein, N is positive integer, and is 2 when N is initial.
In the present embodiment, when the 1st subject thread is when using the first token, other send the thread in searching request then
First token cannot be used, that is, until needing that the 1st subject thread is waited for use the first token.Further optionally, Ke Yirang
Thread uses competitive way, i.e. which thread to get, which thread uses the token, so as to realize through the competing of thread
Mode is striven, determines which thread to use token.
Fig. 4 is the flow diagram for the progress asynchronous refresh processing method that the embodiment of the present invention four provides, as shown in figure 4,
This approach includes the following steps：
Step 401 receives searching request, and described search request includes thread identification and corresponding user information and waits searching
Rope keyword.
Step 402 is asked according to described search, obtains M tokens corresponding with the user information.
Wherein, M is positive integer, and is 1 when M is initial.
It is suitable according to the time order and function for receiving described search request if the quantity of step 403, described search request is multiple
Sequence is ranked up described search request, and the thread identification in the searching request of sequence the 1st is determined the 1st subject thread mark
Know.
The M tokens are given corresponding 1st subject thread of the 1st subject thread mark by step 404, for institute
The 1st subject thread is stated according to the M tokens, is obtained from described search engine corresponding with the 1st subject thread mark
Corresponding 1st search result of keyword to be searched.
Thread identification in step 405, the searching request of determining sequence N determines that N subject threads identify, and will be described
M tokens distribute to the N subject threads mark.
Wherein, N is positive integer, and is 2 when N is initial.
Step 406, the monitoring N subject threads identify corresponding N subject threads according to the M tokens, obtain
Whether include token overdue indicator in the search feedback that described search engine returns；If not including, N is added 1, executes step
405；If including thening follow the steps 407.
Step 407, processing is updated to the M tokens, to obtain M+1 tokens.
The M+1 tokens are distributed to the N subject threads mark, and M are added 1 by step 408, execute step
406。
In the present embodiment, for example, if the quantity for receiving searching request is 4, according to chronological order, to searching
Rope request is ranked up, then the thread identification being ordered as in the 1st searching request, which is the 1st subject thread mark, is ordered as 2 searches
Thread identification in rope request is the 2nd subject thread mark, the thread identification being ordered as in 3 searching request is the 3rd score
Journey identifies, and is ordered as the thread identification in 4 searching request and is identified for the 4th subject thread.
In addition, corresponding first token of user information, which is first given the 1st subject thread, identifies corresponding 1st subject thread,
So that the 1st subject thread is according to the first token, wait for corresponding with the 1st subject thread mark is obtained from described search engine
Corresponding 1st search result of search key；The first token is given into the 2nd subject thread again and identifies corresponding 2nd subject thread,
So that the 2nd subject thread is according to the first token, wait for corresponding with the 2nd subject thread mark is obtained from described search engine
Corresponding 2nd search result of search key；The first token is given into the 3rd subject thread again and identifies corresponding 3rd subject thread,
Due to the use of number and time restriction, may the 3rd subject thread can not reuse first token, that is, obtain search engine return
The search feedback returned includes token overdue indicator, then updates the first token, obtain the second token, the second token is given the 3rd
Subject thread identifies corresponding 3rd subject thread and is obtained from described search engine so that the 3rd subject thread is according to the second token
Take corresponding 3rd search result of corresponding with the 3rd subject thread mark keyword to be searched；The second token is given again
4 subject threads identify corresponding 4th subject thread and are obtained from described search engine so that the 4th subject thread is according to the second token
Take corresponding 4th search result of corresponding with the 4th subject thread mark keyword to be searched.To realize 4 threads point
It enjoys a token or updated token scans for handling.
Fig. 5 is the structural schematic diagram for the progress asynchronous refresh processing unit that the embodiment of the present invention five provides, as shown in figure 5,
The device of the present embodiment includes：Receiving module 11, acquisition module 12, determining module 13 and distribution module 14；Wherein, receiving module
11 for receiving searching request, and described search request includes thread identification and corresponding user information and keyword to be searched；
Acquisition module 12 obtains the first token corresponding with the user information for being asked according to described search；Determining module 13 is used
If being multiple in the quantity that described search is asked, it is determined that the 1st subject thread identifies；Distribution module 14 by described first for enabling
Board gives the 1st subject thread and identifies corresponding 1st subject thread, so that the 1st subject thread is enabled according to described first
Board obtains keyword to be searched corresponding with the 1st subject thread mark the corresponding 1st from described search engine and searches for knot
Fruit.
Progress asynchronous refresh processing unit in the present embodiment can execute the technical solution of embodiment of the method shown in Fig. 1,
Its realization principle and advantageous effect are similar, and details are not described herein again.
Further, in the embodiment of the present invention six, on the basis of above-mentioned embodiment illustrated in fig. 5, the determining module
If 13 be specifically used for described search request quantity be it is multiple, according to receive described search request chronological order, it is right
Described search request is ranked up, and the thread identification in the searching request of sequence the 1st is determined that the 1st subject thread identifies；Then
The distribution module 14 is additionally operable to determine that the thread identification in the searching request of sequence N determines that N subject threads identify, and will
First token distributes to N subject threads mark, so that the N subject threads are according to first token, from
The corresponding N search results of corresponding with N subject threads mark keyword to be searched are obtained in described search engine；It will
N+1 repeats the step, until all threads obtain corresponding search result；Wherein, N is positive integer, and is 2 when N is initial.
Progress asynchronous refresh processing unit in the present embodiment can execute the technical solution of embodiment of the method shown in Fig. 2,
Its realization principle and advantageous effect are similar, and details are not described herein again.
Further, in the embodiment of the present invention seven, on the basis of above-mentioned embodiment illustrated in fig. 5, the determining module
If 13 quantity for being specifically used for described search request are multiple, according to competitive way, determine that the 1st subject thread identifies；Then institute
Distribution module 14 is stated to be additionally operable to, according to competitive way, determine that N subject threads identify；First token is distributed to described
N subject threads identify, so that the N subject threads are according to first token, obtained from described search engine with it is described
The corresponding N search results of the corresponding keyword to be searched of N subject threads mark；By N+1, the step is repeated, until all
Thread obtains corresponding search result；Wherein, N is positive integer, and is 2 when N is initial.
Progress asynchronous refresh processing unit in the present embodiment can execute the technical solution of embodiment of the method shown in Fig. 3,
Its realization principle and advantageous effect are similar, and details are not described herein again.
Fig. 6 is the structural schematic diagram for the progress asynchronous refresh processing unit that the embodiment of the present invention eight provides, in above-mentioned implementation
On the basis of example six or seven, which further includes：If update module 21 is corresponding for monitoring the N subject threads mark
For N subject threads according to first token, it includes token overdue indicator to obtain the search feedback that described search engine returns,
Processing then is updated to first token, to obtain the second token；Then the distribution module 14 is additionally operable to described second
Token distributes to the N subject threads mark, so that the N subject threads are according to second token, from described search
The corresponding N search results of corresponding with N subject threads mark keyword to be searched are obtained in engine；By N+1, repeat
The step, until all threads obtain corresponding search result.
Progress asynchronous refresh processing unit in the present embodiment can execute the technical solution of embodiment of the method shown in Fig. 4,
Its realization principle and advantageous effect are similar, and details are not described herein again.
It should be understood by those skilled in the art that, the embodiment of the present invention can be provided as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, the present invention can be used in one or more wherein include computer usable program code computer
The shape for the computer program product implemented in usable storage medium (including but not limited to magnetic disk storage and optical memory etc.)
Formula.
The present invention be with reference to according to the method for the embodiment of the present invention, the flow of equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that can be realized by computer program instructions every first-class in flowchart and/or the block diagram
The combination of flow and/or box in journey and/or box and flowchart and/or the block diagram.These computer programs can be provided
Instruct the processor of all-purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine so that the instruction executed by computer or the processor of other programmable data processing devices is generated for real
The device for the function of being specified in present one flow of flow chart or one box of multiple flows and/or block diagram or multiple boxes.
These computer program instructions, which may also be stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that instruction generation stored in the computer readable memory includes referring to
Enable the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one box of block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device so that count
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, in computer or
The instruction executed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
God and range.In this way, if these modifications and changes of the present invention belongs to the range of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to include these modifications and variations.
Claims (8)
1. a kind of shared processing method, which is characterized in that include the following steps：
Searching request is received, described search request includes thread identification and corresponding user information and keyword to be searched；
It is asked according to described search, obtains the first token corresponding with the user information；
If the quantity of described search request is multiple, it is determined that the 1st subject thread identifies；
First token is given into the 1st subject thread and identifies corresponding 1st subject thread, for the 1st score
Journey obtains keyword pair to be searched corresponding with the 1st subject thread mark according to first token from search engine
The 1st search result answered.
2. according to the method described in claim 1, it is characterized in that, if the quantity of described search request is multiple, really
Fixed 1st subject thread mark, including：
If the quantity of described search request is multiple, according to the chronological order for receiving described search request, searched to described
Rope request is ranked up, and the thread identification in the searching request of sequence the 1st is determined that the 1st subject thread identifies；
Then after the 1st subject thread obtains corresponding 1st search result, the method further includes：
It determines that the thread identification in the searching request of sequence N determines that N subject threads identify, and first token is distributed
It identifies to the N subject threads, so that the N subject threads are according to first token, is obtained from described search engine
Take the corresponding N search results of corresponding with N subject threads mark keyword to be searched；By N+1, N+1 mesh is repeated
Graticule journey obtains the step of corresponding N+1 search results, until all threads obtain corresponding search result；
Wherein, N is positive integer, and is 2 when N is initial.
3. according to the method described in claim 1, it is characterized in that, if the quantity of described search request is multiple, really
Fixed 1st subject thread mark, including：
If the quantity of described search request is multiple, according to competitive way, determine that the 1st subject thread identifies；
Then after the 1st subject thread obtains corresponding 1st search result, the method further includes：
According to competitive way, determine that N subject threads identify；First token is distributed into the N subject threads mark,
So that the N subject threads are according to first token, obtain from described search engine and identified with the N subject threads
The corresponding N search results of corresponding keyword to be searched；By N+1, repeats the corresponding N+1 of N+1 subject threads acquisition and search
The step of hitch fruit, until all threads obtain corresponding search result；
Wherein, N is positive integer, and is 2 when N is initial.
4. according to any method of Claims 2 or 3, which is characterized in that further include：
If monitoring, the N subject threads identify corresponding N subject threads according to first token, obtain described search
The search feedback that engine returns includes token overdue indicator, then processing is updated to first token, to obtain second
Token；
Second token is distributed into the N subject threads mark, so that the N subject threads are enabled according to described second
Board obtains the corresponding N of corresponding with N subject threads mark keyword to be searched from described search engine and searches for and ties
Fruit；By N+1, the step of N+1 subject threads obtain corresponding N+1 search results is repeated, is corresponded to until all threads obtain
Search result.
5. a kind of shared processing unit, which is characterized in that including：
Receiving module, for receiving searching request, described search request includes thread identification and corresponding user information and waits for
Search key；
Acquisition module obtains the first token corresponding with the user information for being asked according to described search；
Determining module, if the quantity for described search request is multiple, it is determined that the 1st subject thread identifies；
Distribution module identifies corresponding 1st subject thread for first token to be given the 1st subject thread, for
1st subject thread obtains wait for corresponding with the 1st subject thread mark according to first token from search engine
Corresponding 1st search result of search key.
6. device according to claim 5, which is characterized in that if the determining module is specifically used for described search request
Quantity is multiple, then according to the chronological order for receiving described search request, is ranked up to described search request, and will row
Thread identification in the searching request of sequence the 1st determines that the 1st subject thread identifies；
Then the distribution module is additionally operable to determine that the thread identification in the searching request of sequence N determines that N subject threads identify,
And first token is distributed into the N subject threads and is identified, so that the N subject threads are enabled according to described first
Board obtains the corresponding N of corresponding with N subject threads mark keyword to be searched from described search engine and searches for and ties
Fruit；By N+1, the step of N+1 subject threads obtain corresponding N+1 search results is repeated, is corresponded to until all threads obtain
Search result；
Wherein, N is positive integer, and is 2 when N is initial.
7. device according to claim 5, which is characterized in that if the determining module is specifically used for described search request
Quantity is multiple, then according to competitive way, determines that the 1st subject thread identifies；
Then the distribution module is additionally operable to, according to competitive way, determine that N subject threads identify；First token is distributed to
The N subject threads mark, so that the N subject threads are according to first token, obtains from described search engine
The corresponding N search results of corresponding with N subject threads mark keyword to be searched；By N+1, N+1 targets are repeated
Thread obtains the step of corresponding N+1 search results, until all threads obtain corresponding search result；
Wherein, N is positive integer, and is 2 when N is initial.
8. any device of according to claim 6 or 7, which is characterized in that further include：
Update module, if being enabled according to described first for monitoring that the N subject threads identify corresponding N subject threads
Board, it includes token overdue indicator to obtain the search feedback that described search engine returns, then is updated to first token
Processing, to obtain the second token；
Then the distribution module is additionally operable to second token distributing to the N subject threads mark, for the N mesh
Graticule journey obtains corresponding to be searched with the N subject threads mark according to second token from described search engine
The corresponding N search results of keyword；By N+1, the step of N+1 subject threads obtain corresponding N+1 search results is repeated,
Until all threads obtain corresponding search result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511004740.3A CN105574407B (en) | 2015-12-28 | 2015-12-28 | A kind of shared treating method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511004740.3A CN105574407B (en) | 2015-12-28 | 2015-12-28 | A kind of shared treating method and apparatus |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105574407A CN105574407A (en) | 2016-05-11 |
| CN105574407B true CN105574407B (en) | 2018-09-25 |
Family
ID=55884526
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511004740.3A Expired - Fee Related CN105574407B (en) | 2015-12-28 | 2015-12-28 | A kind of shared treating method and apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105574407B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108121815B (en) * | 2017-12-28 | 2022-03-11 | 深圳开思时代科技有限公司 | Automobile part query method, device and system, electronic equipment and medium |
| CN109840179B (en) * | 2018-12-15 | 2023-04-11 | 中国平安人寿保险股份有限公司 | RocktMQ thread number monitoring method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5771383A (en) * | 1994-12-27 | 1998-06-23 | International Business Machines Corp. | Shared memory support method and apparatus for a microkernel data processing system |
| CN1610877A (en) * | 2001-11-01 | 2005-04-27 | 弗里塞恩公司 | High speed non-concurrency controlled database |
| CN101194230A (en) * | 2005-06-06 | 2008-06-04 | 特兰斯蒂有限公司 | Method and apparatus for converting program code with access coordination for a shared resource |
-
2015
- 2015-12-28 CN CN201511004740.3A patent/CN105574407B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5771383A (en) * | 1994-12-27 | 1998-06-23 | International Business Machines Corp. | Shared memory support method and apparatus for a microkernel data processing system |
| CN1610877A (en) * | 2001-11-01 | 2005-04-27 | 弗里塞恩公司 | High speed non-concurrency controlled database |
| CN101194230A (en) * | 2005-06-06 | 2008-06-04 | 特兰斯蒂有限公司 | Method and apparatus for converting program code with access coordination for a shared resource |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105574407A (en) | 2016-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Security games with arbitrary schedules: A branch and price approach | |
| Abdulhamid et al. | Tasks scheduling technique using league championship algorithm for makespan minimization in IAAS cloud | |
| CN104350504B (en) | The method and apparatus of program flow in being operated for software | |
| JP6083290B2 (en) | Distributed processing system | |
| CN106529682A (en) | Method and apparatus for processing deep learning task in big-data cluster | |
| Kaleem et al. | Stochastic gradient descent on GPUs | |
| US9852050B2 (en) | Selecting computing resources | |
| CN110008031A (en) | Apparatus operation method, group system, electronic equipment and read/write memory medium | |
| CN105574407B (en) | A kind of shared treating method and apparatus | |
| Conitzer | On Stackelberg mixed strategies | |
| Obraztsova et al. | On manipulation in multi-winner elections based on scoring rules | |
| CN106897299A (en) | A kind of data bank access method and device | |
| CN109948632B (en) | Data training method, device and system and computer equipment | |
| Fearnley | Efficient parallel strategy improvement for parity games | |
| FI3683678T3 (en) | Computer-implemented method, computer program and data processing system | |
| Alistarh et al. | Lock-free algorithms under stochastic schedulers | |
| CN107209761B (en) | A kind of data access method, apparatus and system | |
| CN110505276A (en) | Object matching method, apparatus and system, electronic equipment and storage medium | |
| Jain et al. | Optimal defender allocation for massive security games: A branch and price approach | |
| CN109426561A (en) | A kind of task processing method, device and equipment | |
| Qi et al. | Solving the multi-mode resource availability cost problem in project scheduling based on modified particle swarm optimization | |
| CN106598726A (en) | Multi-task management system and distributed deployment method thereof | |
| US20220331692A1 (en) | Program, information processing apparatus, and control method for providing a strategic battle game | |
| CN103530742B (en) | Improve the method and device of scheduling arithmetic speed | |
| CN106202225B (en) | Arrangement method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right | ||
| PE01 | Entry into force of the registration of the contract for pledge of patent right |
Denomination of invention: A shared processing method and device Effective date of registration: 20210104 Granted publication date: 20180925 Pledgee: Inner Mongolia Huipu Energy Co.,Ltd. Pledgor: WUXI TVMINING MEDIA SCIENCE & TECHNOLOGY Co.,Ltd. Registration number: Y2020990001517 |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180925 Termination date: 20211228 |