CN109710402A - Method, apparatus, computer equipment and the storage medium of process resource acquisition request - Google Patents
Method, apparatus, computer equipment and the storage medium of process resource acquisition request Download PDFInfo
- Publication number
- CN109710402A CN109710402A CN201811544380.XA CN201811544380A CN109710402A CN 109710402 A CN109710402 A CN 109710402A CN 201811544380 A CN201811544380 A CN 201811544380A CN 109710402 A CN109710402 A CN 109710402A
- Authority
- CN
- China
- Prior art keywords
- resource acquisition
- acquisition request
- service node
- product
- public service
- 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
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application involves research and development administrative skill fields, provide method, apparatus, computer equipment and the storage medium of a kind of process resource acquisition request.The described method includes: receiving resource acquisition request, product identification information is carried in the resource acquisition request；Resource acquisition request is written in the corresponding application queue of the product identification information；Idle thread is determined from the corresponding thread pool of the application queue；The idle thread is called to read resource acquisition request from the application queue, and after reading resource acquisition request, destination service node corresponding with the resource acquisition request read is called according to predetermined calling sequence, to respond the resource acquisition read request.It can be improved resource acquisition request treatment effeciency using the present processes.
Description
Technical field
This application involves Internet technical fields, method, apparatus, meter more particularly to a kind of process resource acquisition request
Calculate machine equipment and storage medium.
Background technique
With the rapid development of Internet technology, business under many lines in each financial service enterprise, such as various loan industries
Business, insurance sales business etc., gradually switch to handle on line.
On line in processing mode, computer is usually after receiving the request that client is sent by terminal
The request is responded to complete corresponding operation flow.However, computer is logical when handling these requests in traditional technology
It is often uniformly processed, so, when the corresponding request of certain business increases sharply in a short time, is likely to result in other business
Request be unable to get timely processing, it is low so as to cause overall treatment efficiency.
Summary of the invention
Based on this, it is necessary to which in view of the above technical problems, providing a kind of can be improved resource acquisition request treatment effeciency
Method, apparatus, computer equipment and the storage medium of process resource acquisition request.
A kind of method of process resource acquisition request, which comprises
Resource acquisition request is received, carries product identification information in the resource acquisition request；
Resource acquisition request is written in the corresponding application queue of the product identification information；
Idle thread is determined from the corresponding thread pool of the application queue；
It calls the idle thread to read resource acquisition request from the application queue, and is asked reading resource acquisition
After asking, destination service node corresponding with the resource acquisition request read is called according to predetermined calling sequence,
To respond the resource acquisition read request.
In one of the embodiments, before reception resource acquisition request, comprising:
Obtain the corresponding process description information of the product to be developed；
To the process description information carry out keyword extraction, by the keyword of extraction respectively with preset public clothes
The corresponding keyword of each public service node is matched in business node set, obtains corresponding of each public service node
With degree；
It will be more than the corresponding public service of the matching degree of preset threshold when there is the matching degree more than preset threshold
Node is determined as the corresponding destination service node of the product to be developed.
In one of the embodiments, before reception resource acquisition request, further includes:
Determine public service group belonging to the destination service node；
Obtain the corresponding default calling sequence of the public service group；
The calling sequence of each destination service node is determined according to the corresponding default calling sequence of the public service group.
In one of the embodiments, described from the corresponding thread pool of the application queue determine idle thread it
Before, comprising:
Obtain the history application quantity of each product in current production set；
Each production in current production set is determined according to the history application quantity of each product in each current production set
The number of threads of the corresponding thread pool of product.
It is described in one of the embodiments, that keyword extraction is carried out to the process description information, comprising:
The process description information is segmented, and word segmentation result is filtered；
Candidate keywords figure is established according to the word obtained after filtering, and obtains the pre- of word node in the candidate keywords figure
If initial weight；
According to candidate keywords figure described in the default initial weight loop iteration, until being obtained when reaching preset condition
Word node weights；
To institute's predicate node weights Bit-reversed, the word of present count is obtained as keyword according to ranking results.
A kind of device of process resource acquisition request, described device include:
Resource acquisition request receiving module carries product in the resource acquisition request for receiving resource acquisition request
Identification information；
Writing module is requested in resource acquisition, corresponding for the product identification information to be written in resource acquisition request
In application queue；
Idle thread determining module, for determining idle thread from the corresponding thread pool of the application queue；
Destination service node calling module, for calling the idle thread to read resource acquisition from the application queue
Request, and after reading resource acquisition request, it calls according to predetermined calling sequence and is obtained with the resource read
The corresponding destination service node of request is taken, to respond the resource acquisition read request.
Above-mentioned apparatus in one of the embodiments, further include: destination service node calling module, for obtain it is described to
The corresponding process description information of development；Keyword extraction is carried out to the process description information, by the key of extraction
Keyword corresponding with public service node each in preset public service node set is matched word respectively, is obtained each
The corresponding matching degree of public service node；It, will be more than described in preset threshold when there is the matching degree more than preset threshold
It is determined as the corresponding destination service node of the product to be developed with corresponding public service node is spent.
Above-mentioned apparatus in one of the embodiments, further include: calling sequence determining module, for determining the target clothes
Public service group belonging to business node；Obtain the corresponding default calling sequence of the public service group；According to the public service
The corresponding default calling sequence of group determines the calling sequence of each destination service node.
A kind of computer equipment, including memory and processor, the memory are stored with computer program, the processing
Device realizes the step of method of process resource acquisition request described in above-mentioned any embodiment when executing the computer program.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
The step of method of process resource acquisition request described in above-mentioned any embodiment is realized when row.
Method, apparatus, computer equipment and the storage medium of above-mentioned process resource acquisition request, by different products
Different application queues is set, after receiving resource acquisition request, according to resource acquisition request in the current production pair that carries
The identification information answered resource acquisition request is written in the corresponding application queue of the identification information, it is ensured that each
It is independent of each other, is avoided because the request amount of some product increases sharply in a short time and leads to it between the resource acquisition request of product
The problem of request of his product can not be read in time then determines idle thread from the corresponding thread pool of the application queue,
It calls the idle thread to read resource acquisition request from the application queue, and after reading resource acquisition request, presses
Destination service node corresponding with the resource acquisition request read is called according to predetermined calling sequence, is read with responding
The resource acquisition request got, due to being provided with separate threads pond, the corresponding treatment progress of each product to each product
Between can be independent of each other, thus guarantee each product resource acquisition request can in time it is processed, improve resource acquisition
The overall treatment efficiency of request.
Detailed description of the invention
Fig. 1 is the application scenario diagram of the method for process resource acquisition request in one embodiment；
Fig. 2 is the flow diagram of the method for process resource acquisition request in one embodiment；
Fig. 3 is the step flow diagram for carrying out keyword extraction in one embodiment to process description information；
Fig. 4 is the structural block diagram of the device of process resource acquisition request in one embodiment；
Fig. 5 is the internal structure chart of computer equipment in one embodiment.
Specific embodiment
It is with reference to the accompanying drawings and embodiments, right in order to which the objects, technical solutions and advantages of the application are more clearly understood
The application is further elaborated.It should be appreciated that specific embodiment described herein is only used to explain the application, not
For limiting the application.
The method of process resource acquisition request provided by the present application, can be applied in application environment as shown in Figure 1.Its
In, terminal 102 is communicated by network with server 104.Server can receive the resource acquisition request that terminal 102 is sent,
And according to resource acquisition request in the product identification information that carries corresponding application queue is written into resource acquisition request, then
Idle thread is determined from the corresponding thread pool of this application queue, is then called idle thread to read resource from application queue and is obtained
Request is taken, and after reading resource acquisition request, the resource acquisition called and read according to predetermined calling sequence
Corresponding destination service node is requested, to respond the resource acquisition read request.Wherein, terminal 102 can be, but not limited to be
Various personal computers, laptop, smart phone, tablet computer, server 104 can be with independent servers either
The server cluster of multiple servers composition is realized.
In one embodiment, it as shown in Fig. 2, providing a kind of method of process resource acquisition request, answers in this way
For being illustrated for the server in Fig. 1, comprising the following steps:
Step S202 receives resource acquisition request, carries product identification information in resource acquisition request.
Wherein, resource acquisition request refers to the request obtained to resource that terminal is sent, what resource here referred to
It is virtual resource, ideal money, virtual product etc. for example can be according to different business, resource acquisition request includes but not
It is limited to the loan requests to various loan products, the request of the purchase to insurance products etc..Product identification information is used for resource
The corresponding product of acquisition request carries out unique identification, and product therein for example can be loan according to different business scenarios and produce
Product, insurance products, finance product etc..
In the present embodiment, when user needs to apply some product, it can trigger and apply in terminal, such as when user needs Shen
Please some loan product when, terminal loan product can be clicked and show corresponding " immediately entering " button in interface, terminal is detecting
After the operation for triggering loan application to user, the loan requests for carrying the corresponding product identification of current loan product are generated, will be given birth to
At loan requests be sent to server.
Step S204 requests resource acquisition in the corresponding application queue of write-in product identification information.
Specifically, server would generally receive multiple resource acquisition requests whithin a period of time, these resource acquisitions are asked
It asks and generally involves multiple products, can be each product distribution one to guarantee not influence mutually between each different product
A memory headroom, the corresponding memory headroom of each product are provided with application queue and thread pool, wherein application queue is for pressing
The corresponding resource acquisition request of some product is stored according to application time sequencing, multiple threads is run in thread pool, is used for
Resource acquisition request is read from application queue, and after reading resource acquisition request, determine that resource acquisition request corresponds to
Application process.In the present embodiment, the corresponding queue identity of application queue and product identification establish incidence relation, server in advance
After receiving resource acquisition request, can be requested according to resource acquisition in the product identification that carries find corresponding queue mark
The corresponding application queue of queue identity known, and resource acquisition request write-in is found.
Step S206 determines idle thread from the corresponding thread pool of application queue.
Step S208 calls idle thread to read resource acquisition request from application queue, and is reading resource acquisition
After request, destination service node corresponding with the resource acquisition request read is called according to predetermined calling sequence, with
Respond the resource acquisition request read.
Specifically, thread pool is a kind of multiple threads form, and task is added to queue in treatment process, is then being created
It builds and starts these tasks after thread automatically, per thread all using the storehouse size of default, is run with the priority of default, and is located
In multiple thread units.In the present embodiment, server can read resource from application queue and obtain after idle thread has been determined
Request is taken, since in chronological sequence sequence arranges the resource acquisition request in application queue, thread is reading resource acquisition request
When also read according to chronological order, i.e., write time preceding resource acquisition request is first read, by the resource acquisition of reading
Request is determined as target resource acquisition request.In one embodiment, in order to avoid same resource acquisition request is more simultaneously
A thread is read, and queue lock can be set, i.e., when some thread accesses application queue reads resource acquisition request, will apply
Queue locking, so that other threads can not be accessed in the same time, to guarantee a resource acquisition request only by a thread
It reads.
The service node called required for the corresponding application process of the current production that destination service node refers to.Since application is flowed
Journey generally includes multiple links, each link corresponds to different business functions, therefore, application process can be split as multiple
Link, and application process is completed by calling the service node that can be realized the corresponding business function of links.For example, certain
The process of the entire loan application of a loan product includes: data input, authentication, loan three links of examination & approval, can be distinguished
The corresponding service node of these three links is called to realize this application process.
Destination service node can be determined when carrying out process exploitation, and after having determined destination service node,
Destination service node and product identification are established into incidence relation.In one embodiment, in the application process exploitation for carrying out product
When, developer can by way of manual configuration from public service node set selection target service node, and further
Determine the calling sequence of destination service node to obtain application process；In another embodiment, server can receive
After the process description information that developer provides, according to the process description information, determined from public service node set automatically
Destination service node.
In the present embodiment, server can obtain after calling idle thread to read target resource acquisition request according to resource
The destination service node and corresponding tune for taking the product identification carried in request to determine that the target resource acquisition request needs to call
With sequence, these destination service nodes are successively called from public service node set according to the sequence, to respond thread reading
The resource acquisition request arrived.
In the method for above-mentioned process resource acquisition request, by different products being arranged different application queues, connecing
After receiving resource acquisition request, according to resource acquisition request in the corresponding identification information of current production that carries, by resource acquisition
In the corresponding application queue of request write-in identification information, it is ensured that it is independent of each other between the resource acquisition request of each product,
It avoids the problem that because the request amount of some product increases sharply in a short time and the request of other products is caused not read in time,
Then idle thread is determined from the corresponding thread pool of application queue, and idle thread is called to read resource acquisition from application queue
Request, and after reading resource acquisition request, it calls according to predetermined calling sequence and is asked with the resource acquisition read
Corresponding destination service node is sought, to respond the resource acquisition read request, due to being provided with separate threads to each product
Pond can be independent of each other between the corresponding treatment progress of each product, to guarantee that the resource acquisition request of each product can
It is processed in time, improve the overall treatment efficiency of resource acquisition request.
In one embodiment, before receiving resource acquisition request, comprising: obtain the corresponding process of product to be developed and retouch
State information；To process description information carry out keyword extraction, by the keyword of extraction respectively with preset public service node collection
The corresponding keyword of each public service node is matched in conjunction, obtains the corresponding matching degree of each public service node；When
When in the presence of being more than the matching degree of preset threshold, the corresponding public service node of matching degree more than preset threshold is determined as wait open
Send out the corresponding destination service node of product.
Wherein, public service node set refers to the set as composed by public service node, and public service node refers to
Be service node that the loan process for being provided to each loan product developed is called, different public clothes
Node be engaged in for realizing different business functions.Product to be developed refers to the product for needing to carry out application process exploitation.Process
Description information refers to the information that the application process for treating development is described, in order to enable the determination of destination service node
More accurate, process description information can be arranged according to prior between developer to the loan developed by business demand side
The loan process of product is described to obtain according to preset format.In the present embodiment, in public service node set
Corresponding keyword can be arranged in advance according to its corresponding business function, for example, for recognition of face in each public service node
The settable keyword of service node " recognition of face ", server close description information after getting process description information
Keyword extracts, and obtains multiple keywords, respectively by each public service section in each keyword and public service node set
The corresponding keyword of point is matched, to obtain the corresponding matching degree of each public service node.
It in one embodiment, can be by the keyword extracted in process description information and public clothes when calculating matching degree
The corresponding keyword of business node is each mapped to term vector, is matched by calculating the cosine similarity between term vector
Degree, wherein keyword, which is mapped as term vector, can be used word2vec tool.
Further, server judges whether the corresponding matching degree of each public service node is more than preset threshold, if some
The corresponding matching degree of public service node is more than preset threshold, then the public service node is determined as destination service node.
In one embodiment, when some keyword in multiple keywords of extraction is corresponding with all public service nodes
Keyword between matching degree be no more than preset threshold, can determine that public service node set, there is no the keyword is corresponding
Destination service node, in this case, server can according to the keyword generate a service node customized task, by this
Developer is distributed in business, so that developer after receiving the task, develops new service node, this is newly developed out
Service node be added in public service node set, while the new service node is determined as destination service node.
In one embodiment, before receiving resource acquisition request, further includes: determine public affairs belonging to destination service node
Service group altogether；Obtain the corresponding default calling sequence of public service group；It is true according to the corresponding default calling sequence of public service group
The calling sequence of fixed each destination service node.
Specifically, the service node in public service node set can save service according to business function after configuration is good
Point is clustered, i.e., will be divided into the same public service group for realizing the service node of same or like business function, example
Such as, " recognition of face service " and " public security net authentication service " may be used to realize authentication, therefore can take the two
Business node division is that the same public service group can be corresponding according to each public service group after having divided public service group
Business function is ranked up the calling sequence of public service group.
In the present embodiment, server is after having determined destination service node, it may be determined that belonging to each destination service node
Public service group, then obtain these public service groups default calling sequence, by the corresponding default calling of public service group
Sequence is ranked up all destination service nodes as the calling sequence of its corresponding target server node, so that it is determined that
The calling sequence of destination service node.For example, three destination services node A1, A2, A3 have been determined for loan product A,
Wherein, public service group belonging to destination service node A1 is X1, and public service group belonging to destination service node A2 is X2, mesh
Marking public service group belonging to service node A3 is X3, and the corresponding default calling sequence of X1, X2, X3 is respectively 5,1,3, according to this
Default calling sequence is ranked up as A2, A3, A1 A1, A2, A3, therefore loan process corresponding for loan product A, server
When carrying out service node calling, determining calling sequence is A2, A3, A1.
It is appreciated that for the target service node for belonging to a public service group, calling sequence successively can be with
Machine determines.
In above-described embodiment, it is ranked up by dividing public service group, and to the calling of public service group sequence, then
The calling sequence of destination service node is determined according to the calling of public service group sequence, after having divided public service group, only
It needs to be ranked up public service group, the quantity of public service group greatly reduces relative to service node, therefore can save
Sorting time, to improve development efficiency.
In one embodiment, before determining idle thread in the corresponding thread pool of application queue, comprising: acquisition is worked as
The history application quantity of each product in preceding product set；It is true according to the history application quantity of product each in current production set
Determine the number of threads of the corresponding thread pool of each product.
Specifically, server can obtain the history application quantity of each product in current production set, wherein history application
Quantity can be one day on each product that server receives resource acquisition number of requests, is also possible to server and receives
Each product in preset historical period (such as first three day) resource acquisition number of requests,
Server can also determine the total number of threads amount that can currently run, according to the corresponding history application quantity of each product
And the total number of threads amount that can run of server determines the number of threads of the corresponding thread pool of each product in proportion.For example,
There are three thread pools on server, respectively correspond loan product A, B, C, wherein the corresponding history application quantity of A, B, C point
Not Wei 10000,20000,30000, the total number of threads amount run of server is 60, then the corresponding Thread Count of loan product A
Amount is 60x1/6=10, and the corresponding number of threads of loan product B is 60x2/6=20, and the corresponding number of threads of loan product C is
60x3/6=30.
In one embodiment, as shown in figure 3, carrying out keyword extraction to process description information, comprising:
S302 segments process description information, and is filtered to word segmentation result.
Specifically, server carries out word segmentation processing to process description information and part-of-speech tagging is handled, and carries out to word segmentation result
Filtering filters out stop words, retain the word of specified part of speech, and forms the set of word.Wherein, stop words refers to and other word phases
Than the word of no physical meaning.It may include English character, number, mathematical character, punctuation mark and the extra-high single Chinese of frequency of use
Word etc..
S304 establishes candidate keywords figure according to the word obtained after filtering, and obtains word node in candidate keywords figure
Default initial weight.
Wherein, candidate keywords figure is the oriented authorized graph being composed of words.The oriented sequence structure referred to according to text
Candidate keywords figure is built, has the right to refer to the degree of correlation between word and word.
Specifically, using each word obtained after filtering as the node of candidate keywords figure, according to preset window size
The side between word and word is formed using cooccurrence relation, obtains candidate keywords figure.Word node is pre- in acquisition candidate keywords figure
If initial weight.Wherein, the default initial weight of word node can be 1.0f.
S306, according to default initial weight loop iteration candidate keywords figure, until obtaining word section when reaching preset condition
Point weight.
Specifically, it is used in candidate keywords figureIteration
The weight of each node is propagated, until obtaining word node weights when restraining or reaching default the number of iterations.Wherein, V table in formula
Show that word node, WS indicate word node weights.W indicates side right weight, is obtained according to the similarity of the word node of side composition, and d is damping
Coefficient, value range are 0 to 1, represent the probability that a certain specified point from figure is directed toward any other point, and general value is 0.85,
In indicates the point set for being directed toward the word node, and Out indicates the point set for the word node that the word node is directed toward.
S308 obtains the word of present count as keyword according to ranking results to word node weights Bit-reversed.
Specifically, to word node weights carry out Bit-reversed, obtain corresponding word node according to the size of weight, from greatly to
The small word node for successively selecting preset quantity, using the corresponding word of word node selected as keyword.
In above-described embodiment, by being segmented to process description information, and word segmentation result is filtered, according to filtering
The word obtained afterwards establishes candidate keywords figure, and obtains the default initial weight of word node in candidate keywords figure, loop iteration
Candidate keywords figure, until word node weights are obtained, to word node weights Bit-reversed, according to sequence when reaching preset condition
As a result obtain the word of present count as keyword, make it possible to it is more convenient extract keyword, improve mentioning for keyword
Take efficiency.
It should be understood that although each step in the flow chart of Fig. 2-3 is successively shown according to the instruction of arrow,
These steps are not that the inevitable sequence according to arrow instruction successively executes.Unless expressly stating otherwise herein, these steps
Execution there is no stringent sequences to limit, these steps can execute in other order.Moreover, at least one in Fig. 2-3
Part steps may include that perhaps these sub-steps of multiple stages or stage are not necessarily in synchronization to multiple sub-steps
Completion is executed, but can be executed at different times, the execution sequence in these sub-steps or stage is also not necessarily successively
It carries out, but can be at least part of the sub-step or stage of other steps or other steps in turn or alternately
It executes.
In one embodiment, as shown in figure 4, providing a kind of device 400 of process resource acquisition request, comprising:
Resource acquisition request receiving module 402 carries product mark in resource acquisition request for receiving resource acquisition request
Know information；
Writing module 404 is requested in resource acquisition, for the corresponding application of write-in product identification information to be requested in resource acquisition
In queue；
Idle thread determining module 406, for determining idle thread from the corresponding thread pool of application queue；
Destination service node calling module 408, for calling idle thread to read resource acquisition request from application queue,
And after reading resource acquisition request, called according to predetermined calling sequence corresponding with the resource acquisition request read
Destination service node, with respond read resource acquisition request.
In one embodiment, above-mentioned apparatus further include: destination service node determining module, for obtaining product to be developed
Corresponding process description information；To process description information carry out keyword extraction, by the keyword of extraction respectively with preset public affairs
The corresponding keyword of each public service node is matched in service node set altogether, and it is corresponding to obtain each public service node
Matching degree；It will be more than the corresponding public service section of matching degree of preset threshold when there is the matching degree more than preset threshold
Point is determined as the corresponding destination service node of product to be developed.
In one embodiment, above-mentioned apparatus further include: calling sequence determining module, for determining destination service node institute
The public service group of category；Obtain the corresponding default calling sequence of public service group；According to the corresponding default calling of public service group
Sequence determines the calling sequence of each destination service node.
In one embodiment, above-mentioned apparatus further include: number of threads determining module, for obtaining in current production set
The history application quantity of each product；Current production collection is determined according to the history application quantity of product each in current production set
The number of threads of the corresponding thread pool of each product in conjunction.
In one embodiment, destination service node determining module is also used to segment process description information, and right
Word segmentation result is filtered；Candidate keywords figure is established according to the word obtained after filtering, and obtains word section in candidate keywords figure
The default initial weight of point；According to default initial weight loop iteration candidate keywords figure, until being obtained when reaching preset condition
Word node weights；To word node weights Bit-reversed, the word of present count is obtained as keyword according to ranking results.
The specific restriction of device about process resource acquisition request, which may refer to obtain above for process resource, asks
The restriction for the method asked, details are not described herein.Modules in the device of above-mentioned process resource acquisition request can whole or portion
Divide and is realized by software, hardware and combinations thereof.Above-mentioned each module can be embedded in the form of hardware or independently of computer equipment
In processor in, can also be stored in a software form in the memory in computer equipment, in order to processor calling hold
The corresponding operation of the above modules of row.
In one embodiment, a kind of computer equipment is provided, which can be server, internal junction
Composition can be as shown in Figure 5.The computer equipment include by system bus connect processor, memory, network interface and
Database.Wherein, the processor of the computer equipment is for providing calculating and control ability.The memory packet of the computer equipment
Include non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with operating system and computer program.This is interior
Memory provides environment for the operation of operating system and computer program in non-volatile memory medium.The computer equipment
Network interface is used to communicate with external terminal by network connection.To realize one kind when the computer program is executed by processor
The method of process resource acquisition request.
It will be understood by those skilled in the art that structure shown in Fig. 5, only part relevant to application scheme is tied
The block diagram of structure does not constitute the restriction for the computer equipment being applied thereon to application scheme, specific computer equipment
It may include perhaps combining certain components or with different component layouts than more or fewer components as shown in the figure.
In one embodiment, a kind of computer equipment, including memory and processor are provided, which is stored with
Computer program, which performs the steps of when executing computer program receives resource acquisition request, resource acquisition request
Middle carrying product identification information；Resource acquisition is requested in the corresponding application queue of write-in product identification information；From application queue
Idle thread is determined in corresponding thread pool；It calls idle thread to read resource acquisition request from application queue, and is reading
To after resource acquisition request, target corresponding with the resource acquisition request read is called to take according to predetermined calling sequence
Business node, to respond the resource acquisition read request.
In one embodiment, receive resource acquisition request before, processor execute computer program when also realize with
Lower step: the corresponding process description information of product to be developed is obtained；Keyword extraction is carried out to process description information, by extraction
Keyword corresponding with public service node each in preset public service node set is matched keyword respectively, is obtained
The corresponding matching degree of each public service node；It will be more than of preset threshold when there is the matching degree more than preset threshold
It is determined as the corresponding destination service node of product to be developed with corresponding public service node is spent.
In one embodiment, receive resource acquisition request before, processor execute computer program when also realize with
Lower step: public service group belonging to destination service node is determined；Obtain the corresponding default calling sequence of public service group；According to
The corresponding default calling sequence of public service group determines the calling sequence of each destination service node.
In one embodiment, before determining idle thread in the corresponding thread pool of application queue, processor is executed
The history application quantity for obtaining each product in current production set is also performed the steps of when computer program；According to current
The history application quantity of each product determines the number of threads of the corresponding thread pool of each product in product set.
In one embodiment, keyword extraction is carried out to process description information, comprising: divide process description information
Word, and word segmentation result is filtered；Candidate keywords figure is established according to the word obtained after filtering, and obtains candidate keywords figure
The default initial weight of middle word node；According to default initial weight loop iteration candidate keywords figure, until reaching preset condition
When, obtain word node weights；To word node weights Bit-reversed, the word of present count is obtained as keyword according to ranking results.
In one embodiment, a kind of computer readable storage medium is provided, computer program is stored thereon with, is calculated
Machine program performs the steps of when being executed by processor receives resource acquisition request, carries product identification in resource acquisition request
Information；Resource acquisition is requested in the corresponding application queue of write-in product identification information；From the corresponding thread pool of application queue
Determine idle thread；It calls idle thread to read resource acquisition request from application queue, and is reading resource acquisition request
Afterwards, destination service node corresponding with the resource acquisition request read is called according to predetermined calling sequence, with response
The resource acquisition request read.
In one embodiment, it before receiving resource acquisition request, is also realized when computer program is executed by processor
Following steps: the corresponding process description information of product to be developed is obtained；Keyword extraction is carried out to process description information, will be extracted
Keyword keyword corresponding with public service node each in preset public service node set is matched respectively, obtain
To the corresponding matching degree of each public service node；It will be more than preset threshold when there is the matching degree more than preset threshold
The corresponding public service node of matching degree is determined as the corresponding destination service node of product to be developed.
In one embodiment, it before receiving resource acquisition request, is also realized when computer program is executed by processor
Following steps: public service group belonging to destination service node is determined；Obtain the corresponding default calling sequence of public service group；Root
The calling sequence of each destination service node is determined according to the corresponding default calling sequence of public service group.
In one embodiment, from the corresponding thread pool of application queue determine idle thread before, computer program
The history application quantity for obtaining each product in current production set is also performed the steps of when being executed by processor；According to working as
The history application quantity of each product determines the number of threads of the corresponding thread pool of each product in preceding product set.
In one embodiment, keyword extraction is carried out to process description information, comprising: divide process description information
Word, and word segmentation result is filtered；Candidate keywords figure is established according to the word obtained after filtering, and obtains candidate keywords figure
The default initial weight of middle word node；According to default initial weight loop iteration candidate keywords figure, until reaching preset condition
When, obtain word node weights；To word node weights Bit-reversed, the word of present count is obtained as keyword according to ranking results.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the computer program can be stored in a non-volatile computer
In read/write memory medium, the computer program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein,
To any reference of memory, storage, database or other media used in each embodiment provided herein,
Including non-volatile and/or volatile memory.Nonvolatile memory may include read-only memory (ROM), programming ROM
(PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM) or flash memory.Volatile memory may include
Random access memory (RAM) or external cache.By way of illustration and not limitation, RAM is available in many forms,
Such as static state RAM (SRAM), dynamic ram (DRAM), synchronous dram (SDRAM), double data rate sdram (DDRSDRAM), enhancing
Type SDRAM (ESDRAM), synchronization link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM
(RDRAM), direct memory bus dynamic ram (DRDRAM) and memory bus dynamic ram (RDRAM) etc..
Each technical characteristic of above embodiments can be combined arbitrarily, for simplicity of description, not to above-described embodiment
In each technical characteristic it is all possible combination be all described, as long as however, the combination of these technical characteristics be not present lance
Shield all should be considered as described in this specification.
The several embodiments of the application above described embodiment only expresses, the description thereof is more specific and detailed, but simultaneously
It cannot therefore be construed as limiting the scope of the patent.It should be pointed out that coming for those of ordinary skill in the art
It says, without departing from the concept of this application, various modifications and improvements can be made, these belong to the protection of the application
Range.Therefore, the scope of protection shall be subject to the appended claims for the application patent.
Claims (10)
1. a kind of method of process resource acquisition request, which comprises
Resource acquisition request is received, carries product identification information in the resource acquisition request；
Resource acquisition request is written in the corresponding application queue of the product identification information；
Idle thread is determined from the corresponding thread pool of the application queue；
It calls the idle thread to read resource acquisition request from the application queue, and is reading resource acquisition request
Afterwards, destination service node corresponding with the resource acquisition request read is called according to predetermined calling sequence, with
Respond the resource acquisition request read.
2. the method according to claim 1, wherein before reception resource acquisition request, comprising:
Obtain the corresponding process description information of product to be developed；
To the process description information carry out keyword extraction, by the keyword of extraction respectively with preset public service section
The corresponding keyword of each public service node is matched in point set, obtains the corresponding matching of each public service node
Degree；
It will be more than the corresponding public service node of the matching degree of preset threshold when there is the matching degree more than preset threshold
It is determined as the corresponding destination service node of the product to be developed.
3. the method according to claim 1, wherein before reception resource acquisition request, further includes:
Determine public service group belonging to the destination service node；
Obtain the corresponding default calling sequence of the public service group；
The calling sequence of each destination service node is determined according to the corresponding default calling sequence of the public service group.
4. according to claim 1 to method described in 3 any one, which is characterized in that described corresponding from the application queue
Thread pool in determine idle thread before, comprising:
Obtain the history application quantity of each product in current production set；
Each production in the current production set is determined according to the history application quantity of each product in the current production set
The number of threads of the corresponding thread pool of product.
5. according to the method described in claim 2, it is characterized in that, described mention process description information progress keyword
It takes, comprising:
The process description information is segmented, and word segmentation result is filtered；
Establish candidate keywords figure according to the word obtained after filtering, and obtain word node in the candidate keywords figure it is default just
Beginning weight；
According to candidate keywords figure described in the default initial weight loop iteration, until obtaining word section when reaching preset condition
Point weight；
To institute's predicate node weights Bit-reversed, the word of present count is obtained as keyword according to ranking results.
6. a kind of device of process resource acquisition request, which is characterized in that described device includes:
Resource acquisition request receiving module carries product identification in the resource acquisition request for receiving resource acquisition request
Information；
Writing module is requested in resource acquisition, for the corresponding application of the product identification information to be written in resource acquisition request
In queue；
Idle thread determining module, for determining idle thread from the corresponding thread pool of the application queue；
Destination service node calling module is asked for calling the idle thread to read resource acquisition from the application queue
It asks, and after reading resource acquisition request, the resource acquisition called and read according to predetermined calling sequence
Corresponding destination service node is requested, to respond the resource acquisition read request.
7. device according to claim 6, which is characterized in that described device further include: destination service node determining module,
For obtaining the corresponding process description information of the product to be developed；Keyword extraction is carried out to the process description information, it will
Extract the keyword respectively keyword corresponding with public service node each in preset public service node set into
Row matching, obtains the corresponding matching degree of each public service node；It will be more than pre- when there is the matching degree more than preset threshold
If the corresponding public service node of the matching degree of threshold value is determined as the corresponding destination service node of the product to be developed.
8. device according to claim 6, which is characterized in that described device further include: calling sequence determining module is used for
Determine public service group belonging to the destination service node；Obtain the corresponding default calling sequence of the public service group；Root
The calling sequence of each destination service node is determined according to the corresponding default calling sequence of the public service group.
9. a kind of computer equipment, including memory and processor, the memory are stored with computer program, feature exists
In the step of processor realizes any one of claims 1 to 5 the method when executing the computer program.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
The step of method described in any one of claims 1 to 5 is realized when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811544380.XA CN109710402A (en) | 2018-12-17 | 2018-12-17 | Method, apparatus, computer equipment and the storage medium of process resource acquisition request |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811544380.XA CN109710402A (en) | 2018-12-17 | 2018-12-17 | Method, apparatus, computer equipment and the storage medium of process resource acquisition request |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109710402A true CN109710402A (en) | 2019-05-03 |
Family
ID=66256613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811544380.XA Pending CN109710402A (en) | 2018-12-17 | 2018-12-17 | Method, apparatus, computer equipment and the storage medium of process resource acquisition request |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109710402A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110321213A (en) * | 2019-07-08 | 2019-10-11 | 杭州港盛软件科技有限公司 | A kind of request processing method, device, equipment and readable storage medium storing program for executing |
| CN110427386A (en) * | 2019-08-05 | 2019-11-08 | 广州华多网络科技有限公司 | Data processing method, device and computer storage medium |
| CN111047187A (en) * | 2019-12-12 | 2020-04-21 | 浙江大搜车软件技术有限公司 | Information matching processing method and device, computer equipment and storage medium |
| CN111309466A (en) * | 2020-02-22 | 2020-06-19 | 苏州浪潮智能科技有限公司 | Multithreading scheduling method, system, equipment and medium based on cloud platform |
| CN111414259A (en) * | 2020-02-10 | 2020-07-14 | 北京声智科技有限公司 | Resource updating method, system, device, server and storage medium |
| CN111857992A (en) * | 2020-06-24 | 2020-10-30 | 厦门网宿有限公司 | Thread resource allocation method and device in Radosgw module |
| CN111897492A (en) * | 2020-07-15 | 2020-11-06 | 杭州海康威视系统技术有限公司 | Data processing method and device based on block device driver and electronic device |
| WO2020228449A1 (en) * | 2019-05-16 | 2020-11-19 | 华为技术有限公司 | Method and apparatus for node selection |
| CN112068961A (en) * | 2020-09-11 | 2020-12-11 | 北京车行一六八信息技术有限公司 | Information resource allocation method, device, electronic device and storage medium |
| CN114006946A (en) * | 2021-10-29 | 2022-02-01 | 中国平安人寿保险股份有限公司 | Method, device and equipment for processing homogeneous resource request and storage medium |
| CN110764903B (en) * | 2019-09-19 | 2023-06-16 | 平安科技（深圳）有限公司 | Method, apparatus, device and storage medium for elastically performing heat container |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050015385A1 (en) * | 2003-07-17 | 2005-01-20 | David Chinner | Network filesystem asynchronous I/O scheduling |
| CN101808140A (en) * | 2010-03-19 | 2010-08-18 | 中国科学技术大学 | Method and device for service deployment |
| WO2013063955A1 (en) * | 2011-10-31 | 2013-05-10 | 中兴通讯股份有限公司 | Customer service system and customer service information pushing method |
| CN107341050A (en) * | 2016-04-28 | 2017-11-10 | 北京京东尚科信息技术有限公司 | Service processing method and device based on dynamic thread pool |
| CN107680588A (en) * | 2017-05-10 | 2018-02-09 | 平安科技（深圳）有限公司 | Intelligent sound air navigation aid, device and storage medium |
| CN107800768A (en) * | 2017-09-13 | 2018-03-13 | 平安科技（深圳）有限公司 | Open platform control method and system |
| CN107832126A (en) * | 2017-10-20 | 2018-03-23 | 平安科技（深圳）有限公司 | The method of adjustment and its terminal of a kind of thread |
| CN107861765A (en) * | 2017-06-26 | 2018-03-30 | 平安普惠企业管理有限公司 | Product configuration method, equipment and computer-readable recording medium |
| CN108319630A (en) * | 2017-07-05 | 2018-07-24 | 腾讯科技（深圳）有限公司 | Information processing method, device, storage medium and computer equipment |
| CN108846630A (en) * | 2018-05-25 | 2018-11-20 | 广州衡昊数据科技有限公司 | A kind of resource control system and method |
-
2018
- 2018-12-17 CN CN201811544380.XA patent/CN109710402A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050015385A1 (en) * | 2003-07-17 | 2005-01-20 | David Chinner | Network filesystem asynchronous I/O scheduling |
| CN101808140A (en) * | 2010-03-19 | 2010-08-18 | 中国科学技术大学 | Method and device for service deployment |
| WO2013063955A1 (en) * | 2011-10-31 | 2013-05-10 | 中兴通讯股份有限公司 | Customer service system and customer service information pushing method |
| CN107341050A (en) * | 2016-04-28 | 2017-11-10 | 北京京东尚科信息技术有限公司 | Service processing method and device based on dynamic thread pool |
| CN107680588A (en) * | 2017-05-10 | 2018-02-09 | 平安科技（深圳）有限公司 | Intelligent sound air navigation aid, device and storage medium |
| CN107861765A (en) * | 2017-06-26 | 2018-03-30 | 平安普惠企业管理有限公司 | Product configuration method, equipment and computer-readable recording medium |
| CN108319630A (en) * | 2017-07-05 | 2018-07-24 | 腾讯科技（深圳）有限公司 | Information processing method, device, storage medium and computer equipment |
| CN107800768A (en) * | 2017-09-13 | 2018-03-13 | 平安科技（深圳）有限公司 | Open platform control method and system |
| CN107832126A (en) * | 2017-10-20 | 2018-03-23 | 平安科技（深圳）有限公司 | The method of adjustment and its terminal of a kind of thread |
| CN108846630A (en) * | 2018-05-25 | 2018-11-20 | 广州衡昊数据科技有限公司 | A kind of resource control system and method |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11861341B2 (en) | 2019-05-16 | 2024-01-02 | Huawei Technologies Co., Ltd. | Node selection method and apparatus |
| WO2020228449A1 (en) * | 2019-05-16 | 2020-11-19 | 华为技术有限公司 | Method and apparatus for node selection |
| CN110321213A (en) * | 2019-07-08 | 2019-10-11 | 杭州港盛软件科技有限公司 | A kind of request processing method, device, equipment and readable storage medium storing program for executing |
| CN110427386A (en) * | 2019-08-05 | 2019-11-08 | 广州华多网络科技有限公司 | Data processing method, device and computer storage medium |
| CN110427386B (en) * | 2019-08-05 | 2023-09-19 | 广州方硅信息技术有限公司 | Data processing method, device and computer storage medium |
| CN110764903B (en) * | 2019-09-19 | 2023-06-16 | 平安科技（深圳）有限公司 | Method, apparatus, device and storage medium for elastically performing heat container |
| CN111047187A (en) * | 2019-12-12 | 2020-04-21 | 浙江大搜车软件技术有限公司 | Information matching processing method and device, computer equipment and storage medium |
| CN111047187B (en) * | 2019-12-12 | 2023-10-17 | 浙江大搜车软件技术有限公司 | Information matching processing method, device, computer equipment and storage medium |
| CN111414259A (en) * | 2020-02-10 | 2020-07-14 | 北京声智科技有限公司 | Resource updating method, system, device, server and storage medium |
| CN111309466A (en) * | 2020-02-22 | 2020-06-19 | 苏州浪潮智能科技有限公司 | Multithreading scheduling method, system, equipment and medium based on cloud platform |
| CN111857992B (en) * | 2020-06-24 | 2024-04-16 | 厦门网宿有限公司 | Method and device for allocating linear resources in Radosgw module |
| CN111857992A (en) * | 2020-06-24 | 2020-10-30 | 厦门网宿有限公司 | Thread resource allocation method and device in Radosgw module |
| CN111897492B (en) * | 2020-07-15 | 2023-02-28 | 杭州海康威视系统技术有限公司 | Data processing method and device based on block device driver and electronic device |
| CN111897492A (en) * | 2020-07-15 | 2020-11-06 | 杭州海康威视系统技术有限公司 | Data processing method and device based on block device driver and electronic device |
| CN112068961A (en) * | 2020-09-11 | 2020-12-11 | 北京车行一六八信息技术有限公司 | Information resource allocation method, device, electronic device and storage medium |
| CN114006946B (en) * | 2021-10-29 | 2023-08-29 | 中国平安人寿保险股份有限公司 | Method, device, equipment and storage medium for processing homogeneous resource request |
| CN114006946A (en) * | 2021-10-29 | 2022-02-01 | 中国平安人寿保险股份有限公司 | Method, device and equipment for processing homogeneous resource request and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109710402A (en) | Method, apparatus, computer equipment and the storage medium of process resource acquisition request | |
| US11526799B2 (en) | Identification and application of hyperparameters for machine learning | |
| CN108595157B (en) | Block chain data processing method, device, equipment and storage medium | |
| CN109325118A (en) | Uneven sample data preprocess method, device and computer equipment | |
| CN110609737A (en) | Associated data query method and device, computer equipment and storage medium | |
| CN110458644A (en) | A kind of information processing method and relevant device | |
| CN109785867A (en) | Double record process configuration methods, device, computer equipment and storage medium | |
| CN113268328A (en) | Batch processing method and device, computer equipment and storage medium | |
| CN112363814A (en) | Task scheduling method and device, computer equipment and storage medium | |
| CN109582834B (en) | Data risk prediction method and device | |
| CN110930106A (en) | Information processing method, device and system of online interview system | |
| CN115378806A (en) | Flow distribution method and device, computer equipment and storage medium | |
| CN113111078B (en) | Resource data processing method and device, computer equipment and storage medium | |
| WO2019062087A1 (en) | Attendance check data testing method, terminal and device, and computer readable storage medium | |
| CN113627514A (en) | Data processing method and device of knowledge graph, electronic equipment and storage medium | |
| CN112732819A (en) | ETL-based data processing method, device, equipment and storage medium | |
| CN110619275A (en) | Information pushing method and device, computer equipment and storage medium | |
| CN113806372B (en) | New data information construction method, device, computer equipment and storage medium | |
| CN114240683A (en) | Group creation method, group creation device, computer equipment and storage medium | |
| CN115098686A (en) | Grading information determination method and device and computer equipment | |
| CN117251468A (en) | Query processing method, device, computer equipment and storage medium | |
| CN117391330A (en) | Financial business handling sequence determining method, device and computer equipment | |
| CN116739673A (en) | Prediction method, device, equipment and storage medium for financial products to be recommended | |
| CN116483501A (en) | Method and device for displaying software application, electronic equipment and storage medium | |
| CN117370271A (en) | File writing method, device, equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |